The following pages link to (Q4935938):
Displayed 50 items.
- Index sets of constructive models of finite and graph signatures that are autostable relative to strong constructivizations (Q282114) (← links)
- Orbits of maximal vector spaces (Q282117) (← links)
- Definability of linear orders over negative equivalences (Q321260) (← links)
- Computable categoricity of the Boolean algebra \(\mathfrak{B}(\omega )\) with a distinguished automorphism (Q384395) (← links)
- Autostability of prime models under strong constructivizations (Q431714) (← links)
- Computable dimensions of Pappusian and Desarguesian projective planes (Q694236) (← links)
- Fields of algebraic numbers computable in polynomial time. I (Q784464) (← links)
- Primitive recursive ordered fields and some applications (Q831997) (← links)
- The branching theorem and computable categoricity in the Ershov hierarchy (Q887636) (← links)
- Index sets of constructive models of bounded signature that are autostable relative to strong constructivizations (Q887638) (← links)
- How to find (compute) a separant (Q887645) (← links)
- Computable numberings of the class of Boolean algebras with distinguished endomorphisms (Q893075) (← links)
- Index sets for \(n\)-decidable structures categorical relative to \(m\)-decidable presentations (Q904324) (← links)
- Strongly constructive models and numerations of the Boolean algebra of recursive sets (Q1219275) (← links)
- Degrees of autostability for prime Boolean algebras (Q1620777) (← links)
- Nonpresentability of some structures of analysis in hereditarily finite superstructures (Q1644856) (← links)
- The diversity of categoricity without delay (Q1688181) (← links)
- A computable structure with nonstandard computability (Q1703284) (← links)
- On constructive number fields and computability of solutions of PDEs (Q1707150) (← links)
- Countably categorical theories (Q1928482) (← links)
- Constructivizability of the Boolean algebra \( \mathfrak{B}( \omega ) \) with a distinguished automorphism (Q1936277) (← links)
- Polynomial computability of fields of algebraic numbers (Q1994088) (← links)
- Degree spectra of structures (Q2036471) (← links)
- \(T_1\)-separable numberings of subdirectly indecomposable algebras (Q2066092) (← links)
- Structures of degrees of negative representations of linear orders (Q2066437) (← links)
- Enumerating classes of effective quasi-Polish spaces (Q2104255) (← links)
- Computational complexity of classical solutions of partial differential equations (Q2104279) (← links)
- Searching for applicable versions of computable structures (Q2117745) (← links)
- Fields of algebraic numbers computable in polynomial time. II (Q2145863) (← links)
- Virtual algebraic isomorphisms between predicate calculi of finite rich signatures (Q2145868) (← links)
- Computably separable models (Q2168971) (← links)
- Topological spaces over algorithmic representations of universal algebras (Q2199377) (← links)
- Turing degrees and automorphism groups of substructure lattices (Q2213916) (← links)
- Turing degrees of complete formulas of almost prime models (Q2300743) (← links)
- \(\Sigma\)-preorderings in \(\mathbb{HF}(\mathbb{R} )\) (Q2300935) (← links)
- Abelian \(p\)-groups and autostability relative to an oracle (Q2342098) (← links)
- Computability-theoretic properties of injection structures (Q2342300) (← links)
- Autostability spectra for Boolean algebras (Q2356086) (← 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)
- \(\prod_1^1\)-completeness of the computable categoricity problem for projective planes (Q2364332) (← links)
- Index set of structures with two equivalence relations that are autostable relative to strong constructivizations (Q2364335) (← links)
- Effectively categorical abelian groups (Q2377433) (← links)
- Spectrum of the field of computable real numbers (Q2401539) (← links)
- Degrees of categoricity for superatomic Boolean algebras (Q2434601) (← links)
- Enumerating functions for nonnegative integer coordinates of \(L\)-dimensional vectors (Q2451489) (← links)
- Descriptive complexity of \(\mathsf{qc} \mathsf{b}_0\)-spaces (Q2682909) (← links)
- Computability and universal determinability of negatively representable models (Q2688330) (← links)
- Complexity of Ehrenfeucht models (Q3546055) (← links)
- 0″-Categorical Completely Decomposable Torsion-Free Abelian Groups (Q3576068) (← links)