On categoricity spectra for locally finite graphs

DOI10.1134/S0037446621050037OpenAlexW3204193042MaRDI QIDQ820480

Margaret I. Marchuk, Nikolay Bazhenov

Publication date: 27 September 2021

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

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

zbMATH Keywords

categoricity spectrumdegree of categoricityautostabilitycomputable modelcomputable categoricitylocally finite graph

Mathematics Subject Classification ID

Mathematical logic and foundations (03-XX) Computability and recursion theory (03Dxx) Model theory (03Cxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Classical recursion theory. The theory of functions and sets of natural numbers.
• Computable structures and the hyperarithmetical hierarchy
• Degrees of autostability relative to strong constructivizations of graphs
• Computable bi-embeddable categoricity
• Effective algebraicity
• Degrees of categoricity and the hyperarithmetic hierarchy
• Categoricity spectra of computable structures
• Index set of structures with two equivalence relations that are autostable relative to strong constructivizations
• Degrees of autostability relative to strong constructivizations
• Degrees of categoricity of computable structures
• Computable Categoricity of Graphs with Finite Components
• d-computable categoricity for algebraic fields
• Recursive Labelling Systems and Stability of Recursive Structures in Hyperarithmetical Degrees
• DEGREES OF CATEGORICITY AND SPECTRAL DIMENSION
• Degrees of bi-embeddable categoricity
• Degrees of categoricity above limit ordinals
• ∏ 0 1 Classes and Degrees of Theories

This page was built for publication: On categoricity spectra for locally finite graphs