Pages that link to "Item:Q3231245"
From MaRDI portal
The following pages link to Effective procedures in field theory (Q3231245):
Displaying 50 items.
- Abelian \(p\)-groups and the halting problem (Q306578) (← links)
- Computable categoricity of the Boolean algebra \(\mathfrak{B}(\omega )\) with a distinguished automorphism (Q384395) (← 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)
- Autostability of prime models under strong constructivizations (Q431714) (← links)
- Relaxed algorithms for \(p\)-adic numbers (Q449711) (← links)
- The complexity of computable categoricity (Q471691) (← links)
- Independence in computable algebra (Q497725) (← links)
- Proper divisibility in computable rings (Q504325) (← links)
- Categoricity spectra for polymodal algebras (Q514501) (← links)
- Friedberg splittings of recursively enumerable sets (Q685058) (← links)
- Functional decomposition of polynomials: the tame case (Q753496) (← links)
- Functional decomposition of polynomials: the wild case (Q755793) (← links)
- Galois stratification over Frobenius fields (Q759801) (← links)
- The given (Q791521) (← 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)
- Index sets for \(n\)-decidable structures categorical relative to \(m\)-decidable presentations (Q904324) (← links)
- Testing isomorphism of modules. (Q959773) (← links)
- Recursive properties of Euclidean domains (Q1062977) (← links)
- Countable algebra and set existence axioms (Q1063593) (← links)
- Factorization of polynomials and \(\Sigma ^ 0_ 1\) induction (Q1082338) (← links)
- Recursion theory and ordered groups (Q1093630) (← links)
- Integral elements with given discriminant over function fields (Q1112876) (← links)
- Univariate polynomial factorization over finite fields (Q1127311) (← links)
- Recursion theory on fields and abstract dependence (Q1156793) (← links)
- Effective dimension (Q1232405) (← 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)
- Hyperarithmetical relations in expansions of recursive structures (Q1315834) (← links)
- Necessary conditions for Liouvillian solutions of (third order) linear differential equations (Q1340506) (← links)
- Finding the radical of an algebra of linear transformations (Q1358905) (← links)
- Computability-theoretic and proof-theoretic aspects of partial and linear orderings (Q1425651) (← links)
- Generic computation of the real closure of an ordered field. (Q1565819) (← links)
- The computability, definability, and proof theory of Artinian rings (Q1628418) (← links)
- Computability-theoretic categoricity and Scott families (Q1740457) (← links)
- The complexity of primes in computable unique factorization domains (Q1750293) (← links)
- On the complexity of the Lickteig-Roy subresultant algorithm (Q1757020) (← links)
- Deterministic irreducibility testing of polynomials over large finite fields (Q1825030) (← links)
- Polynomials for the Jordan decomposition in characteristic \(p\) (Q1887492) (← links)
- Formal spaces and their effective presentations (Q1902337) (← links)
- Square-free algorithms in positive characteristic (Q1908897) (← links)
- The complexity of module radicals (Q1982020) (← links)
- Degrees of categoricity of rigid structures (Q2011647) (← links)
- Effective André-Oort conjecture for non-compact curves in Hilbert modular varieties (Q2019420) (← links)
- Categoricity spectra of computable structures (Q2036466) (← links)
- Computable presentability of countable linear orders (Q2036473) (← links)
