The following pages link to CONSTRUCTIVE ALGEBRAS I (Q5338325):
Displaying 50 items.
- Homomorphisms onto effectively separable algebras (Q299155) (← links)
- Abelian \(p\)-groups and the halting problem (Q306578) (← links)
- Definability of linear orders over negative equivalences (Q321260) (← links)
- The complexity of computable categoricity (Q471691) (← links)
- Independence in computable algebra (Q497725) (← 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)
- The conjugacy problem in the Grigorchuk group is polynomial time decidable. (Q531917) (← links)
- Expressiveness and the completeness of Hoare's logic (Q800082) (← links)
- The axiomatic semantics of programs based on Hoare's logic (Q800712) (← links)
- New degree spectra of Polish spaces (Q820494) (← links)
- The influence of domain interpretations on computational models (Q1036525) (← links)
- Algebraic specifications of computable and semicomputable data types (Q1098613) (← links)
- On a conjecture of Bergstra and Tucker (Q1124321) (← links)
- Some natural structures which fail to possess a sound and decidable Hoare-like logic for their while-programs (Q1163369) (← links)
- Anatoly Ivanovich Maltsev (Q1190773) (← links)
- Final algebras, cosemicomputable algebras and degrees of unsolvability (Q1199822) (← links)
- Computable isomorphisms, degree spectra of relations, and Scott families (Q1295389) (← links)
- A recursive second order initial algebra specification of primitive recursion (Q1338890) (← links)
- Computable torsion abelian groups (Q1688648) (← links)
- Negative dense linear orders (Q1745085) (← links)
- Degrees of categoricity of rigid structures (Q2011647) (← links)
- Punctual categoricity relative to a computable oracle (Q2030137) (← links)
- Groups with decidable word problem that do not embed in groups with decidable conjugacy problem (Q2030402) (← links)
- Categoricity spectra of computable structures (Q2036466) (← links)
- Precomplete numberings (Q2036469) (← links)
- Computable presentability of countable linear orders (Q2036473) (← links)
- Non-density in punctual computability (Q2041959) (← links)
- One-element Rogers semilattices in the Ershov hierarchy (Q2066095) (← links)
- Structures of degrees of negative representations of linear orders (Q2066437) (← links)
- Finitely generated structures computable in polynomial time (Q2088618) (← links)
- Computable topological abelian groups (Q2099260) (← links)
- Fields of algebraic numbers computable in polynomial time. II (Q2145863) (← links)
- Computably separable models (Q2168971) (← links)
- Punctual copies of algebraic structures (Q2186304) (← links)
- Graphs are not universal for online computability (Q2186809) (← links)
- Enumerating abelian \(p\)-groups (Q2193224) (← links)
- Topological spaces over algorithmic representations of universal algebras (Q2199377) (← links)
- Strong degrees of categoricity and weak density (Q2211365) (← links)
- The back-and-forth method and computability without delay (Q2279959) (← links)
- A.D. Taimanov and model theory in Kazakhstan (Q2306026) (← links)
- Categorical linearly ordered structures (Q2311213) (← links)
- Effectively categorical abelian groups (Q2377433) (← links)
- Ideals in computable rings (Q2456205) (← links)
- Uniformly computably separable algebras with effectively splittable families of negative congruences (Q2671977) (← links)
- Degrees of relative computable categoricity (Q2680583) (← links)
- Computability and universal determinability of negatively representable models (Q2688330) (← links)
- A Note on Effective Categoricity for Linear Orderings (Q2988812) (← links)
