A structure is automatic if its domain, functions, and relations are all regular languages.
Using the fact that every automatic structure is decidable, in the literature many decision …

We study autostability spectra relative to strong constructivizations (SC-autostability spectra).
For a decidable structure is the least degree in the spectrum (if such a degree exists). We …

A computable structure 𝒜 is decidable if, given a formula φ (x ̄) of elementary first-order
logic, and a tuple ā∈ 𝒜, we have a decision procedure to decide whether φ holds of ā. We …

The complexity of isomorphisms for computable and decidable structures plays an important
role in computable model theory. Goncharov 26 defined the degree of decidable categoricity …

The connection between computability and definability is one of the main themes in
computable model theory. A decidable theory has a decidable model, that is, a model with a …

We study decidable categoricity spectra for almost prime models. For any computable
collection {Di} i∈ ω, where Di either is a ce set or Di= PA, we construct a sequence of almost …

Isomorphism is one of the most important equivalence relations between two structures of
the same kind. We present some recent results on the maximal complexity of the …

We consider the complexity (in terms of the arithmetical hierarchy) of the various quantifier
levels of the diagram of a computably presented metric structure. As the truth value of a …

Boolean Algebras Autostable Relative to n-Decidable Presentations | Algebra and Logic Skip to
main content SpringerLink Account Menu Find a journal Publish with us Track your research …

We study the degrees of decidable categoricity for almost prime models and their
relationship with the degrees of the sets of complete formulas. We show that a result of …