On decidable categoricity and almost prime models

DOI10.3103/S1055134420030050zbMath1446.03069OpenAlexW3062138362MaRDI QIDQ2203434

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

Publication date: 6 October 2020

Published in: Siberian Advances in Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3103/s1055134420030050

zbMATH Keywords

decidable theorycomputable modelprime modelTuring degreedecidable modelcomplete formuladegree of decidable categoricityalmost prime modeluniform decidable categoricity

Mathematics Subject Classification ID

Computable structure theory, computable model theory (03C57) Theory of numerations, effectively presented structures (03D45) Categoricity and completeness of theories (03C35)

Related Items (max. 100)

The degree of decidable categoricity of a model with infinite solutions for complete formulas

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Index sets of constructive models of finite and graph signatures that are autostable relative to strong constructivizations
• Degrees that are not degrees of categoricity
• Autostability of prime models under strong constructivizations
• Index sets of constructive models of nontrivial signature autostable relative to strong constructivizations
• The index set of Boolean algebras autostable relative to strong constructivizations
• Index sets of constructive models of bounded signature that are autostable relative to strong constructivizations
• Index sets for \(n\)-decidable structures categorical relative to \(m\)-decidable presentations
• Index sets of autostable relative to strong constructivizations constructive models for familiar classes
• Problem of the number of non-self-equivalent constructivizations
• Strong and weak constructivization and computable families
• Effective choice for relations and reducibilities in classes of constructive and positive models
• Finite computable dimension and degrees of categoricity
• Degrees of autostability relative to strong constructivizations of graphs
• Computability-theoretic categoricity and Scott families
• Nilpotent groups of finite algorithmic dimension
• Degrees of categoricity and the hyperarithmetic hierarchy
• Turing degrees of complete formulas of almost prime models
• Computability-theoretic properties of injection structures
• Autostability spectra for Boolean algebras
• The index set of the groups autostable relative to strong constructivizations
• Degrees of autostability relative to strong constructivizations for Boolean algebras
• Degrees of autostability for linear orders and linearly ordered abelian groups
• Index set of structures with two equivalence relations that are autostable relative to strong constructivizations
• Degrees of categoricity for superatomic Boolean algebras
• Degrees of autostability relative to strong constructivizations
• Degrees of categoricity of computable structures
• 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
• DEGREES OF CATEGORICITY AND SPECTRAL DIMENSION
• Model Theory
• Decompositions of decidable abelian groups
• DEGREES OF CATEGORICITY ON A CONE VIAη-SYSTEMS
• Index Sets of Constructive Models that are Autostable Under Strong Constructivizations
• Categoricity spectra for rigid structures
• Effective categoricity of computable linear orderings

This page was built for publication: On decidable categoricity and almost prime models