Relatively precomplete numerations and arithmetic

DOI10.1007/BF00284977zbMath0498.03046MaRDI 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 sentences; formalized arithmetic; provable equivalence

Mathematics Subject Classification ID

03F30: First-order arithmetic and fragments

03D45: Theory of numerations, effectively presented structures

Related Items

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