The following pages link to (Q4249356):
Displaying 39 items.
- Degrees that are not degrees of categoricity (Q306834) (← links)
- Metric structures and probabilistic computation (Q541224) (← links)
- Model-theoretic complexity of automatic structures (Q636281) (← links)
- Effectiveness in RPL, with applications to continuous logic (Q636319) (← links)
- Spaces of orders and their Turing degree spectra (Q636350) (← links)
- Partial automorphism semigroups (Q998310) (← links)
- Computable isomorphisms, degree spectra of relations, and Scott families (Q1295389) (← links)
- Degree spectra of relations on structures of finite computable dimension (Q1612487) (← links)
- Finite computable dimension and degrees of categoricity (Q1616772) (← links)
- Computable valued fields (Q1661672) (← links)
- Effective completeness theorems for modal logic (Q1877094) (← links)
- Effective algebraicity (Q1935364) (← links)
- Degrees of categoricity and the hyperarithmetic hierarchy (Q1949167) (← links)
- From automatic structures to automatic groups. (Q2016098) (← links)
- Categoricity spectra of computable structures (Q2036466) (← links)
- Model completeness and relative decidability (Q2042736) (← links)
- A note on decidable categoricity and index sets (Q2200982) (← links)
- Empiricism, probability, and knowledge of arithmetic: a preliminary defense (Q2250551) (← links)
- \(\mathsf{WKL}_0\) and induction principles in model theory (Q2344719) (← links)
- Enumerations in computable structure theory (Q2570135) (← links)
- Degrees of categoricity of computable structures (Q2655143) (← links)
- Strength and Weakness in Computable Structure Theory (Q2970966) (← links)
- The Slaman-Wehner theorem in higher recursion theory (Q3003597) (← links)
- Adapting Rabin’s Theorem for Differential Fields (Q3091458) (← links)
- A Note on the Computable Categoricity of $$\ell ^p$$ ℓ p Spaces (Q3195705) (← links)
- Computable trees, prime models, and relative decidability (Q3372136) (← links)
- Degree spectra and immunity properties (Q3406451) (← links)
- Model Theoretic Complexity of Automatic Structures (Extended Abstract) (Q3502675) (← links)
- The atomic model theorem and type omitting (Q3642694) (← links)
- Orders on magmas and computability theory (Q4579847) (← links)
- Effective prime uniqueness (Q4592760) (← links)
- Analytic computable structure theory and $L^p$ spaces (Q4615025) (← links)
- A computably categorical structure whose expansion by a constant has infinite computable dimension (Q4650279) (← links)
- FOUNDATIONS OF ONLINE STRUCTURE THEORY (Q5226592) (← links)
- Categoricity properties for computable algebraic fields (Q5246988) (← links)
- Turing degrees of nonabelian groups (Q5295123) (← links)
- Induction, Bounding, Weak Combinatorial Principles, and the Homogeneous Model Theorem (Q5366979) (← links)
- Computable Heyting algebras with distinguished atoms and coatoms (Q6117138) (← links)
- Punctually presented structures I: Closure theorems (Q6146821) (← links)
