Terminating Hybrid Tableaus for Ordered Models
Logic
2026-03-17 v2 Logic in Computer Science
Abstract
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.
Cite
@article{arxiv.2502.20751,
title = {Terminating Hybrid Tableaus for Ordered Models},
author = {Yuki Nishimura},
journal= {arXiv preprint arXiv:2502.20751},
year = {2026}
}
Comments
29 pages, 8 figures