Degrees of autostability relative to strong constructivizations of graphs

DOI10.1134/S0037446618040018zbMath1469.03102OpenAlexW2891570516WikidataQ129301111 ScholiaQ129301111MaRDI QIDQ1617974

Margaret I. Marchuk, Nikolay Bazhenov

Publication date: 13 November 2018

Published in: Siberian Mathematical Journal (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1134/s0037446618040018

zbMATH Keywords

graphcomputably enumerable degreeautostabilitycomputable modelautostability relative to strong constructivizationsstrongly constructivizable modelautostability spectrum relative to strong constructivizationsdegree of autostability relative to strong constructivizationsPA-degree

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Other degrees and reducibilities in computability and recursion theory (03D30) Computable structure theory, computable model theory (03C57) Theory of numerations, effectively presented structures (03D45)

Related Items

On categoricity spectra for locally finite graphs ⋮ On decidable categoricity and almost prime models ⋮ The degree of decidable categoricity of a model with infinite solutions for complete formulas

Cites Work

• Unnamed Item
• Index sets of constructive models of finite and graph signatures that are autostable relative to strong constructivizations
• Strong and weak constructivization and computable families
• Model theory
• Degrees of categoricity and the hyperarithmetic hierarchy
• 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
• A Note on Effective Categoricity for Linear Orderings
• Computable categoricity for algebraic fields with splitting algorithms
• ∏ 0 1 Classes and Degrees of Theories
• Categoricity spectra for rigid structures