Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Kai Brünnler
2010 – today
- 2012
[j9]Kai Brünnler, Thomas Studer: Syntactic cut-elimination for a fragment of the modal mu-calculus. Ann. Pure Appl. Logic 163(12): 1838-1853 (2012)- 2011
[e1]Kai Brünnler, George Metcalfe (Eds.): Automated Reasoning with Analytic Tableaux and Related Methods - 20th International Conference, TABLEAUX 2011, Bern, Switzerland, July 4-8, 2011. Proceedings. Lecture Notes in Computer Science 6793, Springer 2011, ISBN 978-3-642-22118-7- 2010
[c8]Kai Brünnler, Remo Goetschi, Roman Kuznets: A Syntactic Realization Theorem for Justification Logics. Advances in Modal Logic 2010: 39-58
[c7]
[i1]
2000 – 2009
- 2009
[j8]
[j7]Kai Brünnler, Thomas Studer: Syntactic cut-elimination for common knowledge. Ann. Pure Appl. Logic 160(1): 82-95 (2009)
[j6]Kai Brünnler, Thomas Studer: Syntactic Cut-elimination for Common Knowledge. Electr. Notes Theor. Comput. Sci. 231: 227-240 (2009)
[c6]- 2008
[j5]Kai Brünnler, Martin Lange: Cut-free sequent systems for temporal logic. J. Log. Algebr. Program. 76(2): 216-225 (2008)
[j4]Kai Brünnler, Dieter Probst, Thomas Studer: On contraction and the modal fragment. Math. Log. Q. 54(4): 345-349 (2008)
[c5]Kai Brünnler, Richard McKinley: An Algorithmic Interpretation of a Deep Inference System. LPAR 2008: 482-496- 2006
[j3]Kai Brünnler: Locality for Classical Logic. Notre Dame Journal of Formal Logic 47(4): 557-580 (2006)
[j2]Kai Brünnler: Cut Elimination inside a Deep Inference System for Classical Predicate Logic. Studia Logica 82(1): 51-71 (2006)
[c4]
[c3]- 2003
[b1]Kai Brünnler: Deep inference and symmetry in classical proofs. Dresden University of Technology 2003, ISBN 3-8325-0448-6, pp. 1-93
[j1]
[c2]- 2001
[c1]
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-01-14 21:40 CET by the dblp team



