Classical higher-order logic, when utilized as a meta-logic in which various other (classical
and non-classical) logics can be shallowly embedded, is suitable as a foundation for the …

The advent of Kripke semantics marked a decisive turning point for philosophical logic:
earlier axiomatic studies of modal concepts were replaced by a solid semantic method that …

We present new sequent calculi for Lewis' logics of counterfactuals. The calculi are based
on Lewis' connective of comparative plausibility and modularly capture almost all logics of …

The basic preferential conditional logic PCL, initially proposed by Burgess, finds an interest
in the formalisation of both counterfactual and plausible reasoning, since it is at the same …

We present unlabelled cut-free sequent calculi for Lewis' conditional logic \mathbbV and
extensions, in both the languages with the entrenchment connective and the strong …

A semantic embedding of quantified conditional logic in classical higher-order logic is
utilized for reducing cut-elimination in the former logic to existing results for the latter logic …

We introduce proper display calculi for basic monotonic modal logic, the conditional logic
CK and a number of their axiomatic extensions. These calculi are sound, complete …

We give two generic proofs for cut elimination in propositional modal logics, interpreted over
coalgebras. We first investigate semantic coherence conditions between the axiomatisation …

We consider cut-free sequent calculi for a number of deontic logics from the family of
Input/Output logics. These sequent calculi provide a correspondence to the flat fragment of …

Nested sequent calculi are a useful generalization of ordinary sequent calculi, where
sequents are allowed to occur within sequents. Nested sequent calculi have been profitably …