Pages that link to "Item:Q1123889"
From MaRDI portal
The following pages link to Generic copies of countable structures (Q1123889):
Displayed 50 items.
- Computable dimension for ordered fields (Q283123) (← links)
- Independence in computable algebra (Q497725) (← links)
- Computable ideals in \(I\)-algebras (Q619312) (← links)
- Preserving categoricity and complexity of relations (Q887644) (← links)
- Effective categoricity of abelian \(p\)-groups (Q1023056) (← links)
- Generalizations of enumeration reducibility using recursive infinitary propositional sentences (Q1207542) (← links)
- Computable isomorphisms, degree spectra of relations, and Scott families (Q1295389) (← links)
- Ramified systems (Q1344627) (← links)
- Degrees of autostability for prime Boolean algebras (Q1620777) (← links)
- Computability-theoretic categoricity and Scott families (Q1740457) (← links)
- \(\Delta_{2}^{0}\)-categoricity in Boolean algebras and linear orderings (Q1861536) (← links)
- Degrees of autostability relative to strong constructivizations for Boolean algebras (Q2364293) (← links)
- Degrees of autostability for linear orders and linearly ordered abelian groups (Q2364330) (← links)
- Intrinsically recursively enumerable subalgebras of a recursive Boolean algebra (Q2366358) (← links)
- Generalized hyperarithmetical computability over structures (Q2401541) (← links)
- On functors enumerating structures (Q2403649) (← links)
- Effective categoricity for distributive lattices and Heyting algebras (Q2404797) (← links)
- Effective categoricity of equivalence structures (Q2498900) (← links)
- A computably stable structure with no Scott family of finitary formulas (Q2501165) (← links)
- Degrees of autostability relative to strong constructivizations (Q2510761) (← links)
- Enumerations in computable structure theory (Q2570135) (← links)
- 2000 European Summer Meeting of the Association for Symbolic Logic. Logic Colloquium 2000 (Q2732529) (← links)
- 2011 North American Annual Meeting of the Association for Symbolic Logic (Q2893284) (← links)
- Rice sequences of relations (Q2941599) (← links)
- Effectively Existentially-Atomic Structures (Q2970960) (← links)
- Revisiting Uniform Computable Categoricity: For the Sixtieth Birthday of Prof. Rod Downey (Q2970964) (← links)
- Enumeration Reducibility and Computable Structure Theory (Q2970965) (← links)
- COMPARING TWO VERSIONS OF THE REALS (Q2976382) (← links)
- A Note on Effective Categoricity for Linear Orderings (Q2988812) (← links)
- Conservative Extensions of Abstract Structures (Q3091469) (← links)
- COMPUTABLE STRUCTURES OF RANK $\omega_{1}^{{\rm CK}}$ (Q3094353) (← links)
- Computable categoricity of trees of finite height (Q3370760) (← links)
- ON EXTENSIONS OF EMBEDDINGS INTO THE ENUMERATION DEGREES OF THE ${\Sigma_2^0}$-SETS (Q3379460) (← links)
- Intrinsic bounds on complexity and definability at limit levels (Q3399191) (← links)
- A robuster Scott rank (Q3450085) (← links)
- Jumps of Orderings (Q3484823) (← links)
- Notes on the Jump of a Structure (Q3576069) (← links)
- <i>d</i>-computable categoricity for algebraic fields (Q3655259) (← links)
- 1997–98 Annual Meeting of the Association for Symbolic Logic (Q4254569) (← links)
- 1998–1999 Winter Meeting of the Association for Symbolic Logic (Q4262607) (← links)
- There is no classification of the decidably presentable structures (Q4562439) (← links)
- Torsion-free abelian groups with optimal Scott families (Q4565755) (← links)
- Degree Spectra of Relations on a Cone (Q4645836) (← links)
- Sequences of <i>n</i>-diagrams (Q4779662) (← links)
- Jump inversions of algebraic structures and Σ‐definability (Q5108844) (← links)
- Computable categoricity for algebraic fields with splitting algorithms (Q5246987) (← links)
- Categoricity properties for computable algebraic fields (Q5246988) (← links)
- A fixed point for the jump operator on structures (Q5300071) (← links)
- Π<sub>1</sub><sup>1</sup> relations and paths through (Q5311742) (← links)
- Another Jump Inversion Theorem for Structures (Q5326388) (← links)