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.

Categories

Keywords

Reprint years

DOI

10.1142/s0219061308000774

Other Versions

No versions found

Links

PhilArchive



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

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

Corrigendum: The ∀∃ theory of Peano Σ1 sentences.V. Yu Shavrukov - 2017 - Journal of Mathematical Logic 17 (1):1792001.
Peano Corto and Peano Basso: A Study of Local Induction in the Context of Weak Theories.Albert Visser - 2014 - Mathematical Logic Quarterly 60 (1-2):92-117.
Relatively Recursively Enumerable Versus Relatively Σ1 in Models of Peano Arithmetic.Grzegorz Michalski - 1995 - Mathematical Logic Quarterly 41 (4):515-522.
The provability logic for Σ1-interpolability.Konstantin N. Ignatiev - 1993 - Annals of Pure and Applied Logic 64 (1):1-25.
Complete, Recursively Enumerable Relations in Arithmetic.Giovanna D'Agostino & Mario Magnago - 1995 - Mathematical Logic Quarterly 41 (1):65-72.
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.
On partial disjunction properties of theories containing Peano arithmetic.Taishi Kurahashi - 2018 - Archive for Mathematical Logic 57 (7-8):953-980.
On the set of ‘Meaningful’ sentences of arithmetic.Aldo Ursini - 1978 - Studia Logica 37 (3):237-241.
The interpretability logic of peano arithmetic.Alessandro Berarducci - 1990 - Journal of Symbolic Logic 55 (3):1059-1089.

Analytics

Added to PP
2010-08-30

Downloads
102 (#206,830)

6 months
20 (#144,830)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Effectively inseparable Boolean algebras in lattices of sentences.V. Yu Shavrukov - 2010 - Archive for Mathematical Logic 49 (1):69-89.
Interpretability degrees of finitely axiomatized sequential theories.Albert Visser - 2014 - Archive for Mathematical Logic 53 (1-2):23-42.
Corrigendum: The ∀∃ theory of Peano Σ1 sentences.V. Yu Shavrukov - 2017 - Journal of Mathematical Logic 17 (1):1792001.

View all 7 citations / Add more citations

References found in this work

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 9 references / Add more references