A theorem on partial conservativity in arithmetic
From MaRDI portal
Publication:3083142
DOI10.2178/JSL/1294171003zbMATH Open1218.03033OpenAlexW1998522263MaRDI QIDQ3083142FDOQ3083142
Authors: Per Lindström
Publication date: 18 March 2011
Published in: Journal of Symbolic Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2178/jsl/1294171003
Recommendations
- On Guaspari's problem about partially conservative sentences
- Lindenbaum Algebras and Partial Conservativity
- scientific article; zbMATH DE number 5255443
- scientific article; zbMATH DE number 1531213
- scientific article; zbMATH DE number 3957097
- scientific article; zbMATH DE number 1062120
- scientific article; zbMATH DE number 4112583
- scientific article; zbMATH DE number 2014521
- Existentially Closed Models and Conservation Results in Bounded Arithmetic
- AXIOMATIZATIONS OF PEANO ARITHMETIC: A TRUTH-THEORETIC VIEW
First-order arithmetic and fragments (03F30) Gödel numberings and issues of incompleteness (03F40) Undecidability and degrees of sets of sentences (03D35) Relative consistency and interpretations (03F25)
Cites Work
Cited In (7)
- Partially generic formulas in arithmetic
- Lindenbaum Algebras and Partial Conservativity
- Dense chains of ${\Sigma}_n$ sentences with strong conservativity properties
- Title not available (Why is that?)
- Duality, non-standard elements, and dynamic properties of r.e. sets
- Title not available (Why is that?)
- Branches of the E -Tree which are not Isomorphic
This page was built for publication: A theorem on partial conservativity in arithmetic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3083142)