Publications
Export 22 results:
Filters: First Letter Of Title is S [Clear All Filters]
, “Syntactic cut-elimination for a fragment of the modal mu-calculus”, Annals of Pure and Applied Logic, vol. 163, pp. 1838–1853, 2012.
, “The Suslin operator in applicative theories: its proof-theoretic analysis via ordinal theories”, Annals of Pure and Applied logic, vol. 162, no. 8, pp. 647-660, 2011.
, “Self-Referential Justifications in Epistemic Logic”, Theory of Computing Systems, vol. 46, pp. 636–661, 2010.
, “Self-Referentiality in Contraction-free Fragments of Modal Logic S4”. Universität Bern, 2010.
, “A Syntactic Realization Theorem for Justification Logics”, in Advances in Modal Logic, Volume 8, 2010, pp. 39–58.
, “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, vol. 160, pp. 82-95, 2009.
, “Syntactic cut-elimination for common knowledge”, in Proceedings of {M}ethods for {M}odalities {M}4{M}5, 2009, vol. 231, pp. 227–240.
, “Soft linear set theory”, Journal of Logic and Algebraic Programming, vol. 76, pp. 226-245, 2008.
, “A syntactical treatment of simultaneous fixpoints in the modal $μ$-calculus”. Universität Bern, 2007.
, “A system for consistency preserving belief change”, in Proceedings of Rationality and Knowledge, 2006, p. 133{–}144.
, “Strictness of the modal $μ$-calculus hierarchy”, in Automata, Logics and infinite Games: A Guide to Current Research, 2002, vol. 2500, p. 185{–}201.
, “A semantics for $\lambda^{\{\}}_{\mathsf str}$: a calculus with overloading and late-binding”, Journal of Logic and Computation, vol. 11, p. 527{–}544, 2001.
, “A semantics for $\lambda^{ \{ \} }_{ \mathsf {str }}$: a calculus with overloading and late-binding”. Universität Bern, 1999.
, “Sequent Calculi for Proof Search in some Modal Logics”. Universität Bern, 1998.
, “Some proof theory of first order logic programming”, in Logic of Computation, 1997, vol. 157, p. 201{–}228.
, “Some theories with positive induction of ordinal strength $\varphi \omega 0$”, The Journal of Symbolic Logic, vol. 61, p. 818{–}842, 1996.
, “Systems of explicit mathematics with non-constructive $μ$-operator and join”, Annals of Pure and Applied Logic, vol. 82, p. 193{–}219, 1996.
, “Systems of explicit mathematics with non-constructive $μ$-operator. Part II”, Annals of Pure and Applied Logic, vol. 79, p. 37{–}52, 1996.
, “Second order theories with ordinals and elementary comprehension”, Archive for Mathematical Logic, vol. 34, p. 345{–}375, 1995.
, “Some proof-theoretic aspects of logic programming”, in Logic and Algebra of Specification, 1993, vol. 94, p. 113{–}142.
, “Systems of explicit mathematics with non-constructive $μ$-operator. Part I”, Annals of Pure and Applied Logic, vol. 65, p. 243{–}263, 1993.