We present a tableau calculus for some fundamental systems of propositional conditional logics. We consider the conditional logics that can be characterized by preferential semantics (i.e. possible world structures equipped with a family of preference relations). For these logics, we provide a uniform completeness proof of the axiomatization w.r.t. the semantics, and a uniform labelled tableau procedure.
Tableau Calculus for Preference-Based Conditional Logics: CE and Its Extensions
GLIOZZI, Valentina;
2009-01-01
Abstract
We present a tableau calculus for some fundamental systems of propositional conditional logics. We consider the conditional logics that can be characterized by preferential semantics (i.e. possible world structures equipped with a family of preference relations). For these logics, we provide a uniform completeness proof of the axiomatization w.r.t. the semantics, and a uniform labelled tableau procedure.
File in questo prodotto:
| File | Dimensione | Formato | |
|---|---|---|---|
|
TOCL_Conditionals2009.pdf
Accesso riservato
Tipo di file:
POSTPRINT (VERSIONE FINALE DELL’AUTORE)
Dimensione
1.4 MB
Formato
Adobe PDF
|
1.4 MB | Adobe PDF | Visualizza/Apri Richiedi una copia |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
