The following pages link to (Q4956005):
Displaying 50 items.
- A transformation scheme for infinitary first-order combinatorics presenting computational level of expressiveness in predicate logic (Q266237) (← links)
- Decidable models of small theories (Q266246) (← links)
- Homomorphisms onto effectively separable algebras (Q299155) (← links)
- Abelian \(p\)-groups and the halting problem (Q306578) (← links)
- Computable torsion-free nilpotent groups of finite dimension. (Q404717) (← links)
- Index sets of constructive models of nontrivial signature autostable relative to strong constructivizations (Q492716) (← links)
- Independence in computable algebra (Q497725) (← links)
- The index set of Boolean algebras autostable relative to strong constructivizations (Q498225) (← links)
- Autostability relative to strong constructivizations of Boolean algebras with distinguished ideals (Q498238) (← links)
- Proper divisibility in computable rings (Q504325) (← links)
- Categoricity spectra for polymodal algebras (Q514501) (← links)
- Algebraic structures computable without delay (Q528478) (← links)
- Autostable atomic-ideal enrichments of computable Boolean algebras (Q600736) (← links)
- The \(\delta_\alpha^0\)-computable enumerations of the classes of projective planes (Q721363) (← links)
- Complexity of the isomorphism problem for computable free projective planes of finite rank (Q721371) (← links)
- The Tarski-Lindenbaum algebra of the class of all prime strongly constructivizable models of algorithmic dimension one (Q779152) (← links)
- On categoricity spectra for locally finite graphs (Q820480) (← links)
- New degree spectra of Polish spaces (Q820494) (← links)
- Logical equations in monadic logic (Q843613) (← links)
- Index sets of autostable relative to strong constructivizations constructive models for familiar classes (Q906085) (← links)
- Partial automorphism semigroups (Q998310) (← links)
- Constructive homogeneous extensions (Q1061735) (← links)
- Effective choice for relations and reducibilities in classes of constructive and positive models (Q1317601) (← links)
- On dark computably enumerable equivalence relations (Q1642296) (← links)
- Computable torsion abelian groups (Q1688648) (← links)
- Negative dense linear orders (Q1745085) (← links)
- The computable dimension of ordered abelian groups (Q1873769) (← links)
- Primitively recursively categorical linear orderings (Q2002476) (← links)
- Separable enumerations of division rings and effective embeddability of rings therein (Q2002482) (← links)
- A note on computable distinguishing colorings (Q2030129) (← links)
- Categoricity spectra of computable structures (Q2036466) (← links)
- Computable presentability of countable linear orders (Q2036473) (← links)
- Non-density in punctual computability (Q2041959) (← links)
- Computable topological abelian groups (Q2099260) (← links)
- Well-orders realized by C.E. equivalence relations (Q2104248) (← links)
- Computable analysis and classification problems (Q2106595) (← links)
- Punctual copies of algebraic structures (Q2186304) (← links)
- Graphs are not universal for online computability (Q2186809) (← links)
- Positive numberings in admissible sets (Q2191379) (← links)
- Enumerating abelian \(p\)-groups (Q2193224) (← links)
- A note on decidable categoricity and index sets (Q2200982) (← links)
- On decidable categoricity and almost prime models (Q2203434) (← links)
- Online presentations of finitely generated structures (Q2205949) (← links)
- The property of being a model complete theory is preserved by Cartesian extensions (Q2212696) (← links)
- HKSS-completeness of modal algebras (Q2234421) (← links)
- The back-and-forth method and computability without delay (Q2279959) (← links)
- Categorical linearly ordered structures (Q2311213) (← links)
- On \(\Delta_2^0\)-categoricity of equivalence relations (Q2346952) (← links)
- The index set of the groups autostable relative to strong constructivizations (Q2360262) (← links)
- Effective categoricity for distributive lattices and Heyting algebras (Q2404797) (← links)
