A mathematical incompleteness in Peano arithmetic

&
In Jon Barwise (ed.), Handbook of mathematical logic. New York: North-Holland. pp. 90--1133 (1977)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

Links

PhilArchive



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

External links

  • This entry has no external links. Add one.
Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

The shortest definition of a number in Peano arithmetic.Dev K. Roy - 2003 - Mathematical Logic Quarterly 49 (1):83-86.
Quantum Mathematics.J. Michael Dunn - 1980 - PSA: Proceedings of the Biennial Meeting of the Philosophy of Science Association 1980:512 - 531.
Expanding the additive reduct of a model of Peano arithmetic.Masahiko Murakami & Akito Tsuboi - 2003 - Mathematical Logic Quarterly 49 (4):363-368.
Iterations of satisfaction classes and models of peano arithmetic.Roman Murawski - 1992 - Mathematical Logic Quarterly 38 (1):59-84.
Nonstandard models that are definable in models of Peano Arithmetic.Kazuma Ikeda & Akito Tsuboi - 2007 - Mathematical Logic Quarterly 53 (1):27-37.
Equivalence of F with a sub-theory of peano arithmetic.Andrew Boucher - manuscript
Arithmetic and Logic Incompleteness: the Link.Laureano Luna & Alex Blum - 2008 - The Reasoner 2 (3):6.
Models without indiscernibles.Fred G. Abramson & Leo A. Harrington - 1978 - Journal of Symbolic Logic 43 (3):572-600.
Neo-fregeanism naturalized: The role of one-to-one correspondence in numerical cognition.Lieven Decock - 2008 - Behavioral and Brain Sciences 31 (6):648-649.
Uniform self-reference.Raymond M. Smullyan - 1985 - Studia Logica 44 (4):439 - 445.
Generic cuts in models of arithmetic.Richard Kaye - 2008 - Mathematical Logic Quarterly 54 (2):129-144.
Relatively Recursively Enumerable Versus Relatively Σ1 in Models of Peano Arithmetic.Grzegorz Michalski - 1995 - Mathematical Logic Quarterly 41 (4):515-522.
Can There be a Proof that an Unprovable Sentence of Arithmetic is True?Philip Hugly & Charles Sayward - 1989 - Dialectica 43 (43):289-292.
Interstitial and pseudo gaps in models of Peano Arithmetic.Ermek S. Nurkhaidarov - 2010 - Mathematical Logic Quarterly 56 (2):198-204.

Analytics

Added to PP
2014-01-27

Downloads
14 (#990,327)

6 months
1 (#1,471,470)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Jeffrey Paris
University of Manchester

Citations of this work

View all 55 citations / Add more citations

References found in this work

No references found.

Add more references