Dyadic obligations: proofs and countermodels via hypersequents
Fuente:
arXiv
Salvato in:
| Autori principali: | , , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2024
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866910485413101568 |
|---|---|
| author | Ciabattoni, Agata Oliveti, Nicola Parent, Xavier |
| author_facet | Ciabattoni, Agata Oliveti, Nicola Parent, Xavier |
| contents | The basic system E of dyadic deontic logic proposed by Åqvist offers a simple solution to contrary-to-duty paradoxes and allows to represent norms with exceptions. We investigate E from a proof-theoretical viewpoint. We propose a hypersequent calculus with good properties, the most important of which is cut-elimination, and the consequent subformula property. The calculus is refined to obtain a decision procedure for E and an effective countermodel computation in case of failure of proof search. Using the refined calculus, we prove that validity in E is Co-NP and countermodels have polynomial size. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2406_09088 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Dyadic obligations: proofs and countermodels via hypersequents Ciabattoni, Agata Oliveti, Nicola Parent, Xavier Logic in Computer Science The basic system E of dyadic deontic logic proposed by Åqvist offers a simple solution to contrary-to-duty paradoxes and allows to represent norms with exceptions. We investigate E from a proof-theoretical viewpoint. We propose a hypersequent calculus with good properties, the most important of which is cut-elimination, and the consequent subformula property. The calculus is refined to obtain a decision procedure for E and an effective countermodel computation in case of failure of proof search. Using the refined calculus, we prove that validity in E is Co-NP and countermodels have polynomial size. |
| title | Dyadic obligations: proofs and countermodels via hypersequents |
| topic | Logic in Computer Science |
| url | https://arxiv.org/abs/2406.09088 |