Computable Algebra, General Theory and Theory of Computable Fields
From MaRDI portal
Publication:5537373
DOI10.2307/1993295zbMath0156.01201MaRDI QIDQ5537373
Publication date: 1960
Published in: Transactions of the American Mathematical Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/1993295
Related Items
New Decidable Fields of Algebraic Numbers, On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines, Turing degrees of nonabelian groups, Unnamed Item, The Church-Turing Thesis over Arbitrary Domains, A notion of effectiveness in arbitrary structures, Algorithmic properties of structures, Groups and Semigroups with Solvable Word Problems, 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\), On centre-by-free solvable groups, Galois stratification over Frobenius fields, Bounds for the solutions of norm form, discriminant form and index form equations in finitely generated integral domains, The given, Expressiveness and the completeness of Hoare's logic, The axiomatic semantics of programs based on Hoare's logic, Recursively enumerable sets of polynomials over a finite field, Recursive properties of Euclidean domains, Countable algebra and set existence axioms, Sometimes effective Thue-Siegel-Roth-Schmidt-Nevanlinna bounds, or better, Pseudo-natural algorithms for the word problem for finitely presented monoids and groups, Recursion theory and ordered groups, Algebraic specifications of computable and semicomputable data types, Modular algebraic specification of some basic geometrical constructions, On a conjecture of Bergstra and Tucker, Univariate polynomial factorization over finite fields, Straight-line program length as a parameter for complexity analysis, Nearly perfect systems and effective generalizations of Shidlovski's theorem, Two decidable Markov properties over a class of solvable groups, Some natural structures which fail to possess a sound and decidable Hoare-like logic for their while-programs, Computable algebra and group embeddings, On decision procedures for sentential logics, Final algebras, cosemicomputable algebras and degrees of unsolvability, Coherence of polynomial rings and bounds in polynomial ideals, Infinitely generated subgroups of finitely presented groups. I, On the computation of the Galois group over the quotient field of \(\mathbb{C}[\lambda\)], Effective dimension, Sets of degrees of computable fields, Computable Kripke models and intermediate logics, Decidable Kripke models of intuitionistic theories, Computable isomorphisms, degree spectra of relations, and Scott families, Weak presentations of non-finitely generated fields, Hyperarithmetical relations in expansions of recursive structures, A recursive second order initial algebra specification of primitive recursion, Randnomness, computability, and algebraic specifications, Computability-theoretic and proof-theoretic aspects of partial and linear orderings, Specification of real-time and hybrid systems in rewriting logic, \(\Pi_{1}^{0}\) classes and orderable groups, The computable dimension of ordered abelian groups, The data type variety of stack algebras, Formal spaces and their effective presentations, Rational separability over a global field, On recursively enumerable structures, On von Neumann regular rings with an automorphism, Ideals in computable rings, Recursively enumerable sets of polynomials over a finite field are Diophantine, Infinite linear sequential machines, Every finite sequential machine is linearly realizable, Ordered Rings Over Which Output Sets are Recursively Enumerable Sets, A Diophantine Problem for Laurent Polynomial Rings, A hierarchy of regular open sets of the Cantor space, A new approach to abstract data types, I Informal development
