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

DOI10.1007/BF02219840zbMath0311.02051OpenAlexW2052359815MaRDI QIDQ1219275

Mikhaĭl G. Peretyat'kin

Publication date: 1973

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

Full work available at URL: https://doi.org/10.1007/bf02219840

Mathematics Subject Classification ID

Model theory (03C99) Recursively (computably) enumerable sets and degrees (03D25) Logical aspects of Boolean algebras (03G05) Computability and recursion theory (03D99) Computability and recursion theory on ordinals, admissible sets, etc. (03D60)

Related Items (4)

THE LINDENBAUM ALGEBRA OF THE THEORY OF THE CLASS OF ALL FINITE MODELS ⋮ Index sets of constructive models of bounded signature that are autostable relative to strong constructivizations ⋮ Index Sets of Constructive Models that are Autostable Under Strong Constructivizations ⋮ Non-self-equivalent constructivization of atomic Boolean algebras

Cites Work

• Unnamed Item
• Unnamed Item

This page was built for publication: Strongly constructive models and numerations of the Boolean algebra of recursive sets