Computable Rings and Fields

[1]  William W. Boone.  Word Problems and Recursively Enumerable Degrees of Unsolvability , 1971 .

[2]  W. Magnus,et al.  Combinatorial Group Theory: COMBINATORIAL GROUP THEORY , 1967 .

[3]  J. V. Tucker,et al.  A characterization of computable data types by means of a finite, equational specification mehod , 1980 .

[4]  Rodney G. Downey,et al.  Decidable subspaces and recursively enumerable subspaces , 1984, Journal of Symbolic Logic.

[5]  William W. Boone.  Word Problems and Recursively Enumerable Degrees of Unsolvability. A Sequel on Finitely Presented Groups , 1966 .

[6]  F. B. Cannonito,et al.  The Computability of Group Constructions, Part I , 1973 .

[7]  Abbas Edalat.  Domain Theory and Integration , 1995, Theor. Comput. Sci..

[8]  Carol Tretkoff.  Complexity, Combinatorial Group Theory and the Language of Palutators , 1988, Theor. Comput. Sci..

[9]  A. Nerode,et al.  Recursion Theory on Fields and Abstract Dependence , 1980 .

[10]  A. H. Lachlan,et al.  Computable fields and arithmetically definable ordered fields , 1970 .

[11]  Jules Molk,et al.  Sur une notion qui comprend celle de la divisibilité et sur la théorie générale de l'élimination , 1885 .

[12]  Klaus Weihrauch,et al.  Type 2 Recursion Theory , 1985, Theor. Comput. Sci..

[13]  Douglas A. Cenzer,et al.  Polynomial-Time versus Recursive Models , 1991, Ann. Pure Appl. Log..

[14]  David Pokrass Jacobs,et al.  Complexity and Unsolvability Properties of Nilpotency , 1990, SIAM J. Comput..

[15]  L. Kronecker.  Grundzüge einer arithmetischen Theorie der algebraischen Grössen. (Abdruck einer Festschrift zu Herrn E. E. Kummers Doctor-Jubiläum, 10. September 1881.). , 2022 .

[16]  Jan van Leeuwen,et al.  Handbook of Theoretical Computer Science, Vol. B: Formal Models and Semantics , 1994 .

[17]  C. Chevalley.  Theory of Lie Groups , 1946 .

[18]  Allen Retzlaff,et al.  Direct Summands of Recursively Enumerable Vector Spaces , 1979, Mathematical Logic Quarterly.

[19]  Wim Ruitenburg,et al.  A Course in Constructive Algebra , 1987 .

[20]  A. Nerode,et al.  Recursion Theory on Matroids II , 1983 .

[21]  Klaus Weihrauch,et al.  Embedding Metric Spaces Into CPO's , 1981, Theor. Comput. Sci..

[22]  J. V. Tucker,et al.  COMPUTING IN ALGEBRAIC SYSTEMS , 1978 .

[23]  Iain A. Stewart.  Refining known Results on the generalized Word Problem for Free Groups , 1992, Int. J. Algebra Comput..

[24]  Benjamin Franklin Wells,et al.  The Mathematics of Algebraic Systems, Collected Papers 1936-1967 , 1975 .

[25]  I. C. C. Phillips.  Recursion theory , 1993, LICS 1993.

[26]  Stanley Burris,et al.  A course in universal algebra , 1981, Graduate texts in mathematics.

[27]  H. Friedman,et al.  Harvey Friedman's Research on the Foundations of Mathematics , 1985 .

[28]  J. V. Tucker,et al.  Complete local rings as domains , 1988, Journal of Symbolic Logic (JSL).

[29]  Ayda I. Arruda,et al.  Proceedings of the Third Brazilian Conference on Mathematical Logic , 1983 .

[30]  Herbert B. Enderton,et al.  Elements of Recursion Theory , 1977 .

[31]  J. V. Tucker,et al.  Computable Functions on Stream Algebras , 1995 .

[32]  Kenneth McAloon.  On the Complexity of Models of Arithmetic , 1982, J. Symb. Log..

