Pages that link to "Item:Q1612482"
From MaRDI portal
The following pages link to Degree spectra and computable dimensions in algebraic structures (Q1612482):
Displaying 50 items.
- Measuring complexities of classes of structures (Q499081) (← links)
- Categoricity spectra for polymodal algebras (Q514501) (← links)
- The complexity of central series in nilpotent computable groups (Q639669) (← links)
- Degrees of isomorphism types and countably categorical groups (Q661283) (← links)
- Computable isomorphisms of Boolean algebras with operators (Q694494) (← links)
- The computable embedding problem (Q695798) (← links)
- New degree spectra of Polish spaces (Q820494) (← links)
- Preserving categoricity and complexity of relations (Q887644) (← links)
- Categoricity of computable infinitary theories (Q1005932) (← links)
- Index sets for some classes of structures (Q1006610) (← links)
- Realizing levels of the hyperarithmetic hierarchy as degree spectra of relations on computable structures (Q1430995) (← links)
- Degree spectra of relations on structures of finite computable dimension (Q1612487) (← links)
- Classifications of computable structures (Q1704081) (← links)
- Computability theory. Abstracts from the workshop held January 7--13, 2018 (Q1731969) (← links)
- Degree spectra of real closed fields (Q1734266) (← links)
- Computability-theoretic categoricity and Scott families (Q1740457) (← links)
- Computability of distributive lattices (Q1745078) (← links)
- A \(\Delta^{0}_{2}\)-poset with no positive presentation (Q1936280) (← links)
- Simple structures with complex symmetry (Q1957352) (← links)
- Finitely generated groups are universal among finitely generated structures (Q2003917) (← links)
- Degree spectra of structures relative to equivalences (Q2011365) (← links)
- Turing computable embeddings, computable infinitary equivalence, and linear orders (Q2011646) (← links)
- Categoricity spectra of computable structures (Q2036466) (← links)
- Degree spectra of structures (Q2036471) (← links)
- Non-density in punctual computability (Q2041959) (← links)
- Model completeness and relative decidability (Q2042736) (← links)
- Computable embeddings for pairs of linear orders (Q2055305) (← links)
- A note on computable embeddings for ordinals and their reverses (Q2106587) (← links)
- Degrees of non-computability of homeomorphism types of Polish spaces (Q2106604) (← links)
- Limitwise monotonic spectra and their generalizations (Q2117781) (← links)
- Computable procedures for fields (Q2117796) (← links)
- Complexity of the problem of being equivalent to Horn formulas (Q2145867) (← links)
- Graphs are not universal for online computability (Q2186809) (← links)
- Spectral universality of linear orders with one binary relation (Q2191376) (← links)
- On degree spectra of topological spaces (Q2207026) (← links)
- HKSS-completeness of modal algebras (Q2234421) (← links)
- Using computability to measure complexity of algebraic structures and classes of structures (Q2263109) (← links)
- Constructing decidable graphs from decidable structures (Q2300933) (← links)
- Categorical linearly ordered structures (Q2311213) (← links)
- \(\Sigma\)-presentations of the ordering on the reals (Q2342315) (← links)
- On \(\Delta_2^0\)-categoricity of equivalence relations (Q2346952) (← links)
- Weak truth table degrees of structures (Q2354621) (← links)
- The index set of the groups autostable relative to strong constructivizations (Q2360262) (← 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)
- Freely generated projective planes with finite computable dimension (Q2401538) (← links)
- On functors enumerating structures (Q2403649) (← links)
- Effective categoricity for distributive lattices and Heyting algebras (Q2404797) (← links)
- Degrees of categoricity of computable structures (Q2655143) (← links)
- COMPUTABLE ABELIAN GROUPS (Q2795203) (← links)
