Generic copies of countable structures
From MaRDI portal
Recommendations
Cites work
- Categoricity in hyperarithmetical degrees
- Degrees coded in jumps of orderings
- scientific article; zbMATH DE number 3732033 (Why is no real title available?)
- scientific article; zbMATH DE number 3291134 (Why is no real title available?)
- Intrinsically \(\Sigma ^ 0_{\alpha}\) relations
- Recursive Labelling Systems and Stability of Recursive Structures in Hyperarithmetical Degrees
Cited in
(83)- Effective categoricity of abelian p-groups
- Generalizations of enumeration reducibility using recursive infinitary propositional sentences
- Computable isomorphisms, degree spectra of relations, and Scott families
- Inseparability in recursive copies
- 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. La Sorbonne, Paris, France, July 23-31, 2000
- Computable dimension for ordered fields
- 2011 North American Annual Meeting of the Association for Symbolic Logic, University of California at Berkeley, Berkeley, CA, USA, March 24--27, 2011
- Rice sequences of relations
- Forcing a countable structure to belong to the ground model
- Effectively existentially-atomic structures
- Revisiting uniform computable categoricity: for the sixtieth birthday of prof. Rod Downey
- Enumeration reducibility and computable structure theory
- Computable structures in generic extensions
- 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^{\mathrm{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
- Jumps of Orderings
- Notes on the Jump of a Structure
- d-computable categoricity for algebraic fields
- 1997–98 Annual Meeting of the Association for Symbolic Logic
- 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
- Independence in computable algebra
- Least enumerations of unary partial structures
- On the notion of jump structure
- Degrees of bi-embeddable categoricity
- Relativizing computable categoricity
- An introduction to the Scott complexity of countable structures and a survey of recent results
- COPYING ONE OF A PAIR OF STRUCTURES
- 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
- Copyable 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 ideals in \(I\)-algebras
- Degrees of selector functions and relative computable categoricity
- Syntactic characterization of learnability of structures with mind changes
- Relations enumerable from positive information
- A Lopez-Escobar theorem for continuous domains
- On categoricity of scattered linear orders of constructive ranks
- The structural complexity of models of arithmetic
- Preserving categoricity and complexity of relations
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)
