- New
-
Topics
- All Categories
- Metaphysics and Epistemology
- Value Theory
- Science, Logic, and Mathematics
- Science, Logic, and Mathematics
- Logic and Philosophy of Logic
- Philosophy of Biology
- Philosophy of Cognitive Science
- Philosophy of Computing and Information
- Philosophy of Mathematics
- Philosophy of Physical Science
- Philosophy of Social Science
- Philosophy of Probability
- General Philosophy of Science
- Philosophy of Science, Misc
- History of Western Philosophy
- Philosophical Traditions
- Philosophy, Misc
- Other Academic Areas
- Journals
- Submit material
- More
On the set of 'meaningful' sentences of arithmetic
Studia Logica 37 (3):237 - 241 (1978)
Abstract
I give several characterizations of the set V₀ proposed in [3] as the set of meaningful and true sentences of first order arthimetic, and show that in Peano arithmetic the Σ₂ completeness of V₀ is provableMy notes
Similar books and articles
On the set of ‘Meaningful’ sentences of arithmetic.Aldo Ursini - 1978 - Studia Logica 37 (3):237-241.
Truth in V for Ǝ ∀∀-Sentences Is Decidable.D. Bellé & F. Parlamento - 2006 - Journal of Symbolic Logic 71 (4):1200 - 1222.
On Wright’s Inductive Definition of Coherence Truth for Arithmetic.Jeffrey Ketland - 2003 - Analysis 63 (1):6-15.
On the Consistency of a Plural Theory of Frege’s Grundgesetze.Francesca Boccuni - 2011 - Studia Logica 97 (3):329-345.
On the Strength of Ramsey's Theorem.David Seetapun & Theodore A. Slaman - 1995 - Notre Dame Journal of Formal Logic 36 (4):570-582.
RETRACTED ARTICLE: The Twin Primes Conjecture is True in the Standard Model of Peano Arithmetic: Applications of Rasiowa–Sikorski Lemma in Arithmetic (I).Janusz Czelakowski - 2023 - Studia Logica 111 (2):357-358.
On interpretations of bounded arithmetic and bounded set theory.Richard Pettigrew - 2009 - Notre Dame Journal of Formal Logic 50 (2):141-152.
Effectively inseparable Boolean algebras in lattices of sentences.V. Yu Shavrukov - 2010 - Archive for Mathematical Logic 49 (1):69-89.
Analytics
Added to PP
2009-01-28
Downloads
40 (#113,921)
6 months
5 (#1,552,255)
2009-01-28
Downloads
40 (#113,921)
6 months
5 (#1,552,255)
Historical graph of downloads
Citations of this work
Nonmonotonicity in (the metamathematics of) arithmetic.Karl-Georg Niebergall - 1999 - Erkenntnis 50 (2-3):309-332.
References found in this work
Transfinite recursive progressions of axiomatic theories.Solomon Feferman - 1962 - Journal of Symbolic Logic 27 (3):259-316.
Review: R. O. Gandy, G. Kreisel, W. W. Tait, Set Existence. [REVIEW]Solomon Feferman - 1962 - Journal of Symbolic Logic 27 (2):232-233.
PhilPapers logo by Andrea Andrews and Meghan Driscoll.
This site uses cookies and Google Analytics (see our terms & conditions for details regarding the privacy implications). Use of this site is subject to terms & conditions.
All rights reserved by The PhilPapers Foundation
Server: philpapers-web-68866f4b87-zhzfn uwo