Computable Algebra, General Theory and Theory of Computable Fields
From MaRDI portal
Publication:5537373
DOI10.2307/1993295zbMath0156.01201OpenAlexW4242679002MaRDI 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 (only showing first 100 items - show all)
\(\Pi_{1}^{0}\) classes and orderable groups ⋮ The computational complexity of module socles ⋮ The computable dimension of ordered abelian groups ⋮ New degree spectra of Polish spaces ⋮ Primitive recursive ordered fields and some applications ⋮ A recursive second order initial algebra specification of primitive recursion ⋮ Turing meets Schanuel ⋮ The data type variety of stack algebras ⋮ Recursion theory and ordered groups ⋮ Abelian \(p\)-groups and the halting problem ⋮ Effectively categorical abelian groups ⋮ Algebraic specifications of computable and semicomputable data types ⋮ Formal spaces and their effective presentations ⋮ Modular algebraic specification of some basic geometrical constructions ⋮ Computable valued fields ⋮ Rational separability over a global field ⋮ Recursively enumerable sets of polynomials over a finite field ⋮ On recursively enumerable structures ⋮ On a conjecture of Bergstra and Tucker ⋮ Randnomness, computability, and algebraic specifications ⋮ Univariate polynomial factorization over finite fields ⋮ Honest universality ⋮ Degrees of orders on torsion-free abelian groups ⋮ Punctual copies of algebraic structures ⋮ Graphs are not universal for online computability ⋮ Infinite dimensional proper subspaces of computable vector spaces ⋮ Computing constraint sets for differential fields ⋮ Computable torsion abelian groups ⋮ Computable fields and the bounded Turing reduction ⋮ Enumerating abelian \(p\)-groups ⋮ Limit groups over coherent right-angled Artin groups ⋮ Describing groups ⋮ Straight-line program length as a parameter for complexity analysis ⋮ Computability theory. Abstracts from the workshop held April 25 -- May 1, 2021 (hybrid meeting) ⋮ Classifications of computable structures ⋮ Nearly perfect systems and effective generalizations of Shidlovski's theorem ⋮ Irreducibles and Primes in Computable Integral Domains ⋮ On Constructive Nilpotent Groups ⋮ Online presentations of finitely generated structures ⋮ Two decidable Markov properties over a class of solvable groups ⋮ Computable Scott sentences for quasi-Hopfian finitely presented structures ⋮ Some natural structures which fail to possess a sound and decidable Hoare-like logic for their while-programs ⋮ Sofic profile and computability of Cremona groups ⋮ Computability-theoretic and proof-theoretic aspects of partial and linear orderings ⋮ Computable algebra and group embeddings ⋮ The complexity of computable categoricity ⋮ On the generalized Ritt problem as a computational problem ⋮ On von Neumann regular rings with an automorphism ⋮ Ideals in computable rings ⋮ On decision procedures for sentential logics ⋮ Independence in computable algebra ⋮ The complexity of module radicals ⋮ Recursively enumerable sets of polynomials over a finite field are Diophantine ⋮ Proper divisibility in computable rings ⋮ Scott sentences for certain groups ⋮ The complexity of primes in computable unique factorization domains ⋮ Polynomial computability of fields of algebraic numbers ⋮ Final algebras, cosemicomputable algebras and degrees of unsolvability ⋮ Algebraic structures computable without delay ⋮ On the decidability of the theory of modules over the ring of algebraic integers ⋮ The conjugacy problem in the Grigorchuk group is polynomial time decidable. ⋮ 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\)] ⋮ Is it harder to factor a polynomial or to find a root? ⋮ Effective dimension ⋮ The \(\delta_\alpha^0\)-computable enumerations of the classes of projective planes ⋮ On effective Birkhoff's ergodic theorem for computable actions of amenable groups ⋮ On centre-by-free solvable groups ⋮ Sets of degrees of computable fields ⋮ The back-and-forth method and computability without delay ⋮ Groups with decidable word problem that do not embed in groups with decidable conjugacy problem ⋮ Computable structures and operations on the space of continuous functions ⋮ Non-density in punctual computability ⋮ Infinite linear sequential machines ⋮ Adapting Rabin’s Theorem for Differential Fields ⋮ Computable Kripke models and intermediate logics ⋮ Categorical linearly ordered structures ⋮ Galois stratification over Frobenius fields ⋮ Every finite sequential machine is linearly realizable ⋮ Bézout domains and lattice-valued modules ⋮ The influence of domain interpretations on computational models ⋮ Fields of algebraic numbers computable in polynomial time. I ⋮ Decidable Kripke models of intuitionistic theories ⋮ Computable isomorphisms, degree spectra of relations, and Scott families ⋮ Weak presentations of non-finitely generated fields ⋮ Bounds for the solutions of norm form, discriminant form and index form equations in finitely generated integral domains ⋮ The given ⋮ Decomposability and computability ⋮ Computable topological abelian groups ⋮ Expressiveness and the completeness of Hoare's logic ⋮ The axiomatic semantics of programs based on Hoare's logic ⋮ Recursive properties of Euclidean domains ⋮ Countable algebra and set existence axioms ⋮ Sometimes effective Thue-Siegel-Roth-Schmidt-Nevanlinna bounds, or better ⋮ Hyperarithmetical relations in expansions of recursive structures ⋮ Specification of real-time and hybrid systems in rewriting logic ⋮ Compression techniques in group theory ⋮ Computable procedures for fields ⋮ Pseudo-natural algorithms for the word problem for finitely presented monoids and groups
This page was built for publication: Computable Algebra, General Theory and Theory of Computable Fields
