Terminating Hybrid Tableaus for Ordered Models
Fuente:
arXiv
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2025
|
| Schlagworte: | |
| Online-Zugang: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866914394207682560 |
|---|---|
| author | Nishimura, Yuki |
| author_facet | Nishimura, Yuki |
| contents | Hybrid logic extends modal logic with special propositions called nominals, each of which is true at only one state in a model. This enables us to describe some properties of binary relations, such as irreflexivity and anti-symmetry, which are essential to treat partial orders. We present terminating tableau calculi complete with respect to models whose accessibility relations are strictly partially ordered, unbounded strictly partially ordered, and partially ordered. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2502_20751 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Terminating Hybrid Tableaus for Ordered Models Nishimura, Yuki Logic Logic in Computer Science Hybrid logic extends modal logic with special propositions called nominals, each of which is true at only one state in a model. This enables us to describe some properties of binary relations, such as irreflexivity and anti-symmetry, which are essential to treat partial orders. We present terminating tableau calculi complete with respect to models whose accessibility relations are strictly partially ordered, unbounded strictly partially ordered, and partially ordered. |
| title | Terminating Hybrid Tableaus for Ordered Models |
| topic | Logic Logic in Computer Science |
| url | https://arxiv.org/abs/2502.20751 |