Generic copies of countable structures
From MaRDI portal
Publication:1123889
DOI10.1016/0168-0072(89)90015-8zbMath0678.03012MaRDI QIDQ1123889
Chris Ash, M. S. Manasse, Julia F. Knight, Theodore A. Slaman
Publication date: 1989
Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0168-0072(89)90015-8
03C25: Model-theoretic forcing
03C15: Model theory of denumerable and separable structures
03C35: Categoricity and completeness of theories
Related Items
1998–1999 Winter Meeting of the Association for Symbolic Logic, There is no classification of the decidably presentable structures, Torsion-free abelian groups with optimal Scott families, Degree Spectra of Relations on a Cone, Sequences of n-diagrams, Unnamed Item, Unnamed Item, Degrees of bi-embeddable categoricity, Relativizing computable categoricity, AN INTRODUCTION TO THE SCOTT COMPLEXITY OF COUNTABLE STRUCTURES AND A SURVEY OF RECENT RESULTS, Jump inversions of algebraic structures and Σ‐definability, Computable categoricity for algebraic fields with splitting algorithms, Categoricity properties for computable algebraic fields, A fixed point for the jump operator on structures, Π11 relations and paths through, Another Jump Inversion Theorem for Structures, 2006 Summer Meeting of the Association for Symbolic Logic: Logic Colloquium '06, COMPUTABLE FUNCTORS AND EFFECTIVE INTERPRETABILITY, DEGREES OF CATEGORICITY ON A CONE VIAη-SYSTEMS, Ash's theorem on \(\Delta_{\alpha}^{0}\)-categorical structures and a condition for infinite \(\Delta_{\alpha}^{0}\)-dimension, Categoricity and complexity of relations over algebraic structures, On the complexity of the theory of a computably presented metric structure, Complexity profiles and generic Muchnik reducibility, Computable dimension for ordered fields, Independence in computable algebra, Computable ideals in \(I\)-algebras, Preserving categoricity and complexity of relations, Effective categoricity of abelian \(p\)-groups, Generalizations of enumeration reducibility using recursive infinitary propositional sentences, Computable isomorphisms, degree spectra of relations, and Scott families, Ramified systems, Degrees of autostability for prime Boolean algebras, Computability-theoretic categoricity and Scott families, \(\Delta_{2}^{0}\)-categoricity in Boolean algebras and linear orderings, Categoricity spectra of computable structures, Degree spectra of structures, Model completeness and relative decidability, On bi-embeddable categoricity of algebraic structures, Complexity and categoricity of injection structures induced by finite state transducers, Relatively intrinsically computable relations on Boolean algebras with a distinguished set of atoms, Effective categoricity of automatic equivalence and nested equivalence structures, Strong degrees of categoricity and weak density, Degrees of autostability relative to strong constructivizations for Boolean algebras, Degrees of autostability for linear orders and linearly ordered abelian groups, Intrinsically recursively enumerable subalgebras of a recursive Boolean algebra, Generalized hyperarithmetical computability over structures, On functors enumerating structures, Effective categoricity for distributive lattices and Heyting algebras, Effective categoricity of equivalence structures, A computably stable structure with no Scott family of finitary formulas, Degrees of autostability relative to strong constructivizations, Enumerations in computable structure theory, Degrees of relative computable categoricity, Generalization of Shapiro's theorem to higher arities and noninjective notations, 2000 European Summer Meeting of the Association for Symbolic Logic. Logic Colloquium 2000, 2011 North American Annual Meeting of the Association for Symbolic Logic, Rice sequences of relations, Effectively Existentially-Atomic Structures, Revisiting Uniform Computable Categoricity: For the Sixtieth Birthday of Prof. Rod Downey, Enumeration Reducibility and Computable Structure Theory, COMPARING TWO VERSIONS OF THE REALS, A Note on Effective Categoricity for Linear Orderings, Conservative Extensions of Abstract Structures, COMPUTABLE STRUCTURES OF RANK $\omega_{1}^{{\rm CK}}$, Computable categoricity of trees of finite height, ON EXTENSIONS OF EMBEDDINGS INTO THE ENUMERATION DEGREES OF THE ${\Sigma_2^0}$-SETS, Intrinsic bounds on complexity and definability at limit levels, A robuster Scott rank, Notes on the Jump of a Structure, Jumps of Orderings, d-computable categoricity for algebraic fields, 1997–98 Annual Meeting of the Association for Symbolic Logic
Cites Work
