International audienceWe define cut-free display calculi for knowledge logics where an indiscernibility relation is associated to each set of agents, andwhere agents decide the membership of objects using this indiscernibility relation. To do so, we first translate the knowledge logics into polymodal logics axiomatised by primitive axioms and then use Kracht's results on properly displayable logics to define the display calculi. Apart from these technical results, we argue that Display Logic is a natural framework to define cut-free calculi for many other logics with relative accessibility relations
We formulate a unified display calculus proof theory for the four principal varieties of bunched log...
We use a deep embedding of the display calculus for relation algebras δRA in the logical framework I...
We introduce a proper multi-type display calculus for bilattice logic (with conflation) for which we...
We define cut-free display calculi for knowledge logics where an indiscernibility relation is associ...
Abstract. We use a deep embedding of the display calculus for relation algebras ffiRA in the logical...
We apply the general results of Ciabattoni & Ramanayake about display calculi to atomic and molecula...
We describe a deep embedding of the display calculus ÆRA, for relation algebras, using Isabelle/HOL....
The aim of this paper is to introduce and explain display calculi for a variety of logics. We provid...
AbstractLogical frameworks are computer systems which allow a user to formalise mathematics using sp...
1 Introduction Sequent calculi provide a rigorous basis for meta-theoretic studies of logics. The ce...
What can (and what cannot) be expressed by structural display rules? Given a display calculus, we pr...
We introduce proper display calculi for basic monotonic modal logic, the conditional logic CK and a ...
A recent strand of research in structural proof theory aims at exploring the notion of analytic calc...
We formulate a unified display calculus proof theory for the four principal varieties of bunched log...
We use a deep embedding of the display calculus for relation algebras δRA in the logical framework I...
We introduce a proper multi-type display calculus for bilattice logic (with conflation) for which we...
We define cut-free display calculi for knowledge logics where an indiscernibility relation is associ...
Abstract. We use a deep embedding of the display calculus for relation algebras ffiRA in the logical...
We apply the general results of Ciabattoni & Ramanayake about display calculi to atomic and molecula...
We describe a deep embedding of the display calculus ÆRA, for relation algebras, using Isabelle/HOL....
The aim of this paper is to introduce and explain display calculi for a variety of logics. We provid...
AbstractLogical frameworks are computer systems which allow a user to formalise mathematics using sp...
1 Introduction Sequent calculi provide a rigorous basis for meta-theoretic studies of logics. The ce...
What can (and what cannot) be expressed by structural display rules? Given a display calculus, we pr...
We introduce proper display calculi for basic monotonic modal logic, the conditional logic CK and a ...
A recent strand of research in structural proof theory aims at exploring the notion of analytic calc...
We formulate a unified display calculus proof theory for the four principal varieties of bunched log...
We use a deep embedding of the display calculus for relation algebras δRA in the logical framework I...
We introduce a proper multi-type display calculus for bilattice logic (with conflation) for which we...