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.

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 101,369

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Analytics

Added to PP
2009-01-28

Downloads
65 (#327,911)

6 months
11 (#359,362)

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