Autostability of models and Abelian groups
From MaRDI portal
Publication:1156126
DOI10.1007/BF01669101zbMath0468.03022MaRDI QIDQ1156126
Publication date: 1980
Published in: Algebra and Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01669101
recursive model theory; Abelian p- groups; effectively infinite classes of constructivizations; models with one-place predicates
20A15: Applications of logic to group theory
20F10: Word problems, other decision problems, connections with logic and automata (group-theoretic aspects)
03D45: Theory of numerations, effectively presented structures
20K99: Abelian groups
03C15: Model theory of denumerable and separable structures
Related Items
Analytic computable structure theory and $L^p$ spaces, Computable topological groups and Pontryagin duality, Relativizing computable categoricity, Decompositions of decidable abelian groups, Ash's theorem on \(\Delta_{\alpha}^{0}\)-categorical structures and a condition for infinite \(\Delta_{\alpha}^{0}\)-dimension, Computable dimension for ordered fields, Abelian \(p\)-groups and the halting problem, The complexity of computable categoricity, Independence in computable algebra, A learning-theoretic characterization of classes of recursive functions, Constructivizations of direct products of algebraic systems, Complexity of the index set of a constructive model, 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, Effective categoricity of abelian \(p\)-groups, Recursive linear orders with recursive successivities, Nonuniform autostability of models, Computable isomorphisms, degree spectra of relations, and Scott families, Algorithmic dimensions of homomorphic images of models, Criteria of autostability for 1-decidable models, Recursive unary algebras and trees, Effectively infinite classes of weak constructivizations of models, Computable torsion abelian groups, Computability-theoretic categoricity and Scott families, Algorithmic degree of unars, \(\Delta_{2}^{0}\)-categoricity in Boolean algebras and linear orderings, Punctual dimension of algebraic structures in certain classes, Categoricity spectra of computable structures, Effectively categorical abelian groups, Inductive inference and computable numberings, Effective categoricity of equivalence structures, Degree spectra of intrinsically c.e. relations, Computable structures and operations on the space of continuous functions, A robuster Scott rank, 0″-Categorical Completely Decomposable Torsion-Free Abelian Groups
Cites Work
