Publications

Export 120 results:
Filters: Type is Journal Article  [Clear All Filters]
2009
: Elementary explicit types and polynomial time operations. Mathematical Logic Quarterly. 55, 245-258 (2009).
Jäger, G.: Full operational set theory with unbounded existential quantification and power set. Annals of Pure and Applied Logic. 160, 33-52 (2009).
: On modal $μ$-calculus and Gödel-Löb logic. Studia Logica. 91, 145-169 (2009).
Alberucci, L.: Sequent calculi for the modal $μ$-calculus over $\mathsf {S5}$. Journal of Logic and Computation. (2009).
: Syntactic cut-elimination for common knowledge. Annals of Pure and Applied Logic. 160, 82-95 (2009).
: The modal $μ$-calculus hierarchy over restricted classes of transition systems. Journal of Symbolic Logic. 74, 1367-1400 (2009).
2008
: Canonical completeness of infinitary mu. Journal of Logic and Algebraic Programming. 76, 270-292 (2008).
: Cut-free sequent systems for temporal logic. Journal of Logic and Algebraic Programming. 76, 216-225 (2008).
Strahm, T.: Introduction. Dialectica. 62, 145-147 (2008).
: On contraction and the modal fragment. Mathematical Logic Quarterly. 54, 345-349 (2008).
Studer, T.: On the proof theory of the modal mu-calculus. Studia Logica. 89, 343-363 (2008).
: Primitive recursive selection functions for existential assertions over abstract algebras. Journal of Logic and Algebraic Programming. 76, 175-197 (2008).
McKinley, R.: Soft linear set theory. Journal of Logic and Algebraic Programming. 76, 226-245 (2008).
2007
Stouppa, P.: A deep inference system for the modal logic $\mathsf S5$. Studia Logica. 85, 199-214 (2007).
: Cut-free common knowledge. Journal of Applied Logic. 5, 681-689 (2007).
Jäger, G.: On Feferman's operational set theory $\mathsf{OST}$. Annals of Pure and Applied Logic. 150, 19-39 (2007).
2006
Brünnler, K.: Cut elimination inside a deep inference system for classical predicate logic. Studia Logica. 82, 51-71 (2006).
: Deduction chains for common knowledge. Journal of Applied Logic. 4, 331-357 (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).
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).
: 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).
Probst, D.: On the relationship between fixed points and iteration in admissible set theory without foundation. Archive for Mathematical Logic. 44, 561-580 (2005).