On the set of 'meaningful' sentences of arithmetic

Studia Logica 37 (3):237 - 241 (1978)
  Copy   BIBTEX

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 provable

Categories

Keywords

Reprint years

DOI

10.1007/bf02124725

Links

PhilArchive



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

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

Models without indiscernibles.Fred G. Abramson & Leo A. Harrington - 1978 - Journal of Symbolic Logic 43 (3):572-600.
On interpretations of bounded arithmetic and bounded set theory.Richard Pettigrew - 2009 - Notre Dame Journal of Formal Logic 50 (2):141-152.
On the derivability of instantiation properties.Harvey Friedman - 1977 - Journal of Symbolic Logic 42 (4):506-514.
Conservation.Harvey Friedman - manuscript
Self-reference and the languages of arithmetic.Richard Heck - 2007 - Philosophia Mathematica 15 (1):1-29.
Quantum Mathematics.J. Michael Dunn - 1980 - PSA: Proceedings of the Biennial Meeting of the Philosophy of Science Association 1980:512 - 531.
Sind die urteile der arithmetik synthetisch a priori?Pirmin Stekeler-Weithofer - 1987 - Journal for General Philosophy of Science / Zeitschrift für Allgemeine Wissenschaftstheorie 18 (1-2):215-238.
Incompleteness and inconsistency.Stewart Shapiro - 2002 - Mind 111 (444):817-832.

Analytics

Added to PP
2009-01-28

Downloads
40 (#396,692)

6 months
5 (#628,512)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Add more citations

References found in this work

Transfinite recursive progressions of axiomatic theories.Solomon Feferman - 1962 - Journal of Symbolic Logic 27 (3):259-316.

Add more references