Relatively precomplete numerations and arithmetic

DOI10.1007/BF00284977MaRDI QIDQ1171055zbMATH OpenOpenAlexFDO

Authors Franco Montagna

Publication date 1982

Published in Journal of Philosophical Logic (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf00284977

zbMATH Keywords

extremely undecidable PA sentencesformalized arithmeticprovable equivalence

Mathematics Subject Classification ID

Theory of numerations, effectively presented structures (03D45) First-order arithmetic and fragments (03F30)

Cited in

(15)

• Effective inseparability and its applications
• Generic generalized Rosser fixed points
• A note on uniform density in weak arithmetical theories
• A survey on universal computably enumerable equivalence relations
• Remarks on Uniformly Finitely Precomplete Positive Equivalences
• Precomplete numberings
• EFFECTIVE INSEPARABILITY, LATTICES, AND PREORDERING RELATIONS
• Weakly precomplete computably enumerable equivalence relations
• Universal computably enumerable equivalence relations
• Jumps of computably enumerable equivalence relations
• Word problems and ceers
• The provability logics of recursively enumerable theories extending Peano arithmetic at arbitrary theories extending Peano arithmetic
• Graphs realised by r.e. equivalence relations
• Obituary: Franco Montagna (1948--2015)
• The theory of ceers computes true arithmetic

This page was built for publication: Relatively precomplete numerations and arithmetic

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