An Undecidable Arithmetical Statement

Journal of Symbolic Logic 19 (2):118-119 (1954)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.2307/2268868

Links

PhilArchive



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

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

Review: Andrzej Mostowski, An Undecidable Arithmetical Statement. [REVIEW]Martin Davis - 1954 - Journal of Symbolic Logic 19 (2):118-119.
Review: N. A. Sanin, Some Operations on Logico-Arithmetical Formulas; N. A. Sanin, On Imbeddings of the Classical Logico-Arithmetical Calculus into the Constructive Logico-Arithmetical Calculus. [REVIEW]Andrzej Mostowski - 1954 - Journal of Symbolic Logic 19 (4):297-298.
Generic Complexity of Undecidable Problems.Alexei G. Myasnikov & Alexander N. Rybalov - 2008 - Journal of Symbolic Logic 73 (2):656 - 673.
Predicate provability logic with non-modalized quantifiers.Giorgie Dzhaparidze - 1991 - Studia Logica 50 (1):149 - 160.
Some strongly undecidable natural arithmetical problems, with an application to intuitionistic theories.Panu Raatikainen - 2003 - Journal of Symbolic Logic 68 (1):262-266.
Undecidable extensions of Skolem arithmetic.Alexis Bès & Denis Richard - 1998 - Journal of Symbolic Logic 63 (2):379-401.
Arithmetical Reflection and the Provability of Soundness.Walter Dean - 2015 - Philosophia Mathematica 23 (1):31-64.
A Non-arithmetical Gödel Logic.Peter Hájek - 2005 - Logic Journal of the IGPL 13 (4):435-441.
On Undecidable Propositions in Formalized Systems of Mathematics.Andrzej Mostowski - 1947 - Journal of Symbolic Logic 12 (2):60-60.
Derived sequences and reverse mathematics.Jeffry L. Hirst - 1993 - Mathematical Logic Quarterly 39 (1):447-453.
A generalization of conservativity theorem for classical versus intuitionistic arithmetic.Stefano Berardi - 2004 - Mathematical Logic Quarterly 50 (1):41.
Review: Andrzej Mostowski, On Undecidable Propositions in Formalized Systems of Mathematics. [REVIEW]S. Ulam - 1947 - Journal of Symbolic Logic 12 (2):60-60.
Socrates did it before Gödel.Josef Wolfgang Degen - 2011 - Logic and Logical Philosophy 20 (3):205-214.
Finite combinatory processes. Formulation I.Alonzo Church - 1965 - In Martin Davis (ed.), The Undecidable: Basic Papers on Undecidable Propositions, Unsolvable Problems, and Computable Functions. Dover Publication. pp. 289.
Undecidable wreath products and skew power series fields.Françoise Delon & Patrick Simonetta - 1998 - Journal of Symbolic Logic 63 (1):237-246.

Analytics

Added to PP
2015-02-05

Downloads
17 (#819,600)

6 months
6 (#431,022)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Strong axioms of infinity and elementary embeddings.Robert M. Solovay - 1978 - Annals of Mathematical Logic 13 (1):73.
Skolem's paradox and constructivism.Charles McCarty & Neil Tennant - 1987 - Journal of Philosophical Logic 16 (2):165 - 202.
Kurt gödel.Juliette Kennedy - 2008 - Stanford Encyclopedia of Philosophy.
Ordinal definability in the rank hierarchy.John W. Dawson - 1973 - Annals of Mathematical Logic 6 (1):1.

Add more citations

References found in this work

No references found.

Add more references