The following pages link to (Q3919698):
Displaying 35 items.
- Algorithmic properties of branching models (Q580329) (← links)
- Recursive properties of relations on models (Q687281) (← links)
- The given (Q791521) (← links)
- Recursive linear orders with recursive successivities (Q1062051) (← links)
- Recursive categoricity and recursive stability (Q1084103) (← links)
- Recursion theory and ordered groups (Q1093630) (← links)
- Stability of recursive structures in arithmetical degrees (Q1094410) (← links)
- Intrinsically \(\Sigma ^ 0_{\alpha}\) relations (Q1106203) (← links)
- Generic copies of countable structures (Q1123889) (← links)
- Some effects of Ash-Nerode and other decidability conditions on degree spectra (Q1182431) (← links)
- Uncountable degree spectra (Q1182483) (← links)
- Every recursive Boolean algebra is isomorphic to one with incomplete atoms (Q1210349) (← links)
- Turing degrees of certain isomorphic images of computable relations (Q1295383) (← links)
- Computable isomorphisms, degree spectra of relations, and Scott families (Q1295389) (← links)
- Coding a family of sets (Q1295408) (← links)
- Hyperarithmetical relations in expansions of recursive structures (Q1315834) (← links)
- Inseparability in recursive copies (Q1326768) (← links)
- Computable classes of constructivizations for models of finite constructivizability type (Q1335930) (← links)
- Effectively infinite classes of weak constructivizations of models (Q1346921) (← links)
- Quasi-simple relations in copies of a given recursive structure (Q1365244) (← links)
- Permitting, forcing, and copying of a given recursive relation (Q1365246) (← links)
- Possible degrees in recursive copies. II (Q1368584) (← links)
- Turing degrees of hypersimple relations on computable structures (Q1399102) (← links)
- Realizing levels of the hyperarithmetic hierarchy as degree spectra of relations on computable structures (Q1430995) (← links)
- Degree spectra and computable dimensions in algebraic structures (Q1612482) (← links)
- Degree spectra of relations on structures of finite computable dimension (Q1612487) (← links)
- Possible degrees in recursive copies (Q1902615) (← links)
- On decidability of amenability in computable groups (Q2085571) (← links)
- Enumerations in computable structure theory (Q2570135) (← links)
- Generalization of Shapiro's theorem to higher arities and noninjective notations (Q2700823) (← links)
- On the triple jump of the set of atoms of a Boolean algebra (Q3508087) (← links)
- When Is Reachability Intrinsically Decidable? (Q3533013) (← links)
- Recursively Categorical Linear Orderings (Q3955343) (← links)
- Degree Spectra of Relations on a Cone (Q4645836) (← links)
- Categoricity and complexity of relations over algebraic structures (Q5965135) (← links)
