A Decidable Bundled Fragment of First-Order Modal Logic Without Finite Model Property
Fuente:
arXiv
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866918042874675200 |
|---|---|
| author | Joshi, Varad Padmanabha, Anantha |
| author_facet | Joshi, Varad Padmanabha, Anantha |
| contents | The satisfiability problem for First-order Modal Logic (\FOML) is undecidable even for simple fragments like having only unary predicates, two variables etc. Recently a new way to identify decidable fragments of \FOML has been introduced called the "bundled fragments", where the quantifiers and modalities are restricted to appear together. Since there are many ways to bundle the quantifiers together, some of them lead to (un)decidable fragments. In (Liu et.al, 2023) the authors prove a `trichotomy', where they show that every bundled fragment falls into one of the following three categories: (1) Those that satisfy "finite model property" (and hence decidable), (2) Those that are undecidable, and (3) Those that do not satisfy "finite model property" (whose decidability is left open).
In this paper we collapse the trichotomy into a dichotomy over "increasing domain models" by proving that the one combination that falls into the last category is indeed decidable. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2506_01421 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | A Decidable Bundled Fragment of First-Order Modal Logic Without Finite Model Property Joshi, Varad Padmanabha, Anantha Logic in Computer Science The satisfiability problem for First-order Modal Logic (\FOML) is undecidable even for simple fragments like having only unary predicates, two variables etc. Recently a new way to identify decidable fragments of \FOML has been introduced called the "bundled fragments", where the quantifiers and modalities are restricted to appear together. Since there are many ways to bundle the quantifiers together, some of them lead to (un)decidable fragments. In (Liu et.al, 2023) the authors prove a `trichotomy', where they show that every bundled fragment falls into one of the following three categories: (1) Those that satisfy "finite model property" (and hence decidable), (2) Those that are undecidable, and (3) Those that do not satisfy "finite model property" (whose decidability is left open). In this paper we collapse the trichotomy into a dichotomy over "increasing domain models" by proving that the one combination that falls into the last category is indeed decidable. |
| title | A Decidable Bundled Fragment of First-Order Modal Logic Without Finite Model Property |
| topic | Logic in Computer Science |
| url | https://arxiv.org/abs/2506.01421 |