24 found
Order:
  1.  25
    Egon Börger. Berechenbarkeit, Komplexität, Logik. Eine Einführung in Algorithmen, Sprachen und Kalküle unter besonderer Berücksichtigung ihrer Komplexität. Edited by Dieter Rödding. Friedr. Vieweg & Sohn, Brunswick and Wiesbaden1985, xvii + 469 pp. - Egon Börger. Berechenbarkeit, Komplexität, Logik. Eine Einführung in Algorithmen, Sprachen und Kalküle unter besonderer Berücksichtigung ihrer Komplexität. Edited by Dieter Rodding. Second corrected edition of the preceding. Friedr. Vieweg & Sohn, Brunswick and Wiesbaden1986, xvii + 469 pp. [REVIEW]Dirk Siefkes - 1989 - Journal of Symbolic Logic 54 (4):1490-1493.
  2.  16
    J. W. Thatcher and J. B. Wright. Generalized Finite Automata Theory with an Application to a Decision Problem of Second-Order Logic. Mathematical Systems Theory, Vol. 2 , Pp. 57–81. [REVIEW]Dirk Siefkes - 1972 - Journal of Symbolic Logic 37 (3):619-620.
  3.  16
    Michael O. Rabin. Decidability of Second-Order Theories and Automata on Infinite Trees. Bulletin of the American Mathematical Society, Vol. 74 , Pp. 1025–1029. - Michael O. Rabin. Decidability of Second-Order Theories and Automata on Infinite Trees. Transactions of the American Mathematical Society, Vol. 141 , Pp. 1–35. [REVIEW]Dirk Siefkes - 1972 - Journal of Symbolic Logic 37 (3):618-619.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  4.  15
    Ferenc Gécseg and Magnus Steinby. Tree Automata. Akadémiai Kiadó, Budapest1984, Also Distributed by Heyden & Son, Philadelphia, 235 Pp. [REVIEW]Dirk Siefkes - 1987 - Journal of Symbolic Logic 52 (1):287-288.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  5.  14
    Robert McNaughton. Testing and Generating Infinite Sequences by a Finite Automaton. Information and Control, Vol. 9 , Pp. 521–530. [REVIEW]Dirk Siefkes - 1972 - Journal of Symbolic Logic 37 (3):618.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  6.  29
    Undecidable Extensions of Monadic Second Order Successor Arithmetic.Dirk Siefkes - 1971 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 17 (1):385-394.
  7.  10
    Undecidable Extensions of Monadic Second Order Successor Arithmetic.Dirk Siefkes - 1971 - Mathematical Logic Quarterly 17 (1):385-394.
  8. Review: Ferenc Gecseg, Magnus Steinby, Tree Automata. [REVIEW]Dirk Siefkes - 1987 - Journal of Symbolic Logic 52 (1):287-288.
    Translate
     
     
    Export citation  
     
    Bookmark  
  9.  15
    Review: Michael O. Rabin, Weakly Definable Relations and Special Automata. [REVIEW]Dirk Siefkes - 1975 - Journal of Symbolic Logic 40 (4):622-623.
  10.  11
    Ferrante Jeanne and Rackoff Charles W.. The Computational Complexity of Logical Theories. Lecture Notes in Mathematics, Vol. 718. Springer-Verlag, Berlin, Heidelberg, and New York, 1979, X + 243 Pp. [REVIEW]Dirk Siefkes - 1984 - Journal of Symbolic Logic 49 (2):670-671.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  11.  11
    Rabin Michael O.. Decidability and Definability in Second-Order Theories. Actes du Congrès International des Mathématiciens 1970, Gauthier-Villars, Paris 1971, Vol. 1, Pp. 239–244. [REVIEW]Dirk Siefkes - 1975 - Journal of Symbolic Logic 40 (4):623-623.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  12.  10
    Rabin Michael O.. Weakly Definable Relations and Special Automata. Mathematical Logic and Foundations of Set Theory, Proceedings of an International Colloquium Held Under the Auspices of the Israel Academy of Sciences and Humanities, Jerusalem, 11-14 November 1968, Edited by Bar-Hillel Yehoshua, Studies in Logic and the Foundations of Mathematics, North-Holland Publishing Company, Amsterdam and London 1970, Pp. 1–23. [REVIEW]Dirk Siefkes - 1975 - Journal of Symbolic Logic 40 (4):622-623.
  13.  11
    Review: Michael O. Rabin, Decidability of Second-Order Theories and Automata on Infinite Trees. [REVIEW]Dirk Siefkes - 1972 - Journal of Symbolic Logic 37 (3):618-619.
  14.  7
    Doner John. Tree Acceptors and Some of Their Applications. Journal of Computer and System Sciences, Vol. 4 , Pp. 406–451. [REVIEW]Dirk Siefkes - 1972 - Journal of Symbolic Logic 37 (3):619-619.
  15.  10
    Review: Michael O. Rabin, Automata on Infinite Objects and Church's Problem. [REVIEW]Dirk Siefkes - 1975 - Journal of Symbolic Logic 40 (4):623-623.
  16.  6
    Review: Uwe Schoning, Logic for Computer Scientists. [REVIEW]Dirk Siefkes - 1991 - Journal of Symbolic Logic 56 (2):761-762.
  17.  4
    Rabin Michael O.. Automata on Infinite Objects and Church's Problem. Conference Board of the Mathematical Sciences, Regional Conference Series in Mathematics, No. 13. American Mathematical Society, Providence 1972, 22 Pp. [REVIEW]Dirk Siefkes - 1975 - Journal of Symbolic Logic 40 (4):623-623.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  18.  4
    The Complete Extensions of the Monadic Second Order Theory of Countable Ordinals.J. Richard Büchi & Dirk Siefkes - 1983 - Mathematical Logic Quarterly 29 (5):289-312.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  19.  4
    Review: J. W. Thatcher, J. B. Wright, Generalized Finite Automata Theory with an Application to a Decision Problem of Second-Order Logic. [REVIEW]Dirk Siefkes - 1972 - Journal of Symbolic Logic 37 (3):619-620.
  20.  4
    Review: Robert McNaughton, Testing and Generating Infinite Sequences by a Finite Automaton. [REVIEW]Dirk Siefkes - 1972 - Journal of Symbolic Logic 37 (3):618-618.
  21.  4
    Review: Michael O. Rabin, Decidability and Definability in Second-Order Theories. [REVIEW]Dirk Siefkes - 1975 - Journal of Symbolic Logic 40 (4):623-623.
  22.  2
    Uwe Schöning. Logik Für Informatiker. Second Revised Edition. Reihe Informatik, Vol. 56. B. I. Wissenschaftsverlag, Mannheim, Vienna, and Zurich, 1989, 172 Pp. - Uwe Schöning. Logic for Computer Scientists. English Translation of the Preceding. Progress in Computer Science and Applied Logic, Vol. 8. Birkhäuser, Boston, Basel, and Berlin, 1989, Ix + 166 Pp. [REVIEW]Dirk Siefkes - 1991 - Journal of Symbolic Logic 56 (2):761-762.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  23.  2
    Review: John Doner, Tree Acceptors and Some of Their Applications. [REVIEW]Dirk Siefkes - 1972 - Journal of Symbolic Logic 37 (3):619-619.
  24. Review: Jeanne Ferrante, Charles W. Rackoff, The Computational Complexity of Logical Theories. [REVIEW]Dirk Siefkes - 1984 - Journal of Symbolic Logic 49 (2):670-671.
     
    Export citation  
     
    Bookmark