“Recursive isomorphism” and effectively extensible theories

DOI10.1090/S0002-9904-1965-11325-8zbMath0207.30903OpenAlexW2018651696MaRDI QIDQ5608005

Marian Boykan Pour-El

Publication date: 1965

Published in: Bulletin of the American Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1090/s0002-9904-1965-11325-8

Mathematics Subject Classification ID

Computability and recursion theory (03D99)

Related Items (3)

Deduction-preserving “recursive isomorphisms” between theories ⋮ Effectively extensible theories ⋮ Myhill's work in recursion theory

Cites Work

• Undecidable theories
• Theory of Formal Systems. (AM-47)
• Creative sets

This page was built for publication: “Recursive isomorphism” and effectively extensible theories