Publications

Export 237 results:

Filters: 1997 is kahle_97a [Clear All Filters]

2010

K. Brünnler, R. Goetschi, and R. Kuznets, “A Syntactic Realization Theorem for Justification Logics”, in Advances in Modal Logic, Volume 8, 2010, pp. 39–58.

S. Bucheli, R. Kuznets, and T. Studer, “Two Ways to Common Knowledge”, in Proceedings of the 6th Workshop on {M}ethods for {Modalities} ({M4M–6 2009}), {C}openhagen, {D}enmark, 12–14 {N}ovember 2009, 2010, pp. 83–98.

S. Feferman and T. Strahm, “Unfolding finitist arithmetic”, Review of Symbolic Logic, vol. 3, pp. 665–689, 2010.

M. C. Stolz, “Verification of Workflow Control-Flow Patterns with the SPIN Model Checker”. Universität Bern, 2010.

T. Strahm, “Weak theories of operations and types”, in Ways of {P}roof {T}heory, 2010, pp. 441–468.

G. Jäger and J. Krähenbühl, “$Σ^1_1$ choice in a theory of sets and classes”, in Ways of {P}roof {T}heory, 2010, pp. 283–314.

2009

S. Eberhard, “Aspekte beweisbar totaler Funktionen in applikativen Theorien”. Universität Bern, 2009.

D. Steiner, “Belief Change Functions for Multi-Agent Systems”. Universität Bern, 2009.

T. Studer, “Common knowledge does not have the Beth property”, Information Processing Letters, vol. 109, pp. 611–614, 2009.

P. Stouppa and T. Studer, “Data Privacy for ALC Knowledge Bases”, in Proceedings of {L}ogical {F}oundations of {C}omputer {S}cience {LFCS}'09, 2009, vol. 5407, pp. 409–421.

P. Stouppa, “Deciding Data Privacy for ALC Knowledge Bases”. Universität Bern, 2009.

K. Brünnler, “Deep Sequent Systems for Modal Logic”, Archive for Mathematical Logic, vol. 48, pp. 551–577, 2009.

D. Spescha and T. Strahm, “Elementary explicit types and polynomial time operations”, Mathematical Logic Quarterly, vol. 55, pp. 245 –258, 2009.

G. Jäger, “Full operational set theory with unbounded existential quantification and power set”, Annals of Pure and Applied Logic, vol. 160, pp. 33–52, 2009.

J. Krähenbühl, “Justifying induction on modal mu-formulae”. Universität Bern, 2009.

S. Artemov and R. Kuznets, “Logical Omniscience as a Computational Complexity Problem”, in Theoretical {A}spects of {R}ationality and {K}nowledge, Proceedings of the Twelfth Conference ({TARK 2009}), Stanford University, California, 2009, pp. 14–23.

L. Alberucci and A. Facchini, “On modal $μ$-calculus and Gödel-Löb logic”, Studia Logica, vol. 91, pp. 145-169, 2009.

L. Alberucci and A. Facchini, “The modal $μ$-calculus hierarchy over restricted classes of transition systems”, Journal of Symbolic Logic, vol. 74, pp. 1367–1400, 2009.

K. Brünnler and L. Straßburger, “Modular Sequent Systems for Modal Logic”, in Tableaux 2009, 2009, vol. 5607.

R. Kuznets, “A Note on the Use of Sum in the Logic of Proofs”, in Proceedings of the 7th {P}anhellenic {L}ogic {S}ymposium, Patras University, Greece, 2009, pp. 99–103.

S. R. Buss and R. Kuznets, “The NP-completeness of reflected fragments of justification logics”, in Proceedings of {S}ymposium on {L}ogical {F}oundations of {C}omputer {S}cience ({LFCS}'09), 2009, vol. 5407, pp. 122-136.

R. Zumbrunnen, “Ontological Questions about Operational Set Theory”. Universität Bern, 2009.

G. Jäger, “Operations, sets and classes”, in Logic, {M}ethodology and {P}hilosophy of {S}cience - {P}roceedings of the {T}hirteenth {I}nternational {C}ongress, 2009.

R. Traber, “Proof-Systems for PLTL: Cycling Sequents and their Use in a Finitization for PLTL”. Universität Bern, 2009.

L. Alberucci, “Sequent calculi for the modal $μ$-calculus over $\mathsf {S5}$”, Journal of Logic and Computation, 2009.

Pages