Computability of String Functions Over Algebraic Structures Armin Hemmerling

This publication has 39 references indexed in Scilit:

• The Gödel Incompleteness Theorem and Decidability over a Ring
  Published by World Scientific Pub Co Pte Ltd ,2000
• Separation of complexity classes in Koiran's weak model
  Theoretical Computer Science, 1994
• Ordered subrings of the reals in which output sets are recursively enumerable
  Proceedings of the American Mathematical Society, 1993
• Ordered rings over which output sets are recursively enumerable sets
  Proceedings of the American Mathematical Society, 1991
• Definability via enumerations
  The Journal of Symbolic Logic, 1989
• Definability by programs in first-order structures
  Theoretical Computer Science, 1983
• Abstract Computability and Invariant Definability
  The Journal of Symbolic Logic, 1970
• Algorithmic properties of structures
  Theory of Computing Systems, 1967
• Rekursive Wortfunktionen
  Mathematical Logic Quarterly, 1960
• Über formal unentscheidbare Sätze der Principia Mathematica und verwandter Systeme I
  Monatshefte für Mathematik, 1931