Publications

Export 300 results:

2009

Spescha, D., Strahm, T.: Elementary explicit types and polynomial time operations. Mathematical Logic Quarterly. 55, 245-258 (2009).

Jäger, G.: Full operational set theory with unbounded existential quantification and power set. Annals of Pure and Applied Logic. 160, 33-52 (2009).

Krähenbühl, J.: Justifying induction on modal mu-formulae. (2009).

Artemov, S., Kuznets, R.: Logical Omniscience as a Computational Complexity Problem. In: Heifetz, A. Theoretical Aspects of Rationality and Knowledge, Proceedings of the Twelfth Conference (TARK 2009). pp. 14-23. ACM, Stanford University, California (2009).

Brünnler, K., Straßburger, L.: Modular Sequent Systems for Modal Logic. In: Giese, M. and Waaler, A. Tableaux 2009. Springer-Verlag (2009).

Alberucci, L., Facchini, A.: On modal $μ$-calculus and Gödel-Löb logic. Studia Logica. 91, 145-169 (2009).

Zumbrunnen, R.: Ontological Questions about Operational Set Theory. (2009).

Jäger, G.: Operations, sets and classes. In: Glymour, C., Wei, W., and Westerstahl, D. Logic, Methodology and Philosophy of Science - Proceedings of the Thirteenth International Congress. College Publications (2009).

Traber, R.: Proof-Systems for PLTL: Cycling Sequents and their Use in a Finitization for PLTL. (2009).

Alberucci, L.: Sequent calculi for the modal $μ$-calculus over $\mathsf {S5}$. Journal of Logic and Computation. (2009).

Brünnler, K., Studer, T.: Syntactic cut-elimination for common knowledge. Annals of Pure and Applied Logic. 160, 82-95 (2009).

Brünnler, K., Studer, T.: Syntactic cut-elimination for common knowledge. In: Areces, C. and Demri, S. Proceedings of Methods for Modalities M4M5. pp. 227-240. Elsevier (2009).

Alberucci, L., Facchini, A.: The modal $μ$-calculus hierarchy over restricted classes of transition systems. Journal of Symbolic Logic. 74, 1367-1400 (2009).

Buss, S.R., Kuznets, R.: The NP-completeness of reflected fragments of justification logics. In: Artemov, S. and Nerode, A. Proceedings of Symposium on Logical Foundations of Computer Science (LFCS'09). pp. 122-136 (2009).

Spescha, D.: Weak Systems of Explicit Mathematics. (2009).

2008

Brünnler, K., McKinley, R.: An Algorithmic Interpretation of a Deep Inference System. In: Cervesato, I., Veith, H., and Voronkov, A. LPAR 2008. pp. 482-496. Springer-Verlag (2008).

Larrzabal, C.: Automatic Model Checking of UML models. (2008).

Jäger, G., Kretz, M., Studer, T.: Canonical completeness of infinitary mu. Journal of Logic and Algebraic Programming. 76, 270-292 (2008).

Brünnler, K., Lange, M.: Cut-free sequent systems for temporal logic. Journal of Logic and Algebraic Programming. 76, 216-225 (2008).

Bucheli, S.: Explicit Mathematics with Positive Existential Stratified Comprehension, Join and Uniform Monotone Inductive Definitions. (2008).

Strahm, T.: Gödel's Dialectica Interpretation. Wiley (2008).

Strahm, T.: Introduction. Dialectica. 62, 145-147 (2008).

Brünnler, K., Probst, D., Studer, T.: On contraction and the modal fragment. Mathematical Logic Quarterly. 54, 345-349 (2008).

Studer, T.: On the proof theory of the modal mu-calculus. Studia Logica. 89, 343-363 (2008).

Goetschi, R.: Polytime Functions in Two-Sorted Bounded Arithmetic. (2008).

Pages