Preprints
In journals
-
Syntactic cut-elimination for a fragment of the modal mu-calculus,
joint paper with Kai Brünnler, to appear in Annals of Pure and Applied Logic
-
Justification Logic, Inference Tracking, and Data Privacy, Logic and Logical Philosophy, 20(4):297-306, 2011
-
A Buchholz Rule
for Modal Fixed Point Logics, joint paper with Gerhard Jäger, Logica Universalis, 5(1):1-19, 2011
-
Justifications for Common Knowledge,
joint paper with Samuel Bucheli and Roman Kuznets, Journal of Applied Non-classical Logics, 21(1):35-60, 2011
-
Syntactic cut-elimination for common knowledge, joint paper with Kai Brünnler, Annals of Pure and Applied Logic, 160(1):82-95, 2009. Errata.
-
Common knowledge does not have the Beth property, Information Processing Letters, 109:611-614, 2009
-
On the proof theory of the modal mu-calculus, Studia Logica, 89:343-363, 2008
-
Canonical completeness of infinitary mu, joint paper with Gerhard Jäger and Mathis Kretz, Journal of Logic and Algebraic Programming, 76(2):270-292, 2008
-
On contraction and the modal fragment, joint paper with Kai Brünnler and Dieter Probst, Mathematical Logic Quarterly, 54(4):345-349, 2008
-
Cut-free common knowledge, joint paper with Gerhard Jäger and Mathis Kretz, Journal of Applied Logic, 5:681-689, 2007
-
Deduction Chains for Common Knowledge, joint paper with Mathis Kretz, Journal of Applied Logic, 4:331-357, 2006
-
Explicit Mathematics: Power Types and Overloading, Annals of Pure and Applied Logic, 134 (2-3):284-302, 2005
-
Extending the system T0 of explicit mathematics: the limit and Mahlo axioms, joint paper with Gerhard Jäger, Annals of Pure and Applied Logic, 114 (1-3):79-101, 2002
-
Formalizing non-termination of recursive programs, joint paper with Reinhard Kahle, Journal of Logic and Algebraic Programming, 49 (1-2):1-14, 2001
-
A semantics for λ{}: a calculus with overloading and late-binding, Journal of Logic and Computation, 11 (4):527-544, 2001
-
How to normalize the jay, joint paper with Dieter Probst, Theoretical Computer Science, 254 (1-2):677-681, 2001
-
Universes in explicit mathematics, joint paper with Gerhard Jäger and Reinhard Kahle, Annals of Pure and Applied Logic, 109 (3):141-162, 2001
In conference proceedings
-
Justifications, Ontology, and Conservativity,
joint paper with Roman Kuznets, to appear in AIML 2012
-
Justified Terminological Reasoning, in E. Clarke, I. Virbitskaite, A. Voronkov, editors, Proceedings of Perspectives of System Informatics PSI'11, volume 7162 of LNCS, pages 349-361. Springer, 2012
-
Cut-elimination for the mu-calculus with one variable, joint paper with Grigori Mints, in Fixed Points in Computer Science 2012, volume 77 of EPTCS, pages 47–54. Open Publishing Association, 2012
-
An application of justification logic to protocol verification, in Proceedings of Computational Intelligence and Security CIS 2011, pages 779-783. IEEE, 2011
-
Partial Realization in Dynamic Justication Logic,
joint paper with Samuel Bucheli and Roman Kuznets, in L. Beklemishev and R. de Queiroz, editors, Logic, Language, Information and Computation WOLLIC 2011, volume 6642 of LNCS, pages 35-51. Springer 2011
-
Justified Belief Change,
joint paper with Samuel Bucheli, Roman Kuznets, Bryan Renne, and Joshua Sack, in X. Arrazola, M. Ponte, editors, Proceedings of Logic and Philosophy of Knowledge, Communication and Action, pages 135-155. Basque Country Press, 2010
-
Two ways to common knowledge, joint paper with Samuel Bucheli and Roman Kuznets, in T. Bolander, T. Braüner, editors, Proceedings of Methods for Modalities M4M6, volume 262 of ENTCS, pages 83-98. Elsevier, 2010
-
Privacy Preserving Modules for Ontologies, in A. Pnueli, I. Virbitskaite, A. Voronkov, editors, Proceedings of Perspectives of System Informatics PSI'09, volume 5947 of LNCS, pages 380-387. Springer, 2010
-
Data Privacy for ALC Knowledge Bases, joint paper with Phiniki Stouppa, in S. Artemov, A. Nerode, editors, Proceedings of Logical Foundations of Computer Science LFCS'09, volume 5407 of LNCS, pages 409-421. Springer, 2009
-
Syntactic cut-elimination for common knowledge (superseded by the journal version), joint paper with Kai Brünnler, in C. Areces and S. Demri, editors, Proceedings of Methods for Modalities M4M5, volume 231 of ENTCS, pages 227-240. Elsevier 2009
-
Improving semantic query answering, joint paper with Norbert Kottmann, in R. Wagner, N. Revell, G. Pernul, editors, Proceedings of Database and Expert Systems Applications DEXA '07, volume 4653 of LNCS, pages 671-679. Springer, 2007
-
Total Public Announcements, joint paper with David Steiner, in S. Artemov, A. Nerode, editors, Proceedings of Logical Foundations of Computer Science LFCS'07, volume 4514 of LNCS, pages 498-511. Springer, 2007
-
A Formal Model of Data Privacy, joint paper with Phiniki Stouppa, in I. Virbitskaite, A. Voronkov, editors, Proceedings of Perspectives of System Informatics PSI'06, volume 4378 of LNCS, pages 401-411. Springer, 2007
-
Cut-free Axiomatizations for Stratified Modal Fixed Point Logic, joint paper with Gerhard Jäger and Mathis Kretz, in H. Schlingloff, editor, Proceedings of Methods for Modalities 4, pages 125-143. 2005
-
Probabilistic ABox Reasoning: Preliminary Results, joint paper with Michael Dürig, in I. Horrocks, U. Sattler, F. Wolter, editors, Proceedings of Description Logics DL'05, pages 104-111. 2005
-
Provable Data Privacy, joint paper with Kilian Stoffel, in K. Viborg Andersen, J. Debenham, R. Wagner, editors, Proceedings of Database and Expert Systems Applications DEXA '05, volume 3588 of LNCS, pages 324-332. Springer, 2005.
-
Constructive Foundations for Featherweight Java, in R. Kahle, P. Schroeder-Heister, R. Stärk, editors, Proof Theory in Computer Science, volume 2183 of LNCS, pages 202-238. Springer, 2001
-
A theory of explicit mathemtics equivalent to ID1, joint paper with Reinhard Kahle, in P. Clote, H. Schwichtenberg, editors, Computer Science Logic CSL 2000, volume 1862 of LNCS, pages 356-370. Springer, 2000
Theses
-
Proof-Theoretic Contributions to Modal Fixed Point Logics, Habilitation thesis, University of Bern, 2010
-
Object-Oriented Programming in Explicit Mathematics: Towards the Mathematics of Objects, Dissertation thesis, University of Bern, 2001
-
Explicit mathematics:
W-type, models, Master's thesis, University of Bern, 1997
Others
-
Proof, Computation, Complexity PCC 2010, International Workshop, Proceedings, K. Brünnler and T. Studer (editors), technical report IAM-10-001, 2010
-
Explicit evidence systems with common knowledge, joint paper with Samuel Bucheli and Roman Kuznets, technical report, arXiv:1005.0484, 2010
-
Data Privacy for ALC Knowledge Bases, joint paper with Phiniki Stouppa, technical report IAM-08-002, 2008
-
Infinitary systems for the modal mu-calculus,
abstract in A. Beckmann et al. editors, Proceedings of Proof, Computation, Complexity PCC '07. 2007
-
Cut-free systems for the propositional modal mu-calculus, joint paper with Gerhard Jäger and Mathis Kretz,
abstract in Bulletin of Symbolic Logic, 13(2):263, 2007
-
Cut-free systems for the propositional modal mu-calculus, joint paper with Gerhard Jäger and Mathis Kretz, technical report IAM-07-001, 2007
-
A finitary cut-free axiomatization for stratified modal fixed point logic, joint paper with Gerhard Jäger and Mathis Kretz, abstract in B. Elbl, R. Kahle, I. Oitavem, editors, Proceedings of Proof, Computation, Complexity PCC '05, pages 41-43. 2005
-
Deduction chains for logic of common knowledge, joint paper with Mathis Kretz,
abstract in Bulletin of Symbolic Logic, 11(2):281-282, 2005
-
Canonical Databases and Certain Answers under Key Constraints, joint paper with Kilian Stoffel, technical report IAM-04-009, 2004
-
Least fixed points in applicative theories, joint paper with Reinhard Kahle, abstract in Bulletin of Symbolic Logic, 9(1):94, 2003
-
Impredicative overloading in explicit mathematics
abstract in Bulletin of Symbolic Logic, 7(1):150-151, 2001
-
A semantics for strict λ{}: a calculus with overloading and late-binding, technical report IAM-99-004, 1999