Partially Conservative Extensions of Arithmetic

DOI10.2307/1998258zbMATH Open0417.03030OpenAlexW4245664529MaRDI QIDQ3206949FDOQ3206949

Authors: David Guaspari 

Publication date: 1979

Full work available at URL: https://doi.org/10.2307/1998258

zbMATH Keywords

interpretabilitymodel-theoretic characterizationconservative extensionsrecursively enumerable extension of Peano arithmetic

Mathematics Subject Classification ID

First-order arithmetic and fragments (03F30) Models of other mathematical theories (03C65)

Cites Work

• Title not available (Why is that?)
• Arithmetization of metamathematics in a general setting
• On weak completeness of intuitionistic predicate logic
• Solution of a problem of Leon Henkin
• Gödel's diagonalization technique and related properties of theories
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• On interpretability in theories containing arithmetic

Cited In (21)

• A generalized notion of weak interpretability and the corresponding modal logic
• On \(\Sigma _ 1\) and \(\Pi _ 1\) sentences and degrees of interpretability
• The provability logic for \(\Sigma_ 1\)-interpolability
• Unary interpretability logics for sublogics of the interpretability logic \textbf{IL}
• Unifying the model theory of first-order and second-order arithmetic via \(\mathrm{WKL}_0^\ast\)
• Lindenbaum Algebras and Partial Conservativity
• On Guaspari's problem about partially conservative sentences
• The absorption law. Or: how to Kreisel a Hilbert-Bernays-Löb
• The formalization of interpretability
• Current research on Gödel's incompleteness theorems
• Hierarchical incompleteness results for arithmetically definable extensions of fragments of arithmetic
• Some observations on the FGH theorem
• The logic of \(\Pi_ 1\)-conservativity
• Marginalia on a theorem of Woodin
• Duality, non-standard elements, and dynamic properties of r.e. sets
• A course on bimodal provability logic
• The logic of linear tolerance
• Fixed point algebras
• Interpretability suprema in Peano arithmetic
• On partial disjunction properties of theories containing Peano arithmetic
• DISJUNCTION AND EXISTENCE PROPERTIES IN MODAL ARITHMETIC

This page was built for publication: Partially Conservative Extensions of Arithmetic

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3206949)