DeepAI AI Chat
Log In Sign Up

Uniform labelled calculi for preferential conditional logics based on neighbourhood semantics

02/14/2020
by   Marianna Girlando, et al.
0

The preferential conditional logic PCL, introduced by Burgess, and its extensions are studied. First, a natural semantics based on neighbourhood models, which generalise Lewis' sphere models for counterfactual logics, is proposed. Soundness and completeness of PCL and its extensions with respect to this class of models are proved directly. Labelled sequent calculi for all logics of the family are then introduced. The calculi are modular and have standard proof-theoretical properties, the most important of which is admissibility of cut, that entails a syntactic proof of completeness of the calculi. By adopting a general strategy, root-first proof search terminates, thereby providing a decision procedure for PCL and its extensions. Finally, the semantic completeness of the calculi is established: from a finite branch in a failed proof attempt it is possible to extract a finite countermodel of the root sequent. The latter result gives a constructive proof of the finite model property of all the logics considered.

READ FULL TEXT

page 1

page 2

page 3

page 4

06/09/2020

Hypersequent calculi for non-normal modal and deontic logics: Countermodels and optimal complexity

We present some hypersequent calculi for all systems of the classical cu...
10/19/2022

Comparative plausibility in neighbourhood models: axiom systems and sequent calculi

We introduce a family of comparative plausibility logics over neighbourh...
10/30/2017

Modular Labelled Sequent Calculi for Abstract Separation Logics

Abstract separation logics are a family of extensions of Hoare logic for...
07/13/2021

Injecting Finiteness to Prove Completeness for Finite Linear Temporal Logic

Temporal logics over finite traces are not the same as temporal logics o...
08/29/2019

Automating Agential Reasoning: Proof-Calculi and Syntactic Decidability for STIT Logics

This work provides proof-search algorithms and automated counter-model e...
07/30/2021

Refining Labelled Systems for Modal and Constructive Logics with Applications

This thesis introduces the "method of structural refinement", which serv...
08/28/1998

Set-Theoretic Completeness for Epistemic and Conditional Logic

The standard approach to logic in the literature in philosophy and mathe...