DeepAI AI Chat
Log In Sign Up

A tableau methodology for deontic conditional logics

by   Alberto Artosi, et al.

In this paper we present a theorem proving methodology for a restricted but significant fragment of the conditional language made up of (boolean combinations of) conditional statements with unnested antecedents. The method is based on the possible world semantics for conditional logics. The KEM label formalism, designed to account for the semantics of normal modal logics, is easily adapted to the semantics of conditional logics by simply indexing labels with formulas. The inference rules are provided by the propositional system KE+ - a tableau-like analytic proof system devised to be used both as a refutation and a direct method of proof - enlarged with suitable elimination rules for the conditional connective. The theorem proving methodology we are going to present can be viewed as a first step towards developing an appropriate algorithmic framework for several conditional logics for (defeasible) conditional obligation.


page 1

page 2

page 3

page 4


Normalisation for Some Infectious Logics and Their Relatives

We consider certain infectious logics (Sfde, dSfde, K3w, and PWK) and se...

Formalizing the Curry-Howard Correspondence

The Curry-Howard Correspondence has a long history, and still is a topic...

Modal Logics for Qualitative Possibility and Beliefs

Possibilistic logic has been proposed as a numerical formalism for reaso...

Uniform Lyndon Interpolation for Basic Non-normal Modal and Conditional Logics

In this paper, a proof-theoretic method to prove uniform Lyndon interpol...

Non-Normal Super-Strict Implications

This paper introduces the logics of super-strict implications that are b...

On Trivalent Logics, Compound Conditionals, and Probabilistic Deduction Theorems

In this paper we recall some results for conditional events, compound co...