- CSB - MetaPress - Google - Bing - Yahoo
 | 2013 | |
|---|---|---|
| c16 |      | |
| 2012 | ||
| j18 | | 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) |
| c15 | | Roman Kuznets, Thomas Studer: Justifications, Ontology, and Conservativity. Advances in Modal Logic 2012: 437-458 |
| c14 | | Grigori Mints, Thomas Studer: Cut-elimination for the mu-calculus with one variable. FICS 2012: 47-54 |
| 2011 | ||
| j17 | | Samuel Bucheli, Roman Kuznets, Thomas Studer: Justifications for common knowledge. Journal of Applied Non-Classical Logics 21(1): 35-60 (2011) |
| j16 | | Gerhard Jäger, Thomas Studer: A Buchholz Rule for Modal Fixed Point Logics. Logica Universalis 5(1): 1-19 (2011) |
| c13 | | |
| c12 | | |
| c11 | | Samuel Bucheli, Roman Kuznets, Thomas Studer: Decidability for Justification Logics Revisited. TbiLLC 2011: 166-181 |
| c10 | | Samuel Bucheli, Roman Kuznets, Thomas Studer: Partial Realization in Dynamic Justification Logic. WoLLIC 2011: 35-51 |
| 2010 | ||
| j15 | | Samuel Bucheli, Roman Kuznets, Thomas Studer: Two Ways to Common Knowledge. Electr. Notes Theor. Comput. Sci. 262: 83-98 (2010) |
| i1 | | Samuel Bucheli, Roman Kuznets, Thomas Studer: Explicit Evidence Systems with Common Knowledge. CoRR abs/1005.0484 (2010) |
| 2009 | ||
| j14 | | Kai Brünnler, Thomas Studer: Syntactic cut-elimination for common knowledge. Ann. Pure Appl. Logic 160(1): 82-95 (2009) |
| j13 | | Kai Brünnler, Thomas Studer: Syntactic Cut-elimination for Common Knowledge. Electr. Notes Theor. Comput. Sci. 231: 227-240 (2009) |
| j12 | | Thomas Studer: Common knowledge does not have the Beth property. Inf. Process. Lett. 109(12): 611-614 (2009) |
| c9 | | |
| c8 | | |
| 2008 | ||
| j11 | | Gerhard Jäger, Mathis Kretz, Thomas Studer: Canonical completeness of infinitary mu. J. Log. Algebr. Program. 76(2): 270-292 (2008) |
| j10 | | Kai Brünnler, Dieter Probst, Thomas Studer: On contraction and the modal fragment. Math. Log. Q. 54(4): 345-349 (2008) |
| j9 | | |
| 2007 | ||
| j8 | | Gerhard Jäger, Mathis Kretz, Thomas Studer: Cut-free common knowledge. J. Applied Logic 5(4): 681-689 (2007) |
| c7 | | |
| c6 | | |
| 2006 | ||
| j7 | | Mathis Kretz, Thomas Studer: Deduction chains for common knowledge. J. Applied Logic 4(3): 331-357 (2006) |
| c5 | | Phiniki Stouppa, Thomas Studer: A Formal Model of Data Privacy. Ershov Memorial Conference 2006: 400-408 |
| 2005 | ||
| j6 | | Thomas Studer: Explicit mathematics: power types and overloading. Ann. Pure Appl. Logic 134(2-3): 284-302 (2005) |
| c4 | | |
| c3 | | Michael Dürig, Thomas Studer: Probabilistic ABox Reasoning: Preliminary Results. Description Logics 2005 |
| 2002 | ||
| j5 | | Gerhard Jäger, Thomas Studer: Extending the system T0 of explicit mathematics: the limit and Mahlo axioms. Ann. Pure Appl. Logic 114(1-3): 79-101 (2002) |
| 2001 | ||
| j4 | | Gerhard Jäger, Reinhard Kahle, Thomas Studer: Universes in explicit mathematics. Ann. Pure Appl. Logic 109(3): 141-162 (2001) |
| j3 | | Reinhard Kahle, Thomas Studer: Formalizing non-termination of recursive programs. J. Log. Algebr. Program. 49(1-2): 1-14 (2001) |
| j2 | | Thomas Studer: A Semantics for [lambda]: a Calculus with Overloading and Late-binding. J. Log. Comput. 11(4): 527-544 (2001) |
| j1 | | Dieter Probst, Thomas Studer: How to normalize the Jay. Theor. Comput. Sci. 254(1-2): 677-681 (2001) |
| c2 | | Thomas Studer: Constructive Foundations for Featherweight Java. Proof Theory in Computer Science 2001: 202-238 |
| 2000 | ||
| c1 | | Reinhard Kahle, Thomas Studer: A Theory of Explicit Mathematics Equivalent to ID1. CSL 2000: 356-370 |
Data released under the ODC-BY 1.0 license — See also our legal information page