A mathematical incompleteness in Peano arithmetic

&
In Jon Barwise, 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

Other Versions

No versions found

View all bargains

Buy this book

Find it on Amazon.com

Links

PhilArchive

External links

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

Handbook of mathematical logic, edited by Barwise Jon with the cooperation of Keisler H. J., Kunen K., Moschovakis Y. N., and Troelstra A. S., Studies in logic and the foundations of mathematics, vol. 90, North-Holland Publishing Company, Amsterdam, New York, and Oxford, 1978 , xi + 1165 pp.Smoryński C.. D.1. The incompleteness theorems. Pp. 821–865.Schwichtenberg Helmut. D.2. Proof theory: some applications of cut-elimination. Pp. 867–895.Statman Richard. D.3. Herbrand's theorem and Gentzen's notion of a direct proof. Pp. 897–912.Feferman Solomon. D.4. Theories of finite type related to mathematical practice. Pp. 913–971.Troelstra A. S.. D.5. Aspects of constructive mathematics. Pp. 973–1052.Fourman Michael P.. D.6. The logic of topoi. Pp. 1053–1090.Barendregt Henk P.. D.1. The type free lambda calculus. Pp. 1091–1132.Paris Jeff and Harrington Leo. D.8. A mathematical incompleteness in Peano arithmetic. Pp. 1133–1142. [REVIEW]W. A. Howard - 1984 - Journal of Symbolic Logic 49 (3):980-988.
Mathematical Incompleteness Results in First-Order Peano Arithmetic: A Revisionist View of the Early History.Saul A. Kripke - 2021 - History and Philosophy of Logic 43 (2):175-182.
Appendix to the paper “Definable sets and expansions of models of Peano arithmetic”.Roman Murawski - 1990 - Archive for Mathematical Logic 30 (2):91-92.
A weakly definable type which is not definable.James H. Schmerl - 1993 - Archive for Mathematical Logic 32 (6):463-468.
Uniform self-reference.Raymond M. Smullyan - 1985 - Studia Logica 44 (4):439 - 445.
Definable sets and expansions of models of Peano arithmetic.Roman Murawski - 1988 - Archive for Mathematical Logic 27 (1):21-33.
On expandability of models of Peano arithmetic. I.Roman Murawski - 1976 - Studia Logica 35 (4):409-419.
Iterations of satisfaction classes and models of peano arithmetic.Roman Murawski - 1992 - Mathematical Logic Quarterly 38 (1):59-84.
The Collatz Conjecture through the Lens of the Nitescence Theorem: A Formal Resolution via Structural Ascension.Xavier J. Régent - unknown
The shortest definition of a number in Peano arithmetic.Dev K. Roy - 2003 - Mathematical Logic Quarterly 49 (1):83-86.

Analytics

Added to PP
2014-01-27

Downloads
15 (#1,947,693)

6 months
1 (#2,187,047)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Photo of Jeffrey Paris
Jeffrey Paris
University of Manchester

Citations of this work

Gödel's Incompleteness Theorems.Panu Raatikainen - 2013 - The Stanford Encyclopedia of Philosophy (Winter 2013 Edition), Edward N. Zalta (Ed.).
Infinity.Kenny Easwaran, Alan Hájek, Paolo Mancosu & Graham Oppy - 2021 - Stanford Encyclopedia of Philosophy.

View all 90 citations / Add more citations

References found in this work

No references found.

Add more references