The foundations of arithmetic in finite bounded Zermelo set theory

Cahiers du Centre de Logique 17:99-118 (2010)
  Copy   BIBTEX


In this paper, I pursue such a logical foundation for arithmetic in a variant of Zermelo set theory that has axioms of subset separation only for quantifier-free formulae, and according to which all sets are Dedekind finite. In section 2, I describe this variant theory, which I call ZFin0. And in section 3, I sketch foundations for arithmetic in ZFin0 and prove that certain foundational propositions that are theorems of the standard Zermelian foundation for arithmetic are independent of ZFin0.<br><br>An equivalent theory of sets and an equivalent foundation for arithmetic was introduced by John Mayberry and developed by the current author in his doctoral thesis. In that thesis, the independence results mentioned above are proved using proof-theoretic methods. In this paper, I offer model-theoretic proofs of the central independence results using the technique of cumulation models, which was introduced by Steve Popham, a doctoral student of Mayberry<br>from the early 1980s.



    Upload a copy of this work     Papers currently archived: 79,826

External links

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

Through your library


Added to PP

209 (#66,377)

6 months
2 (#320,057)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Richard Pettigrew
Bristol University

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references