Autostability of models and Abelian groups

DOI10.1007/BF01669101zbMath0468.03022OpenAlexW2318964791MaRDI QIDQ1156126

Sergei S. Goncharov

Publication date: 1980

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

Full work available at URL: https://doi.org/10.1007/bf01669101

zbMATH Keywords

recursive model theoryAbelian p- groupseffectively infinite classes of constructivizationsmodels with one-place predicates

Mathematics Subject Classification ID

Applications of logic to group theory (20A15) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10) Theory of numerations, effectively presented structures (03D45) Abelian groups (20K99) Model theory of denumerable and separable structures (03C15)

Related Items (36)

Recursive unary algebras and trees ⋮ Computable dimension for ordered fields ⋮ A robuster Scott rank ⋮ Abelian \(p\)-groups and the halting problem ⋮ Effectively categorical abelian groups ⋮ Effectively infinite classes of weak constructivizations of models ⋮ Nonuniform autostability of models ⋮ The branching theorem and computable categoricity in the Ershov hierarchy ⋮ Preserving categoricity and complexity of relations ⋮ Computable numberings of the class of Boolean algebras with distinguished endomorphisms ⋮ Computable torsion abelian groups ⋮ Inductive inference and computable numberings ⋮ Analytic computable structure theory and $L^p$ spaces ⋮ The complexity of computable categoricity ⋮ Independence in computable algebra ⋮ Computability-theoretic categoricity and Scott families ⋮ A learning-theoretic characterization of classes of recursive functions ⋮ Degree spectra of intrinsically c.e. relations ⋮ 0″-Categorical Completely Decomposable Torsion-Free Abelian Groups ⋮ Effective categoricity of equivalence structures ⋮ Punctual dimension of algebraic structures in certain classes ⋮ Computable topological groups and Pontryagin duality ⋮ Categoricity spectra of computable structures ⋮ Ash's theorem on \(\Delta_{\alpha}^{0}\)-categorical structures and a condition for infinite \(\Delta_{\alpha}^{0}\)-dimension ⋮ Computable structures and operations on the space of continuous functions ⋮ Decompositions of decidable abelian groups ⋮ Effective categoricity of abelian \(p\)-groups ⋮ Algorithmic degree of unars ⋮ Computable isomorphisms, degree spectra of relations, and Scott families ⋮ Relativizing computable categoricity ⋮ Constructivizations of direct products of algebraic systems ⋮ Complexity of the index set of a constructive model ⋮ Recursive linear orders with recursive successivities ⋮ \(\Delta_{2}^{0}\)-categoricity in Boolean algebras and linear orderings ⋮ Algorithmic dimensions of homomorphic images of models ⋮ Criteria of autostability for 1-decidable models

Cites Work

• Autostability of models
• Constructivizability of superatomic Boolean algebras
• Unnamed Item
• Unnamed Item

This page was built for publication: Autostability of models and Abelian groups