11 results
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.
-
- Journal:
- The Journal of Symbolic Logic / Volume 56 / Issue 2 / June 1991
- Published online by Cambridge University Press:
- 12 March 2014, pp. 761-762
- Print publication:
- June 1991
-
- Article
- Export citation
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 Wiesbaden 1985, 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 Wiesbaden 1986, xvii + 469 pp.
-
- Journal:
- The Journal of Symbolic Logic / Volume 54 / Issue 4 / December 1989
- Published online by Cambridge University Press:
- 12 March 2014, pp. 1490-1493
- Print publication:
- December 1989
-
- Article
- Export citation
Ferenc Gécseg and Magnus Steinby. Tree automata. Akadémiai Kiadó, Budapest 1984, also distributed by Heyden & Son, Philadelphia, 235 pp.
-
- Journal:
- The Journal of Symbolic Logic / Volume 52 / Issue 1 / March 1987
- Published online by Cambridge University Press:
- 12 March 2014, pp. 287-288
- Print publication:
- March 1987
-
- Article
- Export citation
Jeanne Ferrante and Charles W. Rackoff. The computational complexity of logical theories. Lecture notes in mathematics, vol. 718. Springer-Verlag, Berlin, Heidelberg, and New York, 1979, X + 243 pp.
-
- Journal:
- The Journal of Symbolic Logic / Volume 49 / Issue 2 / June 1984
- Published online by Cambridge University Press:
- 12 March 2014, pp. 670-671
- Print publication:
- June 1984
-
- Article
- Export citation
Michael O. Rabin. 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 Yehoshua Bar-Hillel, Studies in logic and the foundations of mathematics, North-Holland Publishing Company, Amsterdam and London 1970, pp. 1–23.
-
- Journal:
- The Journal of Symbolic Logic / Volume 40 / Issue 4 / December 1975
- Published online by Cambridge University Press:
- 12 March 2014, pp. 622-623
- Print publication:
- December 1975
-
- Article
- Export citation
Michael O. Rabin. 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.
-
- Journal:
- The Journal of Symbolic Logic / Volume 40 / Issue 4 / December 1975
- Published online by Cambridge University Press:
- 12 March 2014, p. 623
- Print publication:
- December 1975
-
- Article
- Export citation
Michael O. Rabin. 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.
-
- Journal:
- The Journal of Symbolic Logic / Volume 40 / Issue 4 / December 1975
- Published online by Cambridge University Press:
- 12 March 2014, p. 623
- Print publication:
- December 1975
-
- Article
- Export citation
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 (1968), pp. 57–81.
-
- Journal:
- The Journal of Symbolic Logic / Volume 37 / Issue 3 / September 1972
- Published online by Cambridge University Press:
- 12 March 2014, pp. 619-620
- Print publication:
- September 1972
-
- Article
- Export citation
John Doner. Tree acceptors and some of their applications. Journal of computer and system sciences, vol. 4 (1970), pp. 406–451.
-
- Journal:
- The Journal of Symbolic Logic / Volume 37 / Issue 3 / September 1972
- Published online by Cambridge University Press:
- 12 March 2014, p. 619
- Print publication:
- September 1972
-
- Article
- Export citation
Michael O. Rabin. Decidability of second-order theories and automata on infinite trees. Bulletin of the American Mathematical Society, vol. 74 (1968), pp. 1025–1029. - Michael O. Rabin. Decidability of second-order theories and automata on infinite trees. Transactions of the American Mathematical Society, vol. 141 (1969), pp. 1–35.
-
- Journal:
- The Journal of Symbolic Logic / Volume 37 / Issue 3 / September 1972
- Published online by Cambridge University Press:
- 12 March 2014, pp. 618-619
- Print publication:
- September 1972
-
- Article
- Export citation
Robert McNaughton. Testing and generating infinite sequences by a finite automaton. Information and control, vol. 9 (1966), pp. 521–530.
-
- Journal:
- The Journal of Symbolic Logic / Volume 37 / Issue 3 / September 1972
- Published online by Cambridge University Press:
- 12 March 2014, p. 618
- Print publication:
- September 1972
-
- Article
- Export citation