# Publications

Export 280 results:
2006
Brünnler, K.: Locality for classical logic. Notre Dame Journal of Formal Logic. 47, 557-580 (2006).
: On the proof theory of type two functionals based on primitive recursive operations. Mathematical Logic Quarterly. 52, 237-252 (2006).
Wehbe, R.: Revising non-monotonic rule-based belief databases. Proceedings of Belief Revision, Belief Merging and Social Choice (2006).
Probst, D.: The proof-theoretic analysis of transfinitely iterated quasi least fixed points. The Journal of Symbolic Logic. 71, 721-746 (2006).
2005
: About cut elimination for logics of common knowledge. Annals of Pure and Applied Logic. 133, 73-99 (2005).
: Cut-free axiomatizations for stratified modal fixed point logic. In: Schlingloff, H. Proceedings of Methods for Modalities 4. pp. 125-143. Humboldt-Universität Berlin (2005).
: Elementary Arithmetic. Annals of Pure and Applied Logic. 133, 275-292 (2005).
Studer, T.: Explicit mathematics: power types and overloading. Annals of Pure and Applied Logic. 134, 284-302 (2005).
Jäger, G.: Metapredicative and explicit Mahlo: a proof-theoretic perspective. In: Proceedings of Logic Colloquium '00. pp. 272-293. AK Peters (2005).
Probst, D.: On the relationship between fixed points and iteration in admissible set theory without foundation. Archive for Mathematical Logic. 44, 561-580 (2005).
: On two forms of bureaucracy in derivations. In: Proceedings of Structures and Deduction. pp. 65-74. Technische Universität Dresden (2005).
: Probabilistic ABox reasoning: preliminary results. In: Proceedings of Description Logics '05. pp. 104-111. CEUR-WS.org (2005).
: Provable data privacy. In: Proceedings of 16th International Conference on Database and Expert Systems Applications. pp. 324-332. Springer (2005).
: Reflections on reflections in explicit mathematics. Annals of Pure and Applied Logic. 136, 116-133 (2005).
Studer, T.: Relational representation of $\mathcal{ALN}$ knowledge bases. In: Proceedings of Multi '05. pp. 271-278. International Association for Development of the Information Society (2005).
2004
Strahm, T.: A proof-theoretic characterization of the basic feasible functionals. Theoretical Computer Science. 329, 159-176 (2004).
Jäger, G.: An intensional fixed point theory over first order arithmetic. Annals of Pure and Applied Logic. 128, 197-213 (2004).