 | 2009 |
|---|
| 22 |       | Phiniki Stouppa,
Thomas Studer:
Data Privacy for Knowledge Bases.
LFCS 2009: 409-421 |
| 21 | | Kai Brünnler,
Thomas Studer:
Syntactic cut-elimination for common knowledge.
Ann. Pure Appl. Logic 160(1): 82-95 (2009) |
| 20 | | Kai Brünnler,
Thomas Studer:
Syntactic Cut-elimination for Common Knowledge.
Electr. Notes Theor. Comput. Sci. 231: 227-240 (2009) |
| 19 | | Thomas Studer:
Common knowledge does not have the Beth property.
Inf. Process. Lett. 109(12): 611-614 (2009) |
| 2008 |
|---|
| 18 | | Gerhard Jäger,
Mathis Kretz,
Thomas Studer:
Canonical completeness of infinitary mu.
J. Log. Algebr. Program. 76(2): 270-292 (2008) |
| 17 | | Kai Brünnler,
Dieter Probst,
Thomas Studer:
On contraction and the modal fragment.
Math. Log. Q. 54(4): 345-349 (2008) |
| 16 | | Thomas Studer:
On the Proof Theory of the Modal mu-Calculus.
Studia Logica 89(3): 343-363 (2008) |
| 2007 |
|---|
| 15 | | Norbert Kottmann,
Thomas Studer:
Improving Semantic Query Answering.
DEXA 2007: 671-679 |
| 14 | | David Steiner,
Thomas Studer:
Total Public Announcements.
LFCS 2007: 498-511 |
| 13 | | Gerhard Jäger,
Mathis Kretz,
Thomas Studer:
Cut-free common knowledge.
J. Applied Logic 5(4): 681-689 (2007) |
| 2006 |
|---|
| 12 | | Phiniki Stouppa,
Thomas Studer:
A Formal Model of Data Privacy.
Ershov Memorial Conference 2006: 400-408 |
| 11 | | Mathis Kretz,
Thomas Studer:
Deduction chains for common knowledge.
J. Applied Logic 4(3): 331-357 (2006) |
| 2005 |
|---|
| 10 | | Kilian Stoffel,
Thomas Studer:
Provable Data Privacy.
DEXA 2005: 324-332 |
| 9 | | Michael Dürig,
Thomas Studer:
Probabilistic ABox Reasoning: Preliminary Results.
Description Logics 2005 |
| 8 | | Thomas Studer:
Explicit mathematics: power types and overloading.
Ann. Pure Appl. Logic 134(2-3): 284-302 (2005) |
| 2002 |
|---|
| 7 |  | 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 |
|---|
| 6 | | Thomas Studer:
Constructive Foundations for Featherweight Java.
Proof Theory in Computer Science 2001: 202-238 |
| 5 | | Gerhard Jäger,
Reinhard Kahle,
Thomas Studer:
Universes in explicit mathematics.
Ann. Pure Appl. Logic 109(3): 141-162 (2001) |
| 4 | | Reinhard Kahle,
Thomas Studer:
Formalizing non-termination of recursive programs.
J. Log. Algebr. Program. 49(1-2): 1-14 (2001) |
| 3 | | Thomas Studer:
A Semantics for [lambda]: a Calculus with Overloading and Late-binding.
J. Log. Comput. 11(4): 527-544 (2001) |
| 2 | | Dieter Probst,
Thomas Studer:
How to normalize the Jay.
Theor. Comput. Sci. 254(1-2): 677-681 (2001) |
| 2000 |
|---|
| 1 | | Reinhard Kahle,
Thomas Studer:
A Theory of Explicit Mathematics Equivalent to ID1.
CSL 2000: 356-370 |
