Publications

Export 10 results:
Filters: First Letter Of Title is L  [Clear All Filters]
2012
S. R. Buss and R. Kuznets, Lower complexity bounds in justification logic, Annals of Pure and Applied Logic, vol. 163, pp. 888–905, 2012.
2009
S. Artemov and R. Kuznets, Logical Omniscience as a Computational Complexity Problem, in Theoretical {A}spects of {R}ationality and {K}nowledge, Proceedings of the Twelfth Conference ({TARK 2009}), Stanford University, California, 2009, pp. 14–23.
2006
K. Brünnler, Locality for classical logic, Notre Dame Journal of Formal Logic, vol. 47, p. 557{–}580, 2006.
1998
P. Balsiger and A. Heuerding, Logics Workbench 1.0, in Proceedings of Tableaux '98, 1998, vol. 1397, p. 35{–}37.
1996
A. Heuerding, G. Jäger, S. Schwendimann, and M. Seyfried, A logics workbench, The European Journal on Artificial Intelligence, vol. 9, p. 53{–}58, 1996.
A. Heuerding, G. Jäger, S. Schwendimann, and M. Seyfried, The logics workbench LWB: a snapshot, Euromath Bulletin, vol. 2, p. 177{–}186, 1996.
A. Heuerding, LWBtheory: information about some propositional logics via the WWW, Journal of the Interest Group in Pure and Applied Logic, vol. 4, p. 196{–}174, 1996.
1995
A. Heuerding, G. Jäger, S. Schwendimann, and M. Seyfried, LWB - a logics workbench, extended abstract, in Proceedings of KI-95 Activities: Workshop, Posters, Demos, 1995, p. 73{–}74.
1993
S. Artemov and T. Strassen, The Logic of the {Gödel Proof Predicate, in Computational Logic and Proof Theory, Third {K}urt {Gödel {C}olloquium, {KGC}'93, {B}rno, {C}zech {R}epublic, {A}ugust 24–27, 1993, Proceedings, 1993, vol. 713, pp. 71–82.