Degrees of insolubility of extensions of arithmetic by true propositions
From MaRDI portal
Publication:3813816
DOI10.1070/RM1988V043N02ABEH001708zbMATH Open0663.03047OpenAlexW2079493684MaRDI QIDQ3813816
Publication date: 1988
Published in: Russian Mathematical Surveys (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1070/rm1988v043n02abeh001708
First-order arithmetic and fragments (03F30) Other degrees and reducibilities in computability and recursion theory (03D30) Relative consistency and interpretations (03F25)
Related Items (6)
Undecidability of the structure of the Solovay degrees of c.e. reals ⋮ Some proofs of undecidability of arithmetic ⋮ Honest elementary degrees and degrees of relative provability without the cupping property ⋮ Undecidable extensions of Büchi arithmetic and Cobham-Semënov Theorem ⋮ Title not available (Why is that?) ⋮ A Uniformly, Extremely Nonextensional Formula of Arithmetic with many Undecidable Fixed Points in many Theories
This page was built for publication: Degrees of insolubility of extensions of arithmetic by true propositions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3813816)