[33]  Walter Baur,et al.  Rekursive Algebren mit Kettenbedingungen , 1974 .

[34]  Abbas Edalat,et al.  Domains for Computation in Mathematics, Physics and Exact Real Arithmetic , 1997, Bulletin of Symbolic Logic.

[35]  F. Richman,et al.  Varieties of Constructive Mathematics: CONSTRUCTIVE ALGEBRA , 1987 .

[36]  K. Brown,et al.  Graduate Texts in Mathematics , 1982 .

[37]  Grete Hermann,et al.  Die Frage der endlich vielen Schritte in der Theorie der Polynomideale , 1926 .

[38]  R. Dedekind.  Essays on the theory of numbers , 1963 .

[39]  G. Takeuti.  Proof Theory , 1975 .

[40]  Karl Meinke,et al.  Universal algebra , 1993, LICS 1993.

[41]  J. Ersov.  Theorie der Numerierungen II , 1973 .

[42]  J. V. Tucker,et al.  Theory of Computation and Specification over Abstract Data Types, and its Applications , 1991 .

[43]  Frank B. Cannonito,et al.  Computable algebra and group embeddings , 1981 .

[44]  Donald A. Alton,et al.  Computability of boolean algebras and their extensions , 1973 .

[45]  David R. Guichard.  Automorphisms of substructure lattices in recursive algebra , 1983, Ann. Pure Appl. Log..

[46]  Michael Francis Atiyah,et al.  Introduction to commutative algebra , 1969 .

[47]  Jan A. Bergstra,et al.  A Characterisation of Computable Data Types by Means of a Finite Equational Specification Method , 1980, ICALP.

[48]  Wolfgang Wechler,et al.  Universal Algebra for Computer Scientists , 1992, EATCS Monographs on Theoretical Computer Science.

[49]  M. Dehn,et al.  Über die Topologie des dreidimensionalen Raumes , 1910 .

[50]  Ju. L. Ers.  Theorie Der Numerierungen III , 1977, Math. Log. Q..

[51]  Robin Gandy,et al.  The confluence of ideas in 1936 , 1988 .

[52]  B. H. Neumann,et al.  The Isomorphism Problem for Algebraically Closed Groups , 1973 .

[53]  J. V. Tucker,et al.  Many-sorted logic and its applications , 1993 .

[54]  F. L. Bauer.  Logic, Algebra, and Computation , 1991, NATO ASI Series.

[55]  Yuri L. Ershov,et al.  Theory of Numberings , 1999, Handbook of Computability Theory.

[56]  Klaus Weihrauch,et al.  Computability on Computable Metric Spaces , 1993, Theor. Comput. Sci..

[57]  S. S. Goncharov.  Computable single-valued numerations , 1980 .

[58]  A. Nerode,et al.  Effective content of field theory , 1979 .

[59]  Gyula Kőnig,et al.  Einleitung in die allgemeine Theorie der algebraischen Gröszen , 1903 .

[60]  G. Sacks.  Higher recursion theory , 1990 .

[61]  Yu. G. Ventsov.  Computable classes of constructivizations for models of infinite algorithmic dimension , 1994 .

[62]  J. V. Tucker,et al.  Effective algebras , 1995, Logic in Computer Science.

[63]  Klaus Weihrauch,et al.  A unified approach to constructive and recursive analysis , 1984 .

[64]  Hans Wussing,et al.  The genesis of the abstract group concept , 1984 .

[65]  Jürgen Avenhaus,et al.  The Nielsen Reduction and P-Complete Problems in Free Groups , 1984, Theor. Comput. Sci..

[66]  J. V. Tucker,et al.  Examples of Semicomputable Sets of Real and Complex Numbers , 1992, Constructivity in Computer Science.

[67]  Frank B. Cannonito,et al.  Hierarchies of Computable groups and the word problem , 1966, Journal of Symbolic Logic.

[68]  Glen H. Suter.  Recursive elements and constructive extensions of computable local integral domains , 1973, Journal of Symbolic Logic.

[69]  Viggo Stoltenberg-Hansen,et al.  Concrete Models of Computation for Topological Algebras , 1999, Theor. Comput. Sci..

