Pages that link to "Item:Q3231245"
From MaRDI portal
The following pages link to Effective procedures in field theory (Q3231245):
Displaying 50 items.
- Decidability and \(k\)-regular sequences (Q2077376) (← links)
- Computable topological abelian groups (Q2099260) (← links)
- Computable procedures for fields (Q2117796) (← links)
- The computational complexity of module socles (Q2120972) (← links)
- Directed evaluation (Q2192677) (← links)
- Strong degrees of categoricity and weak density (Q2211365) (← links)
- Grete Hermann and effective methods in geometry (Q2230636) (← links)
- Degrees of bi-embeddable categoricity of equivalence structures (Q2312081) (← links)
- Invariance of Hironaka's characteristic polyhedron (Q2331758) (← links)
- Accelerated tower arithmetic (Q2338646) (← links)
- Effectively categorical abelian groups (Q2377433) (← links)
- Spectrum of the field of computable real numbers (Q2401539) (← links)
- Fast separable factorization and applications (Q2426955) (← links)
- Polynomial root finding over local rings and application to error correcting codes (Q2441447) (← links)
- Ideals in computable rings (Q2456205) (← links)
- Recursively enumerable sets of polynomials over a finite field are Diophantine (Q2464706) (← links)
- Degrees of autostability relative to strong constructivizations (Q2510761) (← links)
- Konstruktionsverfahren bei Moduln über Polynomringen (Q2528689) (← links)
- Turing meets Schanuel (Q2630828) (← links)
- Solvable Lie algebras of dimension \(\leq 4\) over perfect fields (Q2639152) (← links)
- On the complexity of radicals in noncommutative rings (Q2655033) (← links)
- Degrees of categoricity of computable structures (Q2655143) (← links)
- Lifting proofs from countable to uncountable mathematics (Q2672667) (← links)
- Computable abelian groups (Q2795203) (← links)
- DIOPHANTINE SETS OF POLYNOMIALS OVER ALGEBRAIC EXTENSIONS OF THE RATIONALS (Q2933672) (← links)
- Iterated effective embeddings of abelian p-groups (Q2941047) (← links)
- Irreducibles and Primes in Computable Integral Domains (Q2970963) (← links)
- Strength and Weakness in Computable Structure Theory (Q2970966) (← links)
- On Constructive Nilpotent Groups (Q2970967) (← links)
- A Note on Effective Categoricity for Linear Orderings (Q2988812) (← links)
- Is it harder to factor a polynomial or to find a root? (Q3053472) (← links)
- Chain conditions in computable rings (Q3065750) (← links)
- Adapting Rabin’s Theorem for Differential Fields (Q3091458) (← links)
- Computable completely decomposable groups (Q3190417) (← links)
- Prime Model with No Degree of Autostability Relative to Strong Constructivizations (Q3195686) (← links)
- Spectra of Algebraic Fields and Subfields (Q3576055) (← links)
- Diophantine sets of polynomials over number fields (Q3581096) (← links)
- A Natural Axiomatization of Computability and Proof of Church's Thesis (Q3616433) (← links)
- <i>d</i>-computable categoricity for algebraic fields (Q3655259) (← links)
- Computability and the algebra of fields: Some affine constructions (Q3937376) (← links)
- Recursive elements and constructive extensions of computable local integral domains (Q4401430) (← links)
- Torsion-free abelian groups with optimal Scott families (Q4565755) (← links)
- Finding bases of uncountable free abelian groups is usually difficult (Q4608785) (← links)
- Analytic computable structure theory and $L^p$ spaces (Q4615025) (← links)
- Generalizing Computability Theory to Abstract Algebras (Q4637219) (← links)
- DEGREES OF CATEGORICITY AND SPECTRAL DIMENSION (Q4638977) (← links)
- Degrees of bi-embeddable categoricity (Q4995600) (← links)
- Definable Subsets of Polynomial-Time Algebraic Structures (Q5042236) (← links)
- NOTES ON THE DPRM PROPERTY FOR LISTABLE STRUCTURES (Q5070471) (← links)
- Minimal Weak Truth Table Degrees and Computably Enumerable Turing Degrees (Q5113922) (← links)
