Turing degrees of complete formulas of almost prime models

DOI10.1007/s10469-019-09546-yzbMath1485.03112OpenAlexW2984617016MaRDI QIDQ2300743

Valentina S. Harizanov, Sergei S. Goncharov, Russell G. Miller

Publication date: 28 February 2020

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

Full work available at URL: https://doi.org/10.1007/s10469-019-09546-y

Mathematics Subject Classification ID

Computable structure theory, computable model theory (03C57) Theory of numerations, effectively presented structures (03D45) Other Turing degree structures (03D28)

Related Items (2)

A note on decidable categoricity and index sets ⋮ On decidable categoricity and almost prime models

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Degrees that are not degrees of categoricity
• Computable single-valued numerations
• Problem of the number of non-self-equivalent constructivizations
• Strong and weak constructivization and computable families
• Decidable models
• Model theory
• Nilpotent groups of finite algorithmic dimension
• 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
• Revisiting Uniform Computable Categoricity: For the Sixtieth Birthday of Prof. Rod Downey
• On autostability of almost prime models relative to strong constructivizations
• Prime Model with No Degree of Autostability Relative to Strong Constructivizations
• d-computable categoricity for algebraic fields
• Oб алгебрах формул счётно категоричных теорий
• A decidable $ℵ_0$-categorical theory with a non-recursive Ryll-Nardzewski function
• Categoricity spectra for rigid structures

This page was built for publication: Turing degrees of complete formulas of almost prime models