Relatively precomplete numerations and arithmetic

DOI10.1007/BF00284977zbMath0498.03046OpenAlexW2084753590MaRDI QIDQ1171055

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

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

Related Items (15)

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

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