Effective procedures in field theory
From MaRDI portal
Publication:3231245
DOI10.1098/rsta.1956.0003zbMath0070.03502MaRDI 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
Recursive elements and constructive extensions of computable local integral domains, Unnamed Item, The Church-Turing Thesis over Arbitrary Domains, A notion of effectiveness in arbitrary structures, Computable Algebraic Structures and Nonstandard Arithmetic, Computable Fields and Arithmetically Definable Ordered Fields, A decision method for $p$-adic integral zeros of diophantine equations, An undecidable linear order that is \(n\)-decidable for all \(n\), Friedberg splittings of recursively enumerable sets, Functional decomposition of polynomials: the tame case, Functional decomposition of polynomials: the wild case, Galois stratification over Frobenius fields, The given, Recursively enumerable sets of polynomials over a finite field, Testing isomorphism of modules., Recursive properties of Euclidean domains, Countable algebra and set existence axioms, Factorization of polynomials and \(\Sigma ^ 0_ 1\) induction, Recursion theory and ordered groups, Integral elements with given discriminant over function fields, Univariate polynomial factorization over finite fields, Recursion theory on fields and abstract dependence, Effective dimension, Computable Kripke models and intermediate logics, Decidable Kripke models of intuitionistic theories, Computable isomorphisms, degree spectra of relations, and Scott families, Hyperarithmetical relations in expansions of recursive structures, Necessary conditions for Liouvillian solutions of (third order) linear differential equations, Finding the radical of an algebra of linear transformations, Computability-theoretic and proof-theoretic aspects of partial and linear orderings, Generic computation of the real closure of an ordered field., Deterministic irreducibility testing of polynomials over large finite fields, Polynomials for the Jordan decomposition in characteristic \(p\), Formal spaces and their effective presentations, Square-free algorithms in positive characteristic, Fast separable factorization and applications, Ideals in computable rings, Recursively enumerable sets of polynomials over a finite field are Diophantine, Konstruktionsverfahren bei Moduln über Polynomringen, Solvable Lie algebras of dimension \(\leq 4\) over perfect fields, A Natural Axiomatization of Computability and Proof of Church's Thesis, d-computable categoricity for algebraic fields, Computability and the algebra of fields: Some affine constructions
