Pages that link to "Item:Q3955343"
From MaRDI portal
The following pages link to Recursively Categorical Linear Orderings (Q3955343):
Displaying 50 items.
- Computable dimension for ordered fields (Q283123) (← links)
- Initial segments of computable linear orders with computable natural relations (Q308863) (← links)
- The branching theorem and computable categoricity in the Ershov hierarchy (Q887636) (← links)
- Computable categoricity and the Ershov hierarchy (Q958489) (← links)
- Degree spectra of the successor relation of computable linear orderings (Q1005920) (← links)
- Special issue: Selected papers of the workshop on model theory and computable model theory, Gainesville, FL, USA, February 5--10, 2007 (Q1005921) (← links)
- Linear orders with distinguished function symbol (Q1005923) (← links)
- Effective categoricity of abelian \(p\)-groups (Q1023056) (← links)
- Recursive automorphisms of recursive linear orderings (Q1061738) (← links)
- Recursive linear orders with recursive successivities (Q1062051) (← links)
- Recursive categoricity and recursive stability (Q1084103) (← links)
- Complexity and categoricity (Q1383162) (← links)
- Degree spectra and computable dimensions in algebraic structures (Q1612482) (← links)
- Structures computable in polynomial time. II (Q1644852) (← links)
- Computable torsion abelian groups (Q1688648) (← links)
- Computable bi-embeddable categoricity (Q1731326) (← links)
- Computability-theoretic categoricity and Scott families (Q1740457) (← links)
- Computability of distributive lattices (Q1745078) (← links)
- Computable linear orders and the Ershov hierarchy (Q1746441) (← links)
- Nilpotent groups of finite algorithmic dimension (Q1825277) (← links)
- \(\Delta_{2}^{0}\)-categoricity in Boolean algebras and linear orderings (Q1861536) (← links)
- The computable dimension of ordered abelian groups (Q1873769) (← links)
- Primitively recursively categorical linear orderings (Q2002476) (← links)
- Punctual dimension of algebraic structures in certain classes (Q2030135) (← links)
- Categoricity spectra of computable structures (Q2036466) (← links)
- Degree spectra of structures (Q2036471) (← links)
- Computable linear orders and the ershov hierarchy (Q2112325) (← links)
- Algorithmic relationships of relations \(S_{\mathcal{L}}^n\) on linear orders (Q2172889) (← links)
- Graphs are not universal for online computability (Q2186809) (← links)
- Codings on linear orders and algorithmic independence of natural relations (Q2263111) (← links)
- Categorical linearly ordered structures (Q2311213) (← links)
- On \(\Delta_2^0\)-categoricity of equivalence relations (Q2346952) (← links)
- Degrees of autostability for linear orders and linearly ordered abelian groups (Q2364330) (← links)
- Effectively categorical abelian groups (Q2377433) (← links)
- Effective categoricity of equivalence structures (Q2498900) (← links)
- Computable structures and operations on the space of continuous functions (Q2804293) (← links)
- Some Questions in Computable Mathematics (Q2973717) (← links)
- A Note on Effective Categoricity for Linear Orderings (Q2988812) (← links)
- On limitwise monotonicity and maximal block functions (Q3195647) (← links)
- A robuster Scott rank (Q3450085) (← links)
- 0″-Categorical Completely Decomposable Torsion-Free Abelian Groups (Q3576068) (← links)
- Computable isomorphisms for certain classes of infinite graphs (Q4579860) (← links)
- A COMPUTABLE FUNCTOR FROM GRAPHS TO FIELDS (Q4638989) (← links)
- Relativizing computable categoricity (Q5002563) (← links)
- Computable categoricity for algebraic fields with splitting algorithms (Q5246987) (← links)
- Categoricity properties for computable algebraic fields (Q5246988) (← links)
- DEGREES OF CATEGORICITY ON A CONE VIA<i>η</i>-SYSTEMS (Q5738206) (← links)
- Effective categoricity of computable linear orderings (Q5965136) (← links)
- On the effective universality of mereological theories (Q6094132) (← links)
- Computable Heyting algebras with distinguished atoms and coatoms (Q6117138) (← links)
