Prime model with no degree of autostability relative to strong constructivizations

DOI10.1007/978-3-319-20028-6_12MaRDI QIDQ3195686zbMATH OpenOpenAlexFDO

Authors 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

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

Recommendations

• Autostability of prime models under strong constructivizations
• On autostability of almost prime models relative to strong constructivizations
• Degrees of autostability relative to strong constructivizations
• Constructivizability of a prime model
• scientific article; zbMATH DE number 4077177

Cites work

• scientific article; zbMATH DE number 1002913 (Why is no real title available?)
• scientific article; zbMATH DE number 1390012 (Why is no real title available?)
• scientific article; zbMATH DE number 1450824 (Why is no real title available?)
• scientific article; zbMATH DE number 3250559 (Why is no real title available?)
• scientific article; zbMATH DE number 3316934 (Why is no real title available?)
• Autostability spectra for Boolean algebras
• CONSTRUCTIVE ALGEBRAS I
• Categoricity spectra for rigid structures
• Computable structures and the hyperarithmetical hierarchy
• Degrees of autostability relative to strong constructivizations
• Degrees of categoricity and the hyperarithmetic hierarchy
• Degrees of categoricity for superatomic Boolean algebras
• Degrees of categoricity of computable structures
• Degrees that are not degrees of categoricity
• Effective algebraicity
• Effective procedures in field theory
• Model theory
• Turing's legacy. Developments from Turing's ideas in logic
• \(d\)-computable categoricity for algebraic fields
• ∏ 0 1 Classes and Degrees of Theories

Cited in

(9)

• An autostable 1-decidable model without a computable Scott family of \(\exists\)-formulas
• Degrees of autostability for prime Boolean algebras
• Categoricity spectra of computable structures
• Effective categoricity for distributive lattices and Heyting algebras
• Autostability of prime models under strong constructivizations
• Constructivizability of a prime model
• On decidable categoricity and almost prime models
• Degrees of autostability relative to strong constructivizations
• Turing degrees of complete formulas of almost prime models

This page was built for publication: Prime model with no degree of autostability relative to strong constructivizations

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