Induction and foundation in the theory of hereditarily finite sets

Archive for Mathematical Logic 33 (3):213-241 (1994)
  Copy   BIBTEX

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

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,829

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Finiteness Axioms on Fragments of Intuitionistic Set Theory.Riccardo Camerlo - 2007 - Notre Dame Journal of Formal Logic 48 (4):473-488.
Finitary Set Theory.Laurence Kirby - 2009 - Notre Dame Journal of Formal Logic 50 (3):227-244.
A note on finiteness in the predicative foundations of arithmetic.Fernando Ferreira - 1999 - Journal of Philosophical Logic 28 (2):165-174.
Finite injury and Σ1-induction.Michael Mytilinaios - 1989 - Journal of Symbolic Logic 54 (1):38 - 49.
Decidability of ∃*∀∀-sentences in HF.D. Bellè & F. Parlamento - 2008 - Notre Dame Journal of Formal Logic 49 (1):55-64.
O indukcji niezupełnej w matematyce.Lech Gruszecki - 2005 - Roczniki Filozoficzne 53 (2):47-72.
A Note on Recursive Models of Set Theories.Domenico Zambella & Antonella Mancini - 2001 - Notre Dame Journal of Formal Logic 42 (2):109-115.
A hierarchy of hereditarily finite sets.Laurence Kirby - 2008 - Archive for Mathematical Logic 47 (2):143-157.
On Interpretations of Arithmetic and Set Theory.Richard Kaye & Tin Lok Wong - 2007 - Notre Dame Journal of Formal Logic 48 (4):497-510.
The Backward Induction Argument.John W. Carroll - 2000 - Theory and Decision 48 (1):61-84.
Hereditary undecidability of some theories of finite structures.Ross Willard - 1994 - Journal of Symbolic Logic 59 (4):1254-1262.

Analytics

Added to PP
2013-11-23

Downloads
36 (#443,144)

6 months
5 (#637,009)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

On Interpretations of Arithmetic and Set Theory.Richard Kaye & Tin Lok Wong - 2007 - Notre Dame Journal of Formal Logic 48 (4):497-510.
Finitary Set Theory.Laurence Kirby - 2009 - Notre Dame Journal of Formal Logic 50 (3):227-244.
Addition and multiplication of sets.Laurence Kirby - 2007 - Mathematical Logic Quarterly 53 (1):52-65.
A hierarchy of hereditarily finite sets.Laurence Kirby - 2008 - Archive for Mathematical Logic 47 (2):143-157.
Substandard models of finite set theory.Laurence Kirby - 2010 - Mathematical Logic Quarterly 56 (6):631-642.

View all 10 citations / Add more citations

References found in this work

Introduction to metamathematics.Stephen Cole Kleene - 1952 - Groningen: P. Noordhoff N.V..
Admissible Sets and Structures.Jon Barwise - 1978 - Studia Logica 37 (3):297-299.

Add more references