Effectively extensible theories

DOI10.2307/2270052MaRDI QIDQ5569450zbMATH OpenOpenAlexFDO

Authors Marian Boykan Pour-El

Publication date 1968

Published in Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL https://doi.org/10.2307/2270052

zbMATH Keywords

recursion theory, constructive mathematics

Cites work

• Creative sets
• Deduction-preserving “recursive isomorphisms” between theories
• “Recursive isomorphism” and effectively extensible theories

Cited in

(5)

• Effectively inseparable Boolean algebras in lattices of sentences
• Strong reducibilities
• There are no minimal effectively inseparable theories
• Essential hereditary undecidability
• Pour-El's landscape

This page was built for publication: Effectively extensible theories

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