Zum Hauptinhalt springen
Hochschulbibliothek der TH OWL

Suchergebnisse

Bestand TH OWL

Artikel & mehr
30 Treffer

Suchmaske

Suchtipp für den Bereich Artikel & 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

Erscheinungszeitraum

Mehr Treffer

Weniger Treffer

Art der Quelle

Thema

Verlag

Publikation

Sprache

Inhaltsanbieter

30 Treffer

Sortierung: 
  1. Detailansicht für Treffer 1 öffnen
    Giovanni Sommaruga (ed): Formal Theories of Information: From Shannon to Semantic Information Theory and General Concepts of Information ; Lecture Notes in Computer Science 5363, Springer-Verlag, Berlin, 2009, 267 pp, $64.95, ISBN: 9783-642-00658-6
    Sequoiah-Grayson, Sebastian
    In: Minds and Machines ; volume 22, issue 1, page 35-40 ; ISSN 0924-6495 1572-8641, 2011
    Online academicJournal
    Zugriff:
    View record in BASE (Volltext)
    Wie komme ich dran?
  2. Detailansicht für Treffer 2 öffnen
    Paul C. Gilmore. Logicism renewed: logical foundations for mathematics and computer science. Lecture Notes in Logic, vol. 23. Association for Symbolic Logic / A K Peters, Ltd., Wellesley, Massachusetts, 2005, xvii + 230 pp
    Andrews, James H.
    In: Bulletin of Symbolic Logic, Jg. 13 (2007-03-01), S. 104-106
    Online unknown
    Zugriff:
    View record at OpenAIRE (Volltext)
    Wie komme ich dran?
  3. Detailansicht für Treffer 3 öffnen
    Martin Dietzfelbinger. Primality testing in polynomial time—from randomized algorithms to 'PRIMES is in P'. Lecture Notes in Computer Science, vol. 3000. Springer-Verlag, 2004, x + 147 pp
    Rackoff, Charles
    In: Bulletin of Symbolic Logic, Jg. 12 (2006-09-01), S. 494-496
    Online unknown
    Zugriff:
    View record at OpenAIRE (Volltext)
    Wie komme ich dran?
  4. Detailansicht für Treffer 4 öffnen
    Wilfried Buchholz. Notation systems for infinitary derivations. Archive for mathematical logic, vol. 30 no. 5–6 (1991), pp. 277–296. - Wilfried Buchholz. Explaining Gentzen's consistency proof within infinitary proof theory. Computational logic and proof theory, 5th Kurt Gödel colloquium, KGC '97, Vienna, Austria, August 25–29, 1997, Proceedings, edited by Georg Gottlob, Alexander Leitsch, and Daniele Mundici, Lecture notes in computer science, vol. 1289, Springer, Berlin, Heidelberg, New York, etc., 1997, pp. 4–17. - Sergei Tupailo. Finitary reductions for local predicativity, I: recursively regular ordinals. Logic Colloquium '98, Proceedings of the annual European summer meeting of the Association for Symbolic Logic, held in Prague, Czech Republic, August 9–15, 1998, edited by Samuel R. Buss, Petr Háajek, and Pavel Pudlák, Lecture notes in logic, no. 13, Association for Symbolic Logic, Urbana, and A K Peters, Natick, Mass., etc., 2000, pp. 465–499
    Arai, Toshiyasu
    In: Bulletin of Symbolic Logic, Jg. 8 (2002-09-01), S. 437-439
    Online unknown
    Zugriff:
    View record at OpenAIRE (Volltext)
    Wie komme ich dran?
  5. Detailansicht für Treffer 5 ö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?
  6. Detailansicht für Treffer 6 ö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?
  8. Detailansicht für Treffer 8 öffnen
    Automata, logics, and infinite games: A guide to current research, edited by Erich Grädel, Wolfgang Thomas, and Thomas Wilke, Lecture Notes in Computer Science, vol. 2500 (Tutorial). Springer-Verlag, Berlin Heidelberg, 2002, viii + 385 pp
    Janin, David
    In: Bulletin of Symbolic Logic, Jg. 10 (2004-03-01), S. 114-115
    Online unknown
    Zugriff:
    View record at OpenAIRE (Volltext)
    Wie komme ich dran?
  9. Detailansicht für Treffer 9 öffnen
    Giovanni Sommaruga (ed): Formal Theories of Information: From Shannon to Semantic Information Theory and General Concepts of Information ; Lecture Notes in Computer Science, vol. 5363, Springer, New York, 2009, vii+269, $ 64.95, ISBN 978-3-642-00658-6
    Primiero, Giuseppe
    In: Minds and Machines ; volume 21, issue 1, page 119-122 ; ISSN 0924-6495 1572-8641, 2011
    Online academicJournal
    Zugriff:
    View record in BASE (Volltext)
    Wie komme ich dran?
  10. Detailansicht für Treffer 10 öffnen
    Paul C. Gilmore. Logicism renewed: logical foundations for mathematics and computer science. Lecture Notes in Logic, vol. 23. Association for Symbolic Logic / A K Peters, Ltd., Wellesley, Massachusetts, 2005, xvii + 230 pp.
    Andrews, James H.
    In: Bulletin of Symbolic Logic ; volume 13, issue 1, page 104-106 ; ISSN 1079-8986 1943-5894, 2007
    Online academicJournal
    Zugriff:
    View record in BASE (Volltext)
    Wie komme ich dran?
  11. Detailansicht für Treffer 11 öffnen
    Martin Dietzfelbinger. Primality testing in polynomial time—from randomized algorithms to “PRIMES is in P”. Lecture Notes in Computer Science, vol. 3000. Springer-Verlag, 2004, x + 147 pp.
    Rackoff, Charles
    In: Bulletin of Symbolic Logic ; volume 12, issue 3, page 494-496 ; ISSN 1079-8986 1943-5894, 2006
    Online academicJournal
    Zugriff:
    View record in BASE (Volltext)
    Wie komme ich dran?
  12. Detailansicht für Treffer 12 öffnen
    Wilfried Buchholz. Notation systems for infinitary derivations. Archive for mathematical logic, vol. 30 no. 5–6 (1991), pp. 277–296. - Wilfried Buchholz. Explaining Gentzen's consistency proof within infinitary proof theory. Computational logic and proof theory, 5th Kurt Gödel colloquium, KGC '97, Vienna, Austria, August 25–29, 1997, Proceedings, edited by Georg Gottlob, Alexander Leitsch, and Daniele Mundici, Lecture notes in computer science, vol. 1289, Springer, Berlin, Heidelberg, New York, etc., 1997, pp. 4–17. - Sergei Tupailo. Finitary reductions for local predicativity, I: recursively regular ordinals. Logic Colloquium '98, Proceedings of the annual European summer meeting of the Association for Symbolic Logic, held in Prague, Czech Republic, August 9–15, 1998, edited by Samuel R. Buss, Petr Háajek, and Pavel Pudlák, Lecture notes in logic, no. 13, Association for Symbolic Logic, Urbana, and A K Peters, Natick, Mass., etc., 2000, pp. 465–499.
    Arai, Toshiyasu
    In: Bulletin of Symbolic Logic ; volume 8, issue 3, page 437-439 ; ISSN 1079-8986 1943-5894, 2002
    Online academicJournal
    Zugriff:
    View record in BASE (Volltext)
    Wie komme ich dran?
  13. Detailansicht für Treffer 13 öffnen
    Automata, logics, and infinite games: A guide to current research, edited by Erich Grädel, Wolfgang Thomas, and Thomas Wilke, Lecture Notes in Computer Science, vol. 2500 (Tutorial). Springer-Verlag, Berlin Heidelberg, 2002, viii + 385 pp.
    Janin, David
    In: Bulletin of Symbolic Logic ; volume 10, issue 1, page 114-115 ; ISSN 1079-8986 1943-5894, 2004
    Online academicJournal
    Zugriff:
    View record in BASE (Volltext)
    Wie komme ich dran?
  14. Detailansicht für Treffer 14 ö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?
  15. Detailansicht für Treffer 15 ö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?
  16. Detailansicht für Treffer 16 ö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.
    Jervell, Herman Ruge
    In: Journal of Symbolic Logic ; volume 61, issue 1, page 336-338 ; ISSN 0022-4812 1943-5886, 1996
    Online academicJournal
    Zugriff:
    View record in BASE (Volltext)
    Wie komme ich dran?
  17. Detailansicht für Treffer 17 ö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 ; volume 60, issue 2, page 692-694 ; ISSN 0022-4812 1943-5886, 1995
    Online academicJournal
    Zugriff:
    View record in BASE (Volltext)
    Wie komme ich dran?
  18. Detailansicht für Treffer 18 öffnen
    Shafi Goldwasser, Silvio Micali, and Charles Rackoff. The knowledge complexity of interactive proof systems. SIAM journal on computing, vol. 18 (1989), pp. 186–208. - Oded Goldreich, Silvio Micali, and Avi Wigderson. Proofs that release minimum knowledge. Mathematical foundations of computer science 1986, Proceedings of the 12th symposium, Bratislava, Czechoslovakia, August 25–29, 1986, edited by J. Gruska, B. Rovan, and J. Wiedermann, Lecture notes in computer science, vol. 233, Springer-Verlag, Berlin, Heidelberg, New York, etc., 1986, pp. 639–650. - Oded Goldreich. Randomness, interactive proofs, and zero-knowledge—a survey. The universal Turing machine, A half-century survey, edited by Rolf Herken, Kammerer & Unverzagt, Hamburg and Berlin, and Oxford University Press, Oxford and New York, 1988, pp. 377–405.
    Fortnow, Lance
    In: The Journal of Symbolic Logic ; volume 56, issue 3, page 1092-1094 ; ISSN 0022-4812 1943-5886, 1991
    Online academicJournal
    Zugriff:
    View record in BASE (Volltext)
    Wie komme ich dran?
  19. Detailansicht für Treffer 19 ö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?
  20. Detailansicht für Treffer 20 ö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?

Überregionale Kataloge

xs 0 - 576
sm 576 - 768
md 768 - 992
lg 992 - 1200
xl 1200 - 1366
xxl 1366 -