[70]  M. Beeson.  Foundations of Constructive Mathematics , 1985 .

[71]  J. V. Tucker,et al.  Program correctness over abstract data types, with error-state semantics , 1988, CWI monographs.

[72]  Charles F. Miller.  On Group-Theoretic Decision Problems and Their Classification. , 1971 .

[73]  R. W. Gatterdam.  The Higman Theorem for Primitive-Recursive Groups - A Preliminary Report , 1973 .

[74]  J. Van Leeuwen,et al.  Handbook of theoretical computer science - Part A: Algorithms and complexity; Part B: Formal models and semantics , 1990 .

[75]  Abbas Edalat,et al.  Dynamical Systems, Measures and Fractals via Domain Theory , 1993, Inf. Comput..

[76]  S. S. Goncharov,et al.  Problem of the number of non-self-equivalent constructivizations , 1980 .

[77]  H. Weber.  Die allgemeinen Grundlagen der Galois'schen Gleichungstheorie , 1893 .

[78]  A. I. Mal'tsev.  CONSTRUCTIVE ALGEBRAS I , 1961 .

[79]  Jon Barwise,et al.  Admissible sets and structures , 1975 .

[80]  Rolf Herken,et al.  Retrieved July 19 2004 Universal Turing Machine , 2011 .

[81]  J. Moldestad,et al.  Finite alogorithmic procedures and computation theories. , 1980 .

[82]  Viggo Stoltenberg-Hansen,et al.  Infinite Systems of Equations over Inverse Limits and Infinite Synchronous Concurrent Algorithms , 1992, REX Workshop.

[83]  Jan A. Bergstra,et al.  A Data Type Variety of Stack Algebras , 1995, Ann. Pure Appl. Log..

[84]  A. I. Mal'cev.  Algorithms and Recursive Functions , 1970 .

[85]  J. V. Tucker,et al.  Provable computable selection functions of abstract structures , 1993 .

[86]  Stephan Waack.  On the parallel complexity of linear groups , 1991, RAIRO Theor. Informatics Appl..

[87]  Richard J. Lipton,et al.  Word Problems Solvable in Logspace , 1977, JACM.

[88]  J. V. Tucker,et al.  Computing Roots of Unity in Fields , 1980 .

[89]  Y. Moschovakis.  Recursive metric spaces , 1964 .

[90]  Jr. Hartley Rogers.  Theory of Recursive Functions and Effective Computability , 1969 .

[91]  E. Noether,et al.  Zur Theorie der Polynomideale und Resultanten , 1922 .

[92]  Paul Young,et al.  An introduction to the general theory of algorithms , 1978 .

[93]  P. M. Cohn,et al.  THE METAMATHEMATICS OF ALGEBRAIC SYSTEMS , 1972 .

[94]  Iain A. Stewart.  Complete Problems for Symmetric Logspace Involving Free Groups , 1991, Inf. Process. Lett..

[95]  John Stillwell.  The word problem and the isomorphism problem for groups , 1982 .

[96]  Dyck.  Gruppentheoretische Studien. (Mit drei lithographirten Tafeln.). , 2022 .

[97]  Anil Nerode,et al.  Complexity-Theoretic Algebra II: Boolean Algebras , 1989, Ann. Pure Appl. Log..

[98]  José Meseguer,et al.  Initiality, induction, and computability , 1986 .

[99]  Stephan Waack.  Tape Complexity of Word Problems , 1981, FCT.

[100]  Viggo Stoltenberg-Hansen,et al.  Poincaré-Betti Series are Primitive Recursive , 1985 .

[101]  Bernard Domanski,et al.  The Complexity of Dehn's Algorithm for Word Problems in Groups , 1985, J. Algorithms.

[102]  Hans Ulrich Simon,et al.  Word problems for groups and contextfree recognition , 1979, FCT.

[103]  Viggo Stoltenberg-Hansen,et al.  Mathematical theory of domains , 1994, Cambridge tracts in theoretical computer science.

[104]  E. Artin,et al.  Algebraische Konstruktion reeller Körper , 1927 .

