Deduction-preserving "Recursive Isomorphisms" between theories

DOI10.4064/fm-61-2-141-163zbMath0174.02003OpenAlexW1588094391MaRDI QIDQ5561954

Saul A. Kripke, Marian Boykan Pour-El

Publication date: 1967

Published in: Fundamenta Mathematicae (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/213983

zbMATH Keywords

recursion theory, constructive mathematics

Related Items

Provability algebras and proof-theoretic ordinals. I, Forcing for hat inductive definitions in arithmetic, Effectively inseparable Boolean algebras in lattices of sentences, Logische Kategorien, Word problems and ceers, ON SHAVRUKOV’S NON-ISOMORPHISM THEOREM FOR DIAGONALIZABLE ALGEBRAS, On \(\mathsf{Q}\), ON THE INEVITABILITY OF THE CONSISTENCY OPERATOR, A new model construction by making a detour via intuitionistic theories. I: Operational set theory without choice is \(\Pi_1\)-equivalent to KP, On a strengthening of the non-isomorphism theorem for provability algebras, A note on the diagonalizable algebras of PA and ZF, Uniform density in Lindenbaum algebras, CURRENT RESEARCH ON GÖDEL’S INCOMPLETENESS THEOREMS, Kleene’s Amazing Second Recursion Theorem, FINDING THE LIMIT OF INCOMPLETENESS I, Mass problems associated with effectively closed sets, Some conservation results on weak König's lemma, EFFECTIVE INSEPARABILITY, LATTICES, AND PREORDERING RELATIONS