# Publications

Export 22 results:
Filters: First Letter Of Last Name is A  [Clear All Filters]
In Press
, Unfolding feasible arithmetic and weak truth, in Axiomatic Theories of Truth, In Press.
2013
, Update as Evidence: Belief Expansion, in Logical Foundations of Computer Science, International Symposium, LFCS 2013, San Diego, CA, USA, January 6–8, 2013, Proceedings, vol. 7734, Springer, 2013, pp. 266–279.
2010
, Justified Belief Change, in Proceedings of the {S}econd {ILCLI} {I}nternational {W}orkshop on {L}ogic and {P}hilosphy of {K}nowledge, {C}ommunication and {A}ction ({L}og{KCA}-10), 2010, pp. 135–155.
2009
, 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.
, 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.
, On modal $μ$-calculus and Gödel-Löb logic, Studia Logica, vol. 91, pp. 145-169, 2009.
, The modal $μ$-calculus hierarchy over restricted classes of transition systems, Journal of Symbolic Logic, vol. 74, pp. 1367–1400, 2009.
, 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.
L. Alberucci, Sequent calculi for the modal $μ$-calculus over $\mathsf {S5}$, Journal of Logic and Computation, 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.
2007
, Total public announcements, in Proceedings of Logical Foundations of Computer Science, 2007, vol. 4514, p. 498{–}511.
2006
D. Steiner, A system for consistency preserving belief change, in Proceedings of Rationality and Knowledge, 2006, p. 133{–}144.
2005
, About cut elimination for logics of common knowledge, Annals of Pure and Applied Logic, vol. 133, p. 73{–}99, 2005.
, Provable data privacy, in Proceedings of 16th International Conference on Database and Expert Systems Applications, 2005, vol. 3588, p. 324{–}332.
2004
, On modal $μ$-calculus and non-well-founded set theory, Journal of Philosophical Logic, vol. 33, p. 343{–}360, 2004.
2002
L. Alberucci, The Modal $μ$-Calculus and the Logic of Common Knowledge. Universität Bern, 2002.
L. Alberucci, Strictness of the modal $μ$-calculus hierarchy, in Automata, Logics and infinite Games: A Guide to Current Research, 2002, vol. 2500, p. 185{–}201.
1993
, The Basic Logic of Proofs, in {C}omputer {S}cience {L}ogic, 6th Workshop, {CSL}'92, {S}an {M}iniato, {I}taly, {S}eptember 28–{O}ctober 2, 1992, Selected Papers, 1993, vol. 702, pp. 14–28.
, Functionality in the Basic Logic of Proofs. Institut für Informatik und angewandte Mathematik, 1993.
, The Logic of the {Gödel Proof Predicate, in Computational Logic and Proof Theory, Third {K}urt {Gödel {C}olloquium, {KGC}'93, {B}rno, {C}zech {R}epublic, {A}ugust 24–27, 1993, Proceedings, 1993, vol. 713, pp. 71–82.
1992
, The Basic Logic of Proofs. Institut für Informatik und angewandte Mathematik, 1992.