Softcover ISBN:  9780821810415 
Product Code:  COLL/41 
List Price:  $99.00 
MAA Member Price:  $89.10 
AMS Member Price:  $79.20 
eBook ISBN:  9781470431877 
Product Code:  COLL/41.E 
List Price:  $89.00 
MAA Member Price:  $80.10 
AMS Member Price:  $71.20 
Softcover ISBN:  9780821810415 
eBook: ISBN:  9781470431877 
Product Code:  COLL/41.B 
List Price:  $188.00 $143.50 
MAA Member Price:  $169.20 $129.15 
AMS Member Price:  $150.40 $114.80 
Softcover ISBN:  9780821810415 
Product Code:  COLL/41 
List Price:  $99.00 
MAA Member Price:  $89.10 
AMS Member Price:  $79.20 
eBook ISBN:  9781470431877 
Product Code:  COLL/41.E 
List Price:  $89.00 
MAA Member Price:  $80.10 
AMS Member Price:  $71.20 
Softcover ISBN:  9780821810415 
eBook ISBN:  9781470431877 
Product Code:  COLL/41.B 
List Price:  $188.00 $143.50 
MAA Member Price:  $169.20 $129.15 
AMS Member Price:  $150.40 $114.80 

Book DetailsColloquium PublicationsVolume: 41; 1987; 318 ppMSC: Primary 03
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 firstorder 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 settheoretic membership) by repeated applications of four operators that are analogues of the wellknown 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 appear limited in its powers of expression and proof, this book proves quite the opposite. The authors show that it provides a framework for the formalization of practically all known systems of set theory, and hence for the development of all classical mathematics.
The book contains numerous applications of the main results to diverse areas of foundational research: propositional logic; semantics; firstorder logics with finitely many variables; definability and axiomatizability questions in set theory, Peano arithmetic, and real number theory; representation and decision problems in the theory of relation algebras; and decision problems in equational logic.

Table of Contents

Chapters

Chapter 1. The formalism $\mathcal L$of predicate logic

Chapter 2. The formalism $\mathcal L^+$, a definitional extension of $\mathcal L$

Chapter 3. The formalism $\mathcal L^+$ without variables and the problem of its equipollence with $\mathcal L$

Chapter 4. The relative equipollence of $\mathcal L$ and $\mathcal L^+$, and the formalization of set theory in $\mathcal L^\times $

Chapter 5. Some improvements of the equipollence results

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

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

Chapter 8. Applications to relation algebras and to varieties of algebras


RequestsReview Copy – for publishers of book reviewsPermission – for use of book, eBook, or Journal contentAccessibility – to request an alternate format of an AMS title
 Book Details
 Table of Contents
 Requests
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 firstorder 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 settheoretic membership) by repeated applications of four operators that are analogues of the wellknown 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 appear limited in its powers of expression and proof, this book proves quite the opposite. The authors show that it provides a framework for the formalization of practically all known systems of set theory, and hence for the development of all classical mathematics.
The book contains numerous applications of the main results to diverse areas of foundational research: propositional logic; semantics; firstorder logics with finitely many variables; definability and axiomatizability questions in set theory, Peano arithmetic, and real number theory; representation and decision problems in the theory of relation algebras; and decision problems in equational logic.

Chapters

Chapter 1. The formalism $\mathcal L$of predicate logic

Chapter 2. The formalism $\mathcal L^+$, a definitional extension of $\mathcal L$

Chapter 3. The formalism $\mathcal L^+$ without variables and the problem of its equipollence with $\mathcal L$

Chapter 4. The relative equipollence of $\mathcal L$ and $\mathcal L^+$, and the formalization of set theory in $\mathcal L^\times $

Chapter 5. Some improvements of the equipollence results

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

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

Chapter 8. Applications to relation algebras and to varieties of algebras