Terminating hybrid tableaus for ordered models
Journal of Logic and Computation · 2026-04-29 · 36 (4)
DOI: 10.1093/logcom/exag024 ↗At a glance
Journal article in Journal of Logic and Computation, published online on 2026-06-08. Written by Yuki Nishimura. 18 references.
Abstract (original language)
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 some classes of models whose accessibility relations are strictly partially ordered, unbounded strictly partially ordered, partially ordered, strictly totally ordered and totally ordered.
Cite
APA
Nishimura, Y. (2026). Terminating hybrid tableaus for ordered models. Journal of Logic and Computation, 36(4). https://doi.org/10.1093/logcom/exag024
Vancouver
Nishimura Y. Terminating hybrid tableaus for ordered models. Journal of Logic and Computation. 2026;36(4). doi:10.1093/logcom/exag024
BibTeX
@article{Nishimura2026,
author = {Nishimura, Yuki},
title = {Terminating hybrid tableaus for ordered models},
journal = {Journal of Logic and Computation},
year = {2026},
volume = {36},
number = {4},
doi = {10.1093/logcom/exag024}
}
EUVIMED