Unified correspondence as a proof-theoretic tool
The present article aims at establishing formal connections between correspondence
phenomena, well known from the area of modal logic, and the theory of display calculi …
phenomena, well known from the area of modal logic, and the theory of display calculi …
[HTML][HTML] Algorithmic correspondence and canonicity for non-distributive logics
W Conradie, A Palmigiano - Annals of Pure and Applied Logic, 2019 - Elsevier
We extend the theory of unified correspondence to a broad class of logics with algebraic
semantics given by varieties of normal lattice expansions (LEs), also known as 'lattices with …
semantics given by varieties of normal lattice expansions (LEs), also known as 'lattices with …
Multi-type sequent calculi
Display calculi are generalized sequent calculi which enjoy acanonical'cut elimination
strategy. That is, their cut elimination is uniformly obtained by verifying the assumptions of a …
strategy. That is, their cut elimination is uniformly obtained by verifying the assumptions of a …
Multi-type display calculus for dynamic epistemic logic
In the present article, we introduce a multi-type display calculus for dynamic epistemic logic,
which we refer to as Dynamic Calculus. The display approach is suitable to modularly chart …
which we refer to as Dynamic Calculus. The display approach is suitable to modularly chart …
Toward an epistemic-logical theory of categorization
Categorization systems are widely studied in psychology, sociology, and organization theory
as information-structuring devices which are critical to decision-making processes. In the …
as information-structuring devices which are critical to decision-making processes. In the …
A multi-type calculus for inquisitive logic
In this paper, we define a multi-type calculus for inquisitive logic, which is sound, complete
and enjoys Belnap-style cut-elimination and subformula property. Inquisitive logic is the …
and enjoys Belnap-style cut-elimination and subformula property. Inquisitive logic is the …
A proof-theoretic semantic analysis of dynamic epistemic logic
The present article provides an analysis of the existing proof systems for dynamic epistemic
logic from the viewpoint of proof-theoretic semantics. Dynamic epistemic logic is one of the …
logic from the viewpoint of proof-theoretic semantics. Dynamic epistemic logic is one of the …
The logic of resources and capabilities
We introduce the logic LRC, designed to describe and reason about agents' abilities and
capabilities in using resources. The proposed framework bridges two—up to now—mutually …
capabilities in using resources. The proposed framework bridges two—up to now—mutually …
Syntactic completeness of proper display calculi
J Chen, G Greco, A Palmigiano… - ACM Transactions on …, 2022 - dl.acm.org
A recent strand of research in structural proof theory aims at exploring the notion of analytic
calculi (ie, those calculi that support general and modular proof-strategies for cut …
calculi (ie, those calculi that support general and modular proof-strategies for cut …
Completeness for game logic
S Enqvist, HH Hansen, C Kupke… - 2019 34th annual …, 2019 - ieeexplore.ieee.org
Game logic was introduced by Rohit Parikh in the 1980s as a generalisation of propositional
dynamic logic (PDL) for reasoning about outcomes that players can force in determined 2 …
dynamic logic (PDL) for reasoning about outcomes that players can force in determined 2 …