Generic copies of countable structures
From MaRDI portal
Publication:1123889
DOI10.1016/0168-0072(89)90015-8zbMATH Open0678.03012OpenAlexW1976089169MaRDI QIDQ1123889FDOQ1123889
Authors: Chris Ash, J. F. Knight, M. S. Manasse, 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
Recommendations
Categoricity and completeness of theories (03C35) Model theory of denumerable and separable structures (03C15) Model-theoretic forcing (03C25)
Cites Work
Cited In (77)
- Sequences of n-diagrams
- 1997–98 Annual Meeting of the Association for Symbolic Logic
- 1998–1999 Winter Meeting of the Association for Symbolic Logic
- 2006 Summer Meeting of the Association for Symbolic Logic: Logic Colloquium '06
- Ash's theorem on \(\Delta_{\alpha}^{0}\)-categorical structures and a condition for infinite \(\Delta_{\alpha}^{0}\)-dimension
- Conservative extensions of abstract structures
- On the complexity of the theory of a computably presented metric structure
- Complexity profiles and generic Muchnik reducibility
- Degrees of selector functions and relative computable categoricity
- Least enumerations of unary partial structures
- An introduction to the Scott complexity of countable structures and a survey of recent results
- Categoricity and complexity of relations over algebraic structures
- Enumerations in computable structure theory
- Generalizations of enumeration reducibility using recursive infinitary propositional sentences
- A fixed point for the jump operator on structures
- 2000 European Summer Meeting of the Association for Symbolic Logic. Logic Colloquium 2000. La Sorbonne, Paris, France, July 23-31, 2000
- 2011 North American Annual Meeting of the Association for Symbolic Logic, University of California at Berkeley, Berkeley, CA, USA, March 24--27, 2011
- Computable structures in generic extensions
- Comparing two versions of the reals
- Relativizing computable categoricity
- Computability-theoretic categoricity and Scott families
- Complexity and categoricity of injection structures induced by finite state transducers
- Effective categoricity of automatic equivalence and nested equivalence structures
- Computable dimension for ordered fields
- Degrees of autostability for prime Boolean algebras
- Degrees of categoricity on a cone via \(\eta\)-systems
- Degrees of autostability relative to strong constructivizations for Boolean algebras
- A note on effective categoricity for linear orderings
- Degrees of autostability for linear orders and linearly ordered abelian groups
- Categoricity spectra of computable structures
- Effective categoricity for distributive lattices and Heyting algebras
- Rice sequences of relations
- Categoricity properties for computable algebraic fields
- Π11 relations and paths through
- Generalized hyperarithmetical computability over structures
- Computable isomorphisms, degree spectra of relations, and Scott families
- Ramified systems
- Effectively existentially-atomic structures
- Computable structures of rank \(\omega _1^{\mathrm{CK}}\)
- Enumeration reducibility and computable structure theory
- Notes on the Jump of a Structure
- Degree spectra of relations on a cone
- Strong degrees of categoricity and weak density
- Preserving categoricity and complexity of relations
- Forcing a countable structure to belong to the ground model
- \(d\)-computable categoricity for algebraic fields
- Model completeness and relative decidability
- Effective categoricity of abelian \(p\)-groups
- Computable ideals in \(I\)-algebras
- Computable functors and effective interpretability
- On bi-embeddable categoricity of algebraic structures
- Inseparability in recursive copies
- Intrinsic bounds on complexity and definability at limit levels
- Intrinsically recursively enumerable subalgebras of a recursive Boolean algebra
- A computably stable structure with no Scott family of finitary formulas
- ON EXTENSIONS OF EMBEDDINGS INTO THE ENUMERATION DEGREES OF THE ${\Sigma_2^0}$-SETS
- There is no classification of the decidably presentable structures
- Relatively intrinsically computable relations on Boolean algebras with a distinguished set of atoms
- Copyable structures
- Another jump inversion theorem for structures
- \(\Delta_{2}^{0}\)-categoricity in Boolean algebras and linear orderings
- On functors enumerating structures
- Degrees of relative computable categoricity
- On the notion of jump structure
- Torsion-free abelian groups with optimal Scott families
- Degrees of autostability relative to strong constructivizations
- Degree spectra of structures
- A robuster Scott rank
- Independence in computable algebra
- Degrees of bi-embeddable categoricity
- Revisiting uniform computable categoricity: for the sixtieth birthday of prof. Rod Downey
- Computable categoricity of trees of finite height
- Effective categoricity of equivalence structures
- Generalization of Shapiro's theorem to higher arities and noninjective notations
- Jump inversions of algebraic structures and Σ‐definability
- Computable categoricity for algebraic fields with splitting algorithms
- Jumps of Orderings
This page was built for publication: Generic copies of countable structures
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1123889)
