Pages that link to "Item:Q5537373"
From MaRDI portal
The following pages link to Computable Algebra, General Theory and Theory of Computable Fields (Q5537373):
Displaying 50 items.
- Abelian \(p\)-groups and the halting problem (Q306578) (← links)
- Degrees of orders on torsion-free abelian groups (Q385079) (← links)
- Infinite dimensional proper subspaces of computable vector spaces (Q402446) (← links)
- Computing constraint sets for differential fields (Q402682) (← links)
- Computable fields and the bounded Turing reduction (Q408170) (← links)
- The complexity of computable categoricity (Q471691) (← links)
- Independence in computable algebra (Q497725) (← links)
- Proper divisibility in computable rings (Q504325) (← links)
- Algebraic structures computable without delay (Q528478) (← links)
- On the decidability of the theory of modules over the ring of algebraic integers (Q529159) (← links)
- The conjugacy problem in the Grigorchuk group is polynomial time decidable. (Q531917) (← links)
- On centre-by-free solvable groups (Q585355) (← links)
- The \(\delta_\alpha^0\)-computable enumerations of the classes of projective planes (Q721363) (← links)
- On effective Birkhoff's ergodic theorem for computable actions of amenable groups (Q722220) (← links)
- Galois stratification over Frobenius fields (Q759801) (← links)
- Fields of algebraic numbers computable in polynomial time. I (Q784464) (← links)
- Bounds for the solutions of norm form, discriminant form and index form equations in finitely generated integral domains (Q786843) (← links)
- The given (Q791521) (← 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)
- Primitive recursive ordered fields and some applications (Q831997) (← links)
- Recursively enumerable sets of polynomials over a finite field (Q875928) (← links)
- The influence of domain interpretations on computational models (Q1036525) (← links)
- Recursive properties of Euclidean domains (Q1062977) (← links)
- Countable algebra and set existence axioms (Q1063593) (← links)
- Sometimes effective Thue-Siegel-Roth-Schmidt-Nevanlinna bounds, or better (Q1064341) (← links)
- Pseudo-natural algorithms for the word problem for finitely presented monoids and groups (Q1074716) (← links)
- Recursion theory and ordered groups (Q1093630) (← links)
- Algebraic specifications of computable and semicomputable data types (Q1098613) (← links)
- Modular algebraic specification of some basic geometrical constructions (Q1115574) (← links)
- On a conjecture of Bergstra and Tucker (Q1124321) (← links)
- Univariate polynomial factorization over finite fields (Q1127311) (← links)
- Straight-line program length as a parameter for complexity analysis (Q1151750) (← links)
- Nearly perfect systems and effective generalizations of Shidlovski's theorem (Q1156826) (← links)
- Two decidable Markov properties over a class of solvable groups (Q1159764) (← links)
- Some natural structures which fail to possess a sound and decidable Hoare-like logic for their while-programs (Q1163369) (← links)
- Computable algebra and group embeddings (Q1170619) (← links)
- On decision procedures for sentential logics (Q1181478) (← links)
- Final algebras, cosemicomputable algebras and degrees of unsolvability (Q1199822) (← links)
- Coherence of polynomial rings and bounds in polynomial ideals (Q1211545) (← links)
- Infinitely generated subgroups of finitely presented groups. I (Q1227972) (← links)
- On the computation of the Galois group over the quotient field of \(\mathbb{C}[\lambda]\) (Q1231940) (← links)
- Effective dimension (Q1232405) (← links)
- Sets of degrees of computable fields (Q1238806) (← links)
- Computable Kripke models and intermediate logics (Q1271561) (← links)
- Decidable Kripke models of intuitionistic theories (Q1295382) (← links)
- Computable isomorphisms, degree spectra of relations, and Scott families (Q1295389) (← links)
- Weak presentations of non-finitely generated fields (Q1295394) (← links)
- Hyperarithmetical relations in expansions of recursive structures (Q1315834) (← links)
