# Publications

Export 77 results:
Filters: Type is Conference Paper  [Clear All Filters]
2002
Alberucci, L.: Strictness of the modal $μ$-calculus hierarchy. In: Automata, Logics and infinite Games: A Guide to Current Research. pp. 185-201. Springer (2002).
: The proof-theoretic analysis of the Suslin operator in applicative theories. In: Reflections on the Foundations of Mathematics: Essays in Honor of Solomon Feferman. pp. 270-292. AK Peters (2002).
2001
Studer, T.: Constructive foundations for Featherweight Java. In: Proceedings of the International Seminar on Proof Theory in Computer Science. pp. 202-238. Springer (2001).
2000
: A theory of explicit mathematics equivalent to ${ \mathsf{ID} }_1$. In: Proceedings of Computer Science Logic. pp. 356-370. Springer (2000).
Strahm, T.: Autonomous fixed point progressions and fixed point transfinite recursion. In: Proceedings of Logic Colloquium '98. pp. 449-464. AK Peters (2000).
Tupailo, S.: Finitary reductions for local predicativity, I: recursively regular ordinals. In: Proceedings of Logic Colloquium '98. pp. 465-499. AK Peters (2000).
1999
: Epsilon-substitution method for the ramified language and $Δ^1_1$-comprehension rule. In: Logic and Foundation of Mathematics. pp. 107-130. Kluwer (1999).
Strahm, T.: First steps into metapredicativity in explicit mathematics. In: Sets and Proofs. pp. 383-402. Cambridge University Press (1999).
: On applicative theories. In: Logic and Foundations of Mathematics. pp. 83-92. Kluwer (1999).
1998
Schwendimann, S.: A new one-pass tableau calculus for $\mathsf{PLTL}$. In: de Swart, H.C.M. Proceedings of Tableaux '98. pp. 277-292. Springer (1998).
: A proof-theoretic framework for logic programming. In: Buss, S.S. Handbook of Proof Theory. pp. 639-682. North-Holland (1998).
: Comparison of Theorem Provers for Modal Logics – Introduction and Summary. In: de Swart, H.C.M. Proceedings of Tableaux '98. pp. 25-26. Springer (1998).
: Logics Workbench 1.0. In: de Swart, H.C.M. Proceedings of Tableaux '98. pp. 35-37. Springer (1998).
: Relation Algebra and Modal Logics. In: Relational Methods in Computer Science. pp. 20-89. Springer (1998).
1997
: Hybrid spectral transform diagrams. In: Proceedings of the International Conference on Information and Communications Security. pp. 251-255. Springer (1997).
: Model checking. In: Handbook of Automated Reasoning. pp. 1635-1790. Elsevier Science (1997).
Jäger, G.: Some proof theory of first order logic programming. In: Schwichtenberg, H. Logic of Computation. pp. 201-228. Springer (1997).
1996
: Efficient loop-check for backward proof search in some non-classical propositional logics. In: Proceedings of Tableaux '96. pp. 210-225. Springer (1996).
: On the modal logic K plus theories. In: Büning, H.K. Proceedings of Computer Science Logic '95. pp. 308-319. Springer (1996).
1995
Jäger, G.: A deductive approach to logic programming. In: Schwichtenberg, H. Proof and Computation. pp. 231-270. Springer (1995).
: LWB - a logics workbench, extended abstract. In: Proceedings of KI-95 Activities: Workshop, Posters, Demos. pp. 73-74. Gesellschaft für Informatik (1995).
: Propositional logics on the computer. In: Proceedings of Theorem Proving with Analytic Tableaux and Related Methods. pp. 310-323. Springer (1995).
: Relational semantics for modal logics. In: Rodosek, R. Proceedings of Verification in New Orientations. pp. 104-131. University of Maribor (1995).
1994
: Executable models for analysis and implementation of complex systems. Proceedings of Information Conference of Swiss Priority Programme Informatics Research 1992–1996, Module 1: Secure Distributed Systems (1994).
1993
Jäger, G.: Some proof-theoretic aspects of logic programming. In: Logic and Algebra of Specification. pp. 113-142. Springer (1993).