Deduction-preserving "Recursive Isomorphisms" between theories

DOI10.4064/FM-61-2-141-163MaRDI QIDQ5561954zbMATH OpenOpenAlexFDO

Authors Marian Boykan Pour-El, Saul A. Kripke

Publication date 1967

Published in Fundamenta Mathematicae (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

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

zbMATH Keywords

recursion theory, constructive mathematics

Cited in

(21)

• On \(\mathsf{Q}\)
• Some conservation results on weak König's lemma
• Provability algebras and proof-theoretic ordinals. I
• On a strengthening of the non-isomorphism theorem for provability algebras
• Uniform density in Lindenbaum algebras
• Effectively inseparable Boolean algebras in lattices of sentences
• Forcing for hat inductive definitions in arithmetic
• Kleene’s Amazing Second Recursion Theorem
• 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
• Current research on Gödel's incompleteness theorems
• Finding the limit of incompleteness. I
• EFFECTIVE INSEPARABILITY, LATTICES, AND PREORDERING RELATIONS
• Logische Kategorien
• Word problems and ceers
• ON SHAVRUKOV’S NON-ISOMORPHISM THEOREM FOR DIAGONALIZABLE ALGEBRAS
• Essential hereditary undecidability
• Saul Kripke (1940--2022)
• On the hierarchy of natural theories
• A note on the diagonalizable algebras of PA and ZF
• Mass problems associated with effectively closed sets

This page was built for publication: Deduction-preserving "Recursive Isomorphisms" between theories

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