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

DOI10.1007/S10469-021-09642-YOpenAlexW4225674163WikidataQ113904589 ScholiaQ113904589MaRDI QIDQ2055308

Sergei S. Goncharov, Margaret I. Marchuk

Publication date: 1 December 2021

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

Full work available at URL: https://doi.org/10.1007/s10469-021-09642-y

zbMATH Keywords

computable modelcomputable categoricitydecidable modelautostability relative to strong constructivizationsPA-degreedecidable categoricity spectrumdegree of decidable categoricity

Mathematics Subject Classification ID

Mathematical logic and foundations (03-XX) Group theory and generalizations (20-XX)

Cites Work

• Unnamed Item
• Autostability of prime models under strong constructivizations
• The index set of Boolean algebras autostable relative to strong constructivizations
• Strong and weak constructivization and computable families
• Model theory
• Degrees of autostability relative to strong constructivizations of graphs
• Degrees of categoricity and the hyperarithmetic hierarchy
• On decidable categoricity and almost prime models
• Autostability spectra for Boolean algebras
• Degrees of autostability relative to strong constructivizations for Boolean algebras
• Degrees of categoricity vs. strong degrees of categoricity
• Degrees of autostability relative to strong constructivizations
• Degrees of categoricity of computable structures
• On autostability of almost prime models relative to strong constructivizations
• There is no classification of the decidably presentable structures
• Computable categoricity for algebraic fields with splitting algorithms
• ∏ 0 1 Classes and Degrees of Theories
• Categoricity spectra for rigid structures

This page was built for publication: The degree of decidable categoricity of a model with infinite solutions for complete formulas