scientific article; zbMATH DE number 4061229

MaRDI QIDQ3795673zbMATH OpenFDO

Authors Sergei Artemov

Publication date 1988

zbMATH Keywords

degrees of unsolvabilityextensions of Peano arithmeticTuring degree

Mathematics Subject Classification ID

Other degrees and reducibilities in computability and recursion theory (03D30) Relative consistency and interpretations (03F25) First-order arithmetic and fragments (03F30)

Recommendations

• Two theorems on degrees of models of true arithmetic
• scientific article; zbMATH DE number 2222018
• The arithmetic and Turing degrees are not elementarily equivalent
• Minimality and completions of PA
• scientific article; zbMATH DE number 2222023

Cited in

(4)

• On the structure of the degrees of relative provability
• Undecidable extensions of Büchi arithmetic and Cobham-Semënov Theorem
• Turing-Taylor expansions for arithmetic theories
• Honest elementary degrees and degrees of relative provability without the cupping property

This page was built for publication:

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