Strongly constructive models and numerations of the Boolean algebra of recursive sets

DOI10.1007/BF02219840zbMath0311.02051MaRDI QIDQ1219275

Mikhaĭl G. Peretyat'kin

Publication date: 1973

Published in: Algebra and Logic (Search for Journal in Brave)

Mathematics Subject Classification ID

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, Non-self-equivalent constructivization of atomic Boolean algebras

Cites Work

• Unnamed Item
• Unnamed Item