Maximum Schemes in Arithmetic

Mathematical Logic Quarterly 40 (3):425-430 (1994)
  Copy   BIBTEX

Abstract

In this paper we deal with some new axiom schemes for Peano's Arithmetic that can substitute the classical induction, least-element, collection and strong collection schemes in the description of PA

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 92,611

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

Strong analogues of Martin's axiom imply axiom R.Robert E. Beaudoin - 1987 - Journal of Symbolic Logic 52 (1):216-218.
On Interpretations of Arithmetic and Set Theory.Richard Kaye & Tin Lok Wong - 2007 - Notre Dame Journal of Formal Logic 48 (4):497-510.
The axiom of choice.John L. Bell - 2008 - Stanford Encyclopedia of Philosophy.
The Theory of $\kappa$ -like Models of Arithmetic.Richard Kaye - 1995 - Notre Dame Journal of Formal Logic 36 (4):547-559.

Analytics

Added to PP
2013-12-01

Downloads
26 (#615,896)

6 months
5 (#649,144)

Historical graph of downloads
How can I increase my downloads?

Author Profiles

Alonso Fernandez
Universidad Panamericana Sede México

Citations of this work

No citations found.

Add more citations

References found in this work

Models of Peano Arithmetic.Richard Kaye - 1991 - Clarendon Press.

Add more references