A Formalization of Set Theory without Variables ( Colloquium Publications )

Publication series :Colloquium Publications

Author: Alfred Tarski;Steven Givant  

Publisher: American Mathematical Society‎

Publication year: 1987

E-ISBN: 9781470431877

P-ISBN(Hardback):  9780821810415

Subject: O144 Set Theory

Keyword: 暂无分类

Language: ENG

Access to resources Favorite

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

A Formalization of Set Theory without Variables

Description

Completed in 1983, this work culminates nearly half a century of the late Alfred Tarski's foundational studies in logic, mathematics, and the philosophy of science. Written in collaboration with Steven Givant, the book appeals to a very broad audience, and requires only a familiarity with first-order logic. It is of great interest to logicians and mathematicians interested in the foundations of mathematics, but also to philosophers interested in logic, semantics, algebraic logic, or the methodology of the deductive sciences, and to computer scientists interested in developing very simple computer languages rich enough for mathematical and scientific applications. The authors show that set theory and number theory can be developed within the framework of a new, different, and simple equational formalism, closely related to the formalism of the theory of relation algebras. There are no variables, quantifiers, or sentential connectives. Predicates are constructed from two atomic binary predicates (which denote the relations of identity and set-theoretic membership) by repeated applications of four operators that are analogues of the well-known operations of relative product, conversion, Boolean addition, and complementation. All mathematical statements are expressed as equations between predicates. There are ten logical axiom schemata and just one rule of inference: the one of replacing equals by equals, familiar from high school algebra. Though such a simple formalism may ap

Chapter

Title page

Contents

Explanation of section interdependence diagrams

Preface

The formalism ℒof predicate logic

The formalism ℒ⁺, a definitional extension of ℒ

The formalism ℒ⁺ without variables and the problem of its equipollence with ℒ

The relative equipollence of ℒ and ℒ⁺, and the formalization of set theory in ℒ^{×}

Some improvements of the equipollence results

Implications of the main results for semantic and axiomatic foundations of set theory

Extension of results to arbitrary formalisms of predicate logic, and applications to the formalization of the arithmetics of natural and real numbers

Applications to relation algebras and to varieties of algebras

Bibliography

Indices

Back Cover

The users who browse this book also browse


No browse record.