[105]  Martin Ziegler.  Ein Rekursiv Aufzählbarer btt-Grad, der Nicht Zum Wortproblem Einer Gruppe Gehört , 1976, Math. Log. Q..

[106]  Klaus Weihrauch,et al.  A Foundation of Computable Analysis , 1995, Bull. EATCS.

[107]  E. Steinitz.  Algebraische Theorie der Körper. , 1910 .

[108]  H. Keisler,et al.  Handbook of mathematical logic , 1977 .

[109]  R. Soare.  Recursively enumerable sets and degrees , 1987 .

[110]  S. Smale,et al.  On a theory of computation and complexity over the real numbers; np-completeness , 1989 .

[111]  J. Shepherdson,et al.  Effective procedures in field theory , 1956, Philosophical Transactions of the Royal Society of London. Series A, Mathematical and Physical Sciences.

[112]  A. Turing.  THE WORD PROBLEM IN SEMI-GROUPS WITH CANCELLATION , 1950 .

[113]  Jan A. Bergstra,et al.  Equational specifications, complete term rewriting systems, and computable and semicomputable algebras , 1995, JACM.

[114]  J. Moldestad,et al.  Finite alogorithmic procedures and inductive definability. , 1980 .

[115]  Jürgen Avenhaus,et al.  On the Complexity of Intersection and Conjugacy Problems in Free Groups , 1984, Theor. Comput. Sci..

[116]  J. Shepherdson,et al.  On the factorisation of polynomials in a finite number of steps , 1955 .

[117]  K. Hensel,et al.  Theorie der algebraischen Zahlen , 1908 .

[118]  C. R. J. Clapham.  Finitely Presented Groups with Word Problems of Arbitrary Degrees of Insolubility , 1964 .

[119]  R. McKenzie,et al.  Algebras, Lattices, Varieties , 1988 .

[120]  Joseph A. Goguen,et al.  Final Algebras, Cosemicomputable Algebras and Degrees of Unsolvability , 1992, Theor. Comput. Sci..

[121]  Sabine Koppelberg,et al.  Handbook of Boolean Algebras , 1989 .

[122]  A. Seidenberg.  Constructions in algebra , 1974 .

[123]  N. G. Khisamiev.  CONSTRUCTIVE ABELIAN P-GROUPS , 1991 .

[124]  Anil Nerode,et al.  Complexity-Theoretic Algebra: Vector Space Bases , 1990 .

[125]  J. Rotman.  An Introduction to the Theory of Groups , 1965 .

[126]  Douglas A. Cenzer,et al.  Polynomial-Time Abelian Groups , 1992, Ann. Pure Appl. Log..

[127]  Jean-Pierre Soublin,et al.  Anneaux et modules cohérents , 1970 .

[128]  John C. Reynolds,et al.  Algebraic Methods in Semantics , 1985 .

[129]  William W. Boone,et al.  An algebraic characterization of groups with soluble word problem , 1974, Journal of the Australian Mathematical Society.

[130]  Wolfgang Krull.  Über Polynomzerlegung mit endlich vielen Schritten. III , 1953 .

[131]  J. V. Tucker.  Computability and the Algebra of Fields: Some Affine Constructions , 1980, J. Symb. Log..

[132]  Eugene W. Madison,et al.  A note on computable real fields , 1970, Journal of Symbolic Logic.

[133]  William W. Boone.  The Word Problem , 1959 .

[134]  Wolfgang Krull.  Galoissche Theorie der unendlichen algebraischen Erweiterungen , 1928 .

[135]  Charlotte Lin,et al.  Recursively presented Abelian groups: Effective p-Group theory. I , 1981, Journal of Symbolic Logic.

[136]  Martin Wirsing,et al.  Algebraic Specification , 1991, Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics.

[137]  Lenore Blum,et al.  Complexity and Real Computation , 1997, Springer New York.

[138]  R. Lyndon,et al.  Combinatorial Group Theory , 1977 .

[139]  Jan A. Bergstra,et al.  The Completeness of the Algebraic Specification Methods for Computable Data Types , 1982, Inf. Control..

[140]  Grigoris Antoniou,et al.  Logic - a foundation for computer science , 1991, International Computer Science Series.

[141]  Eugene W. Madison.  Some Remarks on Computable (Non-Archimedean) Ordered Fields , 1971 .

[142]  Jan A. Bergstra,et al.  Initial and Final Algebra Semantics for Data Type Specifications: Two Characterization Theorems , 1983, SIAM J. Comput..

[143]  Wilhelm Magnus,et al.  The History of Combinatorial Group Theory: A Case Study in the History of Ideas , 1982 .

[144]  G. Higman.  Subgroups of finitely presented groups , 1961, Proceedings of the Royal Society of London. Series A. Mathematical and Physical Sciences.

[145]  Iraj Kalantari,et al.  Maximal Vector Spaces Under Automorphisms of the Lattice of Recursively Enumerable Vector Spaces , 1977, J. Symb. Log..

[146]  A. S. Troelstra,et al.  On the Early History of Intuitionistic Logic , 1990 .

[147]  F. B. Cannonito.  The Algebraic Invariance of the Word Problem in Groups , 1973 .

[148]  A. Seidenberg,et al.  What is Noetherian? , 1974 .

[149]  Anil Nerode,et al.  Complexity Theoretic Algebra I Vector Spaces over Finite Fields , 2008 .

[150]  Fred Richman,et al.  Constructive aspects of Noetherian rings , 1974 .

[151]  M. Rabin.  Computable algebra, general theory and theory of computable fields. , 1960 .

[152]  C. Ayoub.  On constructing bases for ideals in polynomial rings over the integers , 1983 .

[153]  Oliver Aberth,et al.  Computable analysis , 1980 .

[154]  Angus Macintyre,et al.  On algebraically closed groups , 1972 .

[155]  George Gratzer,et al.  Universal Algebra , 1979 .

[156]  Richard Kaye.  Models of Peano arithmetic , 1991, Oxford logic guides.

[157]  Luboš Nový,et al.  Origins of Modern Algebra , 1973 .

[158]  Richard Lawrence Smith,et al.  Two theorems on autostability in p-Groups , 1981 .

[159]  G. Lallement.  Semigroups and combinatorial applications , 1979 .

[160]  Anil Nerode,et al.  The Introduction of Non-Recursive Methods into Mathematics* , 1982 .

[161]  V. P. Dobritsa,et al.  Constructive periodic Abelian groups , 1978 .

[162]  H. S. Vandiver.  On the Ordering of Real Algebraic Numbers by Constructive Methods , 1936 .

[163]  Donald J. Collins.  Truth-Table Degrees and the Boone Groups , 1971 .

[164]  N. Cutland.  Computability: An Introduction to Recursive Function Theory , 1980 .

[165]  Richard A. Shore,et al.  Controlling the dependence degree of a recursively enumerable vector space , 1978, Journal of Symbolic Logic.

[166]  Robin Milner,et al.  Action Structures and the Pi Calculus , 1995 .

[167]  Jens Blanck,et al.  Domain Representability of Metric Spaces , 1997, Ann. Pure Appl. Log..

[168]  Jan A. Bergstra,et al.  Algebraic Specifications of Computable and Semicomputable Data Types , 1987, Theor. Comput. Sci..

[169]  R. Dedekind,et al.  Was sind und was sollen die Zahlen , 1961 .

[170]  Emil L. Post.  Recursive Unsolvability of a problem of Thue , 1947, Journal of Symbolic Logic.

[171]  J. V. Tucker,et al.  A natural data type with a finite equational final semantics specifcation, but no effective equational initial specification , 1979 .

[172]  Max Dehn,et al.  Papers on Group Theory and Topology , 1987 .

[173]  George Peacock.  A Treatise on Algebra , 1942 .

[174]  P. Odifreddi.  Classical recursion theory , 1989 .

[175]  M. Dehn.  Über unendliche diskontinuierliche Gruppen , 1911 .

[176]  A. Nerode,et al.  Recursively enumerable vector spaces , 1977 .