Prime Model with No Degree of Autostability Relative to Strong Constructivizations

DOI10.1007/978-3-319-20028-6_12zbMath1461.03027OpenAlexW1151973901MaRDI QIDQ3195686

Nikolay Bazhenov

Publication date: 20 October 2015

Published in: Evolving Computability (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-20028-6_12

Mathematics Subject Classification ID

Structure theory of Boolean algebras (06E05) Computable structure theory, computable model theory (03C57) Theory of numerations, effectively presented structures (03D45)

Related Items (5)

Degrees of autostability for prime Boolean algebras ⋮ Effective categoricity for distributive lattices and Heyting algebras ⋮ On decidable categoricity and almost prime models ⋮ Categoricity spectra of computable structures ⋮ Turing degrees of complete formulas of almost prime models

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Degrees that are not degrees of categoricity
• Model theory
• Computable structures and the hyperarithmetical hierarchy
• Effective algebraicity
• Degrees of categoricity and the hyperarithmetic hierarchy
• Autostability spectra for Boolean algebras
• Degrees of categoricity for superatomic Boolean algebras
• Degrees of autostability relative to strong constructivizations
• Degrees of categoricity of computable structures
• Turing's Legacy
• Effective procedures in field theory
• d-computable categoricity for algebraic fields
• CONSTRUCTIVE ALGEBRAS I
• ∏ 0 1 Classes and Degrees of Theories
• Categoricity spectra for rigid structures

This page was built for publication: Prime Model with No Degree of Autostability Relative to Strong Constructivizations