Abstract
The paper contains an axiomatic treatment of the intuitionistic theory of hereditarily finite sets, based on an induction axiom-schema and a finite set of single axioms. The main feature of the principle of induction used (due to Givant and Tarski) is that it incorporates Foundation. On the analogy of what is done in Arithmetic, in the axiomatic system selected the transitive closure of the membership relation is taken as a primitive notion, so as to permit an immediate adaptation of the theory to cases of restricted induction (in particular primitive recursive induction). At the end of the paper several different forms of induction, which play an important role in the development of the theory, are compared. An alternative axiomatization of the theory, which is of intrinsic interest, is also discussed.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Barwise, J.: Admissible sets and structures. Berlin Heidelberg New York: Springe 1975
Givant, S., Tarski, A.: Peano arithmetic and the Zermelo-like theory of sets with finite ranks. Abstr. Am. Math. Soc. 77T-E51, 1977
Kleene, S.C.: Introduction to metamathematics. Amsterdam: North-Holland 1964
Sochor, A.: Metamathematics of the alternative set theory. I. Comment. Math. Univ. Carolinae20, 697–772 (1979)
Tarski, A.: Sur les ensembles finis. Fund. Math6, 45–95 (1924)
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Previale, F. Induction and foundation in the theory of hereditarily finite sets. Arch Math Logic 33, 213–241 (1994). https://doi.org/10.1007/BF01203033
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01203033