Autostability of models

DOI10.1007/BF01669102zbMath0468.03023OpenAlexW2317860071MaRDI QIDQ1156127

Publication date: 1980

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

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

zbMATH Keywords

linear orders recursive model theory distributive structures with relative complements nonautostability of models

Mathematics Subject Classification ID

Classification theory, stability, and related concepts in model theory (03C45) Theory of numerations, effectively presented structures (03D45) Model theory of denumerable and separable structures (03C15)

Related Items (85)

Degree spectra and computable dimensions in algebraic structures ⋮ Recursive unary algebras and trees ⋮ Examples of nonautostable systems ⋮ The computable dimension of ordered abelian groups ⋮ Degrees of autostability for prime Boolean algebras ⋮ Degrees of autostability relative to strong constructivizations for Boolean algebras ⋮ Degrees of autostability for linear orders and linearly ordered abelian groups ⋮ Computable dimension for ordered fields ⋮ Effective choice of constructivizations and recursive consistency of problems on constructive models ⋮ Computable classes of constructivizations for models of finite constructivizability type ⋮ A robuster Scott rank ⋮ Recursion theory and ordered groups ⋮ Initial segments of computable linear orders with computable natural relations ⋮ Effectively infinite classes of weak constructivizations of models ⋮ Computable classes of constructivizations for models of infinite algorithmic dimension ⋮ Structures computable in polynomial time. II ⋮ AN INTRODUCTION TO THE SCOTT COMPLEXITY OF COUNTABLE STRUCTURES AND A SURVEY OF RECENT RESULTS ⋮ Nonuniform autostability of models ⋮ Autostable atomic-ideal enrichments of computable Boolean algebras ⋮ Complexity and categoricity ⋮ Computable isomorphisms for certain classes of infinite graphs ⋮ Computable categoricity of the Boolean algebra $\mathfrak{B}(\omega )$ with a distinguished automorphism ⋮ The branching theorem and computable categoricity in the Ershov hierarchy ⋮ Preserving categoricity and complexity of relations ⋮ Graphs are not universal for online computability ⋮ Feasibly categorical models ⋮ On the effective universality of mereological theories ⋮ Computable Stone spaces ⋮ Computable Heyting algebras with distinguished atoms and coatoms ⋮ Boolean algebras autostable relative to $n$-decidable presentations ⋮ A note on decidable categoricity and index sets ⋮ Degrees of categoricity for superatomic Boolean algebras ⋮ Autostability of models and Abelian groups ⋮ Some Questions in Computable Mathematics ⋮ Analytic computable structure theory and $L^p$ spaces ⋮ A Note on Effective Categoricity for Linear Orderings ⋮ The complexity of computable categoricity ⋮ Computable bi-embeddable categoricity ⋮ Categoricity for primitive recursive and polynomial Boolean algebras ⋮ HKSS-completeness of modal algebras ⋮ A COMPUTABLE FUNCTOR FROM GRAPHS TO FIELDS ⋮ Computability-theoretic categoricity and Scott families ⋮ Autostability relative to strong constructivizations of Boolean algebras with distinguished ideals ⋮ Computability of distributive lattices ⋮ Categoricity spectra for polymodal algebras ⋮ Computable categoricity and the Ershov hierarchy ⋮ 0″-Categorical Completely Decomposable Torsion-Free Abelian Groups ⋮ Primitively recursively categorical linear orderings ⋮ Computable isomorphisms of Boolean algebras with operators ⋮ DEGREES OF CATEGORICITY ON A CONE VIAη-SYSTEMS ⋮ 2-Computably Enumerable Degrees of Categoricity for Boolean Algebras with Distinguished Automorphisms ⋮ Effective categoricity of equivalence structures ⋮ Algorithmic properties of branching models ⋮ Punctual dimension of algebraic structures in certain classes ⋮ Categoricity spectra of computable structures ⋮ Degree spectra of structures ⋮ Ash's theorem on $\Delta_{\alpha}^{0}$-categorical structures and a condition for infinite $\Delta_{\alpha}^{0}$-dimension ⋮ Effective categoricity of computable linear orderings ⋮ Degree spectra of the successor relation of computable linear orderings ⋮ Linear orders with distinguished function symbol ⋮ Primitively recursive categoricity for unars and equivalence structures ⋮ Effective categoricity of abelian $p$-groups ⋮ Computably categorical Boolean algebras enriched by ideals and atoms ⋮ Algorithmic degree of unars ⋮ Autostability of Boolean algebras with distinguished ideal ⋮ Computable isomorphisms, degree spectra of relations, and Scott families ⋮ Computable categoricity for algebraic fields with splitting algorithms ⋮ Categoricity properties for computable algebraic fields ⋮ Constructive models of regularly infinite algorithmic dimension ⋮ Constructivizations of direct products of algebraic systems ⋮ Classification from a Computable Viewpoint ⋮ Complexity of the index set of a constructive model ⋮ Abelian $p$-groups and autostability relative to an oracle ⋮ Recursive linear orders with recursive successivities ⋮ $\Delta_{2}^{0}$-categoricity in Boolean algebras and linear orderings ⋮ Degree Spectra of Relations on Computable Structures ⋮ Effective choice for relations and reducibilities in classes of constructive and positive models ⋮ Primitive Jordan algebras ⋮ Finitely generated groups with the M. Hall property ⋮ Algorithmic dimensions of homomorphic images of models ⋮ Locally finite simple groups as a product of two inert subgroups ⋮ Local characterizations of infinite alternating and Lie type groups ⋮ A semiorthogonal sum of monocomposition algebras with unity ⋮ Criteria of autostability for 1-decidable models ⋮ Superdecomposable pure injective modules over commutative valuation rings

Cites Work

This page was built for publication: Autostability of models