Arbib, M. A. / Kfoury, A. J. / Moll, R. N., A Basis for Theoretical Computer Science. Texts and Monographs in Computer Science. Berlin-Heidelberg-New York, Springer-Verlag 1981. VIII, 220 S., 49 Abb., DM 42,50. US $ 19.80. ISBN 3-540-90573-1

Theoretical Computer ◽

Science Texts

Balcazar, J. L.; Diaz J.; Gabbarro, J.: Structural Complexity I. EATCS Monographs an Theoretical Computer Science 11. Springer-Verlag, Berlin - Heidelberg - New York - London - Paris - Tokyo 1988. 57 figs., IX, 191 pp., DM 54,-. ISBN 3-540-18622-0

Biometrical Journal ◽

10.1002/bimj.4710320704 ◽

2007 ◽

Vol 32 (7) ◽

pp. 790-790

Author(s):

D. Seese

Keyword(s):

New York ◽

Computer Science ◽

Structural Complexity ◽

Theoretical Computer

Vaughan R. Pratt. Semantical considerations on Floyd–Hoare logic. 17th Annual Symposium on Foundations of Computer Science, Institute of Electrical and Electronics Engineers, New York1976, pp. 109–121. - Michael J. Fischer and Richard E. Ladner. Propositional dynamic logic of regular programs. Journal of computer and system sciences, vol. 18 (1979), pp. 194–211. - Krister Segerberg. A completeness theorem in the modal logic of programs. Universal algebra and applications. Papers presented at Stefan Banach International Mathematical Center at the semester “Universal algebra and applications” held February 15–June 9, 1978, edited by Tadeuz Traczyk, Banach Center Publications, vol. 9, PWN—Polish Scientific Publishers, Warsaw1982, pp. 31–46. - Rohit Parikh. The completeness of propositional dynamic logic. Mathematical foundations of computer science 1978, Proceedings, 7th symposium, Zakopane, Poland, September 4–8, 1978, edited by J. Winkowski, Lecture notes in computer science, vol. 64, Springer-Verlag, Berlin, Heidelberg, and New York, 1978, pp. 403–415. - Dexter Kozen and Rohit Parikh. An elementary proof of the completeness of PDL. Theoretical computer science, vol. 14(1981), pp. 113–118.

10.2307/2273958 ◽

1986 ◽

Vol 51 (1) ◽

pp. 225-227 ◽

Cited By ~ 3

Author(s):

Robert Goldblatt

Keyword(s):

New York ◽

Computer Science ◽

Universal Algebra ◽

Dynamic Logic ◽

Completeness Theorem ◽

Propositional Dynamic Logic ◽

Theoretical Computer ◽

Mathematical Foundations ◽

Scientific Publishers

A. J. Kfoury, Robert N. Moll, and Michael A. Arbib. A programming approach to computability. The AKM series in theoretical computer science. Springer-Verlag, New York, Heidelberg, and Berlin, 1982, viii + 251 pp.

10.2307/2273889 ◽

1987 ◽

Vol 52 (1) ◽

pp. 289-291

Author(s):

H. P. Edmundson

Keyword(s):

New York ◽

Computer Science ◽

Programming Approach ◽

Theoretical Computer

Harold Simmons. Derivation and computation. Taking the Curry-Howard correspondence seriously. Cambridge tracts in theoretical computer science, vol. 51. Cambridge University Press, Cambridge, New York, etc., 2000, xxv + 384 pp.

Bulletin of Symbolic Logic ◽

10.2307/2687758 ◽

2001 ◽

Vol 7 (3) ◽

pp. 380-383

Author(s):

Norman Danner

Keyword(s):

New York ◽

Computer Science ◽

Theoretical Computer ◽

Martin D. Davis, Ron Sigal, and Elaine J. Weyuker. Computability, complexity, and languages. Fundamentals of theoretical computer science. Second edition of LII 293. Computer science and scientific computing. Academic Press, Boston, San Diego, New York, etc., 1994, xix + 609 pp.

10.2307/2275691 ◽

1996 ◽

Vol 61 (2) ◽

pp. 703-704 ◽

Cited By ~ 2

Author(s):

H. B. Enderton

Keyword(s):

New York ◽

Computer Science ◽

San Diego ◽

Scientific Computing ◽

Academic Press ◽

Theoretical Computer

Jean-Yves Girard. Linear logic. Theoretical computer science, vol. 50 (1987), pp. 1–101. - A. S. Troelstra. Lectures on linear logic. CSLI lecture notes, no. 29. Center for the Study of Language and Information, Stanford 1992, also distributed by Cambridge University Press, New York, ix + 200 pp.

10.2307/2275616 ◽

1996 ◽

Vol 61 (1) ◽

pp. 336-338

Author(s):

Herman Ruge Jervell

Keyword(s):

New York ◽

Computer Science ◽

Linear Logic ◽

Theoretical Computer ◽

Cambridge University ◽

Lecture Notes

Jon Barwise and Jerry Seligman. Information flow. The logic of distributed systems. Cambridge tracts in theoretical computer science, no. 44. Cambridge University Press, Cambridge, New York, and Oakleigh, Victoria, 1997, xv + 274 pp.

10.2307/2586823 ◽

1999 ◽

Vol 64 (4) ◽

pp. 1836-1836

Author(s):

Maarten De Rijke

Keyword(s):

New York ◽

Distributed Systems ◽

Computer Science ◽

Information Flow ◽

Theoretical Computer ◽

A. S. Troelstra and H. Schwichtenberg. Basic proof theory. Cambridge tracts in theoretical computer science, no. 43. Cambridge University Press, Cambridge, New York, and Oakleigh, Victoria, 1996, xi + 343 pp.

10.2307/2586674 ◽

1998 ◽

Vol 63 (4) ◽

pp. 1605-1606

Author(s):

Roy Dyckhoff

Keyword(s):

New York ◽

Computer Science ◽

Proof Theory ◽

Theoretical Computer ◽

Patrick Blackburn, Maarten De Rijke, and Yde Venema. Modal logic. Cambridge tracts in theoretical computer science, no. 53. Cambridge University Press, Cambridge, New York, etc., 2001, xxii + 554 pp.

Bulletin of Symbolic Logic ◽

10.2178/bsl/1182353875 ◽

2002 ◽

Vol 8 (2) ◽

pp. 299-301

Author(s):

Marcus Kracht

Keyword(s):

New York ◽

Modal Logic ◽

Computer Science ◽

Theoretical Computer ◽

Jan Paredaens, Paul de Bra, Marc Gyssens, and Dirk van Gucht. The structure of the relational database model. EATCS monographs on theoretical computer science, vol. 17. Springer-Verlag, Berlin, Heidelberg, New York, etc., 1989, x + 231 pp.

10.2307/2275312 ◽

1992 ◽

Vol 57 (2) ◽

pp. 759-760

Author(s):

J. A. Makowsky

Keyword(s):

New York ◽

Computer Science ◽

Relational Database ◽

Theoretical Computer ◽

Database Model