Strongly constructive models and numerations of the Boolean algebra of recursive sets
From MaRDI portal
Publication:1219275
DOI10.1007/BF02219840zbMath0311.02051MaRDI QIDQ1219275
Publication date: 1973
Published in: Algebra and Logic (Search for Journal in Brave)
03C99: Model theory
03D25: Recursively (computably) enumerable sets and degrees
03G05: Logical aspects of Boolean algebras
03D99: Computability and recursion theory
03D60: Computability and recursion theory on ordinals, admissible sets, etc.
Related Items
THE LINDENBAUM ALGEBRA OF THE THEORY OF THE CLASS OF ALL FINITE MODELS, Index Sets of Constructive Models that are Autostable Under Strong Constructivizations, Index sets of constructive models of bounded signature that are autostable relative to strong constructivizations, Non-self-equivalent constructivization of atomic Boolean algebras
Cites Work