The∀∃ theory of Peano Σ1 sentences

Journal of Mathematical Logic 8 (2):251-280 (2008)
  Copy   BIBTEX

Abstract

We present a decision procedure for the ∀∃ theory of the lattice of Σ1 sentences of Peano Arithmetic.

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 94,549

External links

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

Through your library

Similar books and articles

The ∀∃ theory of peano σ1 sentences.Per Lindström & V. Yu Shavrukov - 2008 - Journal of Mathematical Logic 8 (2):251-280.
Corrigendum: The ∀∃ theory of Peano Σ1 sentences.V. Yu Shavrukov - 2017 - Journal of Mathematical Logic 17 (1):1792001.
The provability logic for Σ1-interpolability.Konstantin N. Ignatiev - 1993 - Annals of Pure and Applied Logic 64 (1):1-25.
Subrecursive degrees and fragments of Peano Arithmetic.Lars Kristiansen - 2001 - Archive for Mathematical Logic 40 (5):365-397.
Injecting uniformities into Peano arithmetic.Fernando Ferreira - 2009 - Annals of Pure and Applied Logic 157 (2-3):122-129.

Analytics

Added to PP
2014-03-13

Downloads
40 (#394,791)

6 months
4 (#1,052,953)

Historical graph of downloads
How can I increase my downloads?

References found in this work

Classical Recursion Theory.Peter G. Hinman - 2001 - Bulletin of Symbolic Logic 7 (1):71-73.
Aspects of Incompleteness.Per Lindström - 1999 - Studia Logica 63 (3):438-439.
Distributive Lattices.Raymond Balbes & Philip Dwinger - 1977 - Journal of Symbolic Logic 42 (4):587-588.
Effectively inseparable Boolean algebras in lattices of sentences.V. Yu Shavrukov - 2010 - Archive for Mathematical Logic 49 (1):69-89.

View all 7 references / Add more references