Effective procedures in field theory
From MaRDI portal
Publication:3231245
DOI10.1098/RSTA.1956.0003zbMath0070.03502OpenAlexW2063706894MaRDI QIDQ3231245
John C. Shepherdson, Albrecht Froehlich
Publication date: 1956
Published in: Philosophical Transactions of the Royal Society of London. Series A, Mathematical and Physical Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1098/rsta.1956.0003
Related Items (only showing first 100 items - show all)
The computational complexity of module socles ⋮ New degree spectra of Polish spaces ⋮ Factorization of polynomials and \(\Sigma ^ 0_ 1\) induction ⋮ Definable Subsets of Polynomial-Time Algebraic Structures ⋮ Primitive recursive ordered fields and some applications ⋮ The computability, definability, and proof theory of Artinian rings ⋮ Necessary conditions for Liouvillian solutions of (third order) linear differential equations ⋮ Polynomials for the Jordan decomposition in characteristic \(p\) ⋮ Turing meets Schanuel ⋮ Recursion theory and ordered groups ⋮ Abelian \(p\)-groups and the halting problem ⋮ Effectively categorical abelian groups ⋮ Solvable Lie algebras of dimension \(\leq 4\) over perfect fields ⋮ Finding the radical of an algebra of linear transformations ⋮ Formal spaces and their effective presentations ⋮ Computable completely decomposable groups ⋮ NOTES ON THE DPRM PROPERTY FOR LISTABLE STRUCTURES ⋮ Square-free algorithms in positive characteristic ⋮ Prime Model with No Degree of Autostability Relative to Strong Constructivizations ⋮ Integral elements with given discriminant over function fields ⋮ On the complexity of radicals in noncommutative rings ⋮ Torsion-free abelian groups with optimal Scott families ⋮ Degrees of categoricity of computable structures ⋮ Spectrum of the field of computable real numbers ⋮ DIOPHANTINE SETS OF POLYNOMIALS OVER ALGEBRAIC EXTENSIONS OF THE RATIONALS ⋮ Recursively enumerable sets of polynomials over a finite field ⋮ Iterated effective embeddings of abelian p-groups ⋮ Univariate polynomial factorization over finite fields ⋮ Computable categoricity of the Boolean algebra \(\mathfrak{B}(\omega )\) with a distinguished automorphism ⋮ Lifting proofs from countable to uncountable mathematics ⋮ Infinite dimensional proper subspaces of computable vector spaces ⋮ Computing constraint sets for differential fields ⋮ Computable fields and the bounded Turing reduction ⋮ Directed evaluation ⋮ Fast separable factorization and applications ⋮ Minimal Weak Truth Table Degrees and Computably Enumerable Turing Degrees ⋮ Index sets for \(n\)-decidable structures categorical relative to \(m\)-decidable presentations ⋮ Autostability of prime models under strong constructivizations ⋮ Recursion theory on fields and abstract dependence ⋮ Irreducibles and Primes in Computable Integral Domains ⋮ Strength and Weakness in Computable Structure Theory ⋮ On Constructive Nilpotent Groups ⋮ Finding bases of uncountable free abelian groups is usually difficult ⋮ Strong degrees of categoricity and weak density ⋮ Relaxed algorithms for \(p\)-adic numbers ⋮ Polynomial root finding over local rings and application to error correcting codes ⋮ Analytic computable structure theory and $L^p$ spaces ⋮ Computability-theoretic and proof-theoretic aspects of partial and linear orderings ⋮ A Note on Effective Categoricity for Linear Orderings ⋮ The complexity of computable categoricity ⋮ Ideals in computable rings ⋮ Grete Hermann and effective methods in geometry ⋮ Generalizing Computability Theory to Abstract Algebras ⋮ DEGREES OF CATEGORICITY AND SPECTRAL DIMENSION ⋮ Independence in computable algebra ⋮ Computability-theoretic categoricity and Scott families ⋮ The complexity of module radicals ⋮ Recursively enumerable sets of polynomials over a finite field are Diophantine ⋮ Proper divisibility in computable rings ⋮ Categoricity spectra for polymodal algebras ⋮ The complexity of primes in computable unique factorization domains ⋮ Friedberg splittings of recursively enumerable sets ⋮ Testing isomorphism of modules. ⋮ On the complexity of the Lickteig-Roy subresultant algorithm ⋮ Spectra of Algebraic Fields and Subfields ⋮ Diophantine sets of polynomials over number fields ⋮ Degrees of categoricity of rigid structures ⋮ Recursive elements and constructive extensions of computable local integral domains ⋮ Effective André-Oort conjecture for non-compact curves in Hilbert modular varieties ⋮ Is it harder to factor a polynomial or to find a root? ⋮ Effective dimension ⋮ COMPUTABLE ABELIAN GROUPS ⋮ Chain conditions in computable rings ⋮ Degrees of autostability relative to strong constructivizations ⋮ Categoricity spectra of computable structures ⋮ Computable presentability of countable linear orders ⋮ A Natural Axiomatization of Computability and Proof of Church's Thesis ⋮ Konstruktionsverfahren bei Moduln über Polynomringen ⋮ Functional decomposition of polynomials: the tame case ⋮ Adapting Rabin’s Theorem for Differential Fields ⋮ Functional decomposition of polynomials: the wild case ⋮ Computable Kripke models and intermediate logics ⋮ Galois stratification over Frobenius fields ⋮ Degrees of bi-embeddable categoricity of equivalence structures ⋮ Generic computation of the real closure of an ordered field. ⋮ Deterministic irreducibility testing of polynomials over large finite fields ⋮ d-computable categoricity for algebraic fields ⋮ Decidability and \(k\)-regular sequences ⋮ Degrees of bi-embeddable categoricity ⋮ Decidable Kripke models of intuitionistic theories ⋮ Computable isomorphisms, degree spectra of relations, and Scott families ⋮ Invariance of Hironaka's characteristic polyhedron ⋮ The given ⋮ Computability and the algebra of fields: Some affine constructions ⋮ Accelerated tower arithmetic ⋮ Computable topological abelian groups ⋮ Recursive properties of Euclidean domains ⋮ Countable algebra and set existence axioms ⋮ Hyperarithmetical relations in expansions of recursive structures ⋮ Computable procedures for fields
This page was built for publication: Effective procedures in field theory
