- 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
The∀∃ theory of Peano Σ1 sentences
Journal of Mathematical Logic 8 (2):251-280 (2008)
Abstract
We present a decision procedure for the ∀∃ theory of the lattice of Σ1 sentences of Peano Arithmetic.Links
PhilArchive
External links
(no proxy)
Setup an account with your affiliations in order to access resources via your University's proxy server
Through your library
- Sign in / register and customize your OpenURL resolver
- Configure custom resolver
My notes
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.
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.
Analytics
Added to PP
2014-03-13
Downloads
40 (#410,576)
6 months
4 (#862,832)
2014-03-13
Downloads
40 (#410,576)
6 months
4 (#862,832)
Historical graph of downloads
Citations of this work
Hierarchical Incompleteness Results for Arithmetically Definable Extensions of Fragments of Arithmetic.Rasmus Blanck - 2021 - Review of Symbolic Logic 14 (3):624-644.
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.
On Shavrukov’s Non-Isomorphism Theorem for Diagonalizable Algebras.Evgeny A. Kolmakov - 2024 - Review of Symbolic Logic 17 (1):206-243.
Corrigendum: The ∀∃ theory of Peano Σ1 sentences.V. Yu Shavrukov - 2017 - Journal of Mathematical Logic 17 (1):1792001.
References found in this work
Distributive Lattices.Raymond Balbes & Philip Dwinger - 1977 - Journal of Symbolic Logic 42 (4):587-588.
The intervals of the lattice of recursively enumerable sets determined by major subsets.Wolfgang Maass & Michael Stob - 1983 - Annals of Pure and Applied Logic 24 (2):189-212.
Effectively inseparable Boolean algebras in lattices of sentences.V. Yu Shavrukov - 2010 - Archive for Mathematical Logic 49 (1):69-89.
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-kfj6z uwo