Zum Hauptinhalt springen
Westfälische Hochschule

Suchergebnisse

Katalog

Aufsätze & mehr
8 Treffer

Suchmaske

Suchtipp für den Bereich Aufsätze & mehr: Wörter werden automatisch mit UND verknüpft. Eine ODER-Verknüpfung erreicht man mit dem Zeichen "|", eine NICHT-Verknüpfung mit einem "-" (Minus) vor einem Wort. Anführungszeichen ermöglichen eine Phrasensuche.
Beispiele: (burg | schloss) -mittelalter, "berufliche bildung"

Suchergebnisse einschränken oder erweitern

Aktive Suchfilter

8 Treffer

Sortierung: 
  1. Detailansicht für Treffer 1 öffnen
    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
    Herman Ruge Jervell
    In: Journal of Symbolic Logic, Jg. 61 (1996-03-01), S. 336-338
    Online unknown
    Zugriff:
    View record at OpenAIRE (Volltext)
    Wie komme ich dran?
  2. Detailansicht für Treffer 2 öffnen
    Andrew M. Pitts. Interpolation and conceptual completeness for pretoposes via category theory. Mathematical logic and theoretical computer science, edited by Kueker David W., Lopez-Escobar Edgar G. K. and Smith Carl H., Lecture notes in pure and applied mathematics, vol. 106, Marcel Dekker, New York and Basel1987, pp. 301–327. - Andrew M. Pitts. Conceptual completeness for first-order intuitionistic logic: an application of categorical logic. Annals of pure and applied logic, vol. 41 (1989), pp. 33–81
    Zawadowski, Marek
    In: Journal of Symbolic Logic, Jg. 60 (1995-06-01), S. 692-694
    Online unknown
    Zugriff:
    View record at OpenAIRE (Volltext)
    Wie komme ich dran?
  3. Detailansicht für Treffer 3 öffnen
    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
    Pratt, Vaughan R.
    In: Journal of Symbolic Logic, Jg. 51 (1986-03-01), S. 225-227
    Online unknown
    Zugriff:
    View record at OpenAIRE (Volltext)
    Wie komme ich dran?
  4. Detailansicht für Treffer 4 öffnen
    Sheila A. Greibach. Theory of program structures: schemes, semantics, verification. Lecture notes in computer science, vol. 36. Springer-Verlag, Berlin, Heidelberg, and New York, 1975, xv + 364 pp
    Constable, Robert L.
    In: Journal of Symbolic Logic, Jg. 43 (1978-03-01), S. 154-156
    Online unknown
    Zugriff:
    View record at OpenAIRE (Volltext)
    Wie komme ich dran?
  5. Detailansicht für Treffer 5 öffnen
    A. Bertoni. Mathematical methods of the theory of stochastic automata. Mathematical foundations of computer science, 3rd symposium at Jadwisin near Warsaw, June 17–22, 1974, edited by A. Blikle, Lecture notes in computer science, vol. 28, Springer-Verlag, Berlin, Heidelberg, and New York, 1975, pp. 9–22. - R. V. Freivald. Functions computable in the limit by probabilistic machines. Mathematical foundations of computer science, 3rd symposium at Jadwisin near Warsaw, June 17–22, 1974, edited by A. Blikle, Lecture notes in computer science, vol. 28, Springer-Verlag, Berlin, Heidelberg, and New York, 1975, pp. 77–87. - B. Goetze and R. Klette. Some properties of limit recursive functions. Mathematical foundations of computer science, 3rd symposium at Jadwisin near Warsaw, June 17–22, 1974, edited by A. Blikle, Lecture notes in computer science, vol. 28, Springer-Verlag, Berlin, Heidelberg, and New York, 1975, pp. 88–90. - Ole-Johan Dahl. An approach to correctness proofs of semicoroutines. Mathematical foundations of computer science, 3rd symposium at Jadwisin near Warsaw, June 17–22, 1974, edited by A. Blikle, Lecture notes in computer science, vol. 28, Springer-Verlag, Berlin, Heidelberg, and New York, 1975, pp. 157–174. - G. Wechsung. The axiomatization problem of a theory of linear languages. Mathematical foundations of computer science, 3rd symposium at Jadwisin near Warsaw, June 17–22, 1974, edited by A. Blikle, Lecture notes in computer science, vol. 28, Springer-Verlag, Berlin, Heidelberg, and New York, 1975, pp. 298–302. - L. Banachowski. Modular approach to the logical theory of programs. Mathematical foundations of computer science, 3rd symposium at Jadwisin near Warsaw, June 17–22, 1974, edited by A. Blikle, Lecture notes in computer science, vol. 28, Springer-Verlag, Berlin, Heidelberg, and New York, 1975, pp. 327–332. - Pierangelo Miglioli. Mathematical foundations of motivation languages and synthesis maps. Mathematical foundations of computer science, 3rd symposium at Jadwisin near Warsaw, June 17–22, 1974, edited by A. Blikle, Lecture notes in computer science, vol. 28, Springer-Verlag, Berlin, Heidelberg, and New York, 1975, pp. 388–408. - H. Rasiowa. ω+-valued algorithmic logic as a tool to investigate procedures. Mathematical foundations of computer science, 3rd symposium at Jadwisin near Warsaw, June 17–22, 1974, pp. 423–450. - Andrzej Salwicki. Procedures, formal computations and models. Mathematical foundations of computer science, 3rd symposium at Jadwisin near Warsaw, June 17–22, 1974 pp. 464–484
    Muchnick, Steven S.
    In: Journal of Symbolic Logic, Jg. 42 (1977-09-01), S. 422-423
    Online unknown
    Zugriff:
    View record at OpenAIRE (Volltext)
    Wie komme ich dran?
  6. Detailansicht für Treffer 6 öffnen
    Robert Goldblatt. Axiomatising the logic of computer programming. Lecture notes in computer science, vol. 130. Springer-Verlag, Berlin, Heidelberg, and New York, 1982, xi + 304 pp
    Wand, Mitchell
    In: Journal of Symbolic Logic, Jg. 50 (1985-09-01), S. 854-855
    Online unknown
    Zugriff:
    View record at OpenAIRE (Volltext)
    Wie komme ich dran?
  7. Detailansicht für Treffer 7 öffnen
    David Harel. First-order dynamic logic. Lecture notes in computer science, vol. 68. Springer-Verlag, Berlin, Heidelberg, and New York, 1979, X + 133 pp
    Tiuryn, Jerzy
    In: Journal of Symbolic Logic, Jg. 47 (1982-06-01), S. 453-454
    Online unknown
    Zugriff:
    View record at OpenAIRE (Volltext)
    Wie komme ich dran?
  8. Detailansicht für Treffer 8 öffnen
    Uwe Schöning. Complexity and structure. Lecture notes in computer science, vol. 211. Springer-Verlag, Berlin, Heidelberg, New York, and Tokyo, 1986, v + 99 pp
    Mahaney, Stephen R.
    In: Journal of Symbolic Logic, Jg. 54 (1989-09-01), S. 1106-1107
    Online unknown
    Zugriff:
    View record at OpenAIRE (Volltext)
    Wie komme ich dran?
xs 0 - 576
sm 576 - 768
md 768 - 992
lg 992 - 1200
xl 1200 - 1366
xxl 1366 -