DeepAI AI Chat
Log In Sign Up

Algorithmic properties of first-order modal logics of linear Kripke frames in restricted languages

by   Mikhail Rybakov, et al.

We study the algorithmic properties of first-order monomodal logics of frames ⟨ℕ, ≤⟩, ⟨ℕ, < ⟩, ⟨ℚ, ≤⟩, ⟨ℚ, < ⟩, ⟨ℝ, ≤⟩, ⟨ℝ, < ⟩, as well as some related logics, in languages with restrictions on the number of individual variables as well as the number and arity of predicate letters. We show that the logics of frames based on ℕ are Π^1_1-hard – thus, not recursively enumerable – in languages with two individual variables, one monadic predicate letter and one proposition letter. We also show that the logics of frames based on ℚ and ℝ are Σ^0_1-hard in languages with the same restrictions. Similar results are obtained for a number of related logics.


page 1

page 2

page 3

page 4


Algorithmic properties of QK4.3 and QS4.3

We prove that predicate modal logics QK4.3 and QS4.3 are undecidable in ...

Elementary Multimodal Logics

We study multimodal logics over universally first-order definable classe...

Logics for Reversible Regular Languages and Semigroups with Involution

We present MSO and FO logics with predicates `between' and `neighbour' t...

On Transitive modal many-valued logics

This paper is focused on the study of modal logics defined from valued K...

Canonicity in power and modal logics of finite achronal width

We develop a method for showing that various modal logics that are valid...

Routley Star in Information-Based Semantics

It is common in various non-classical logics, especially in relevant log...

Robust, Expressive, and Quantitative Linear Temporal Logics: Pick any Two for Free

Linear Temporal Logic (LTL) is the standard specification language for r...