Pages that link to "Item:Q5112647"
From MaRDI portal
The following pages link to Recursive enumerability and elementary frame definability in predicate modal logic (Q5112647):
Displaying 4 items.
- Complexity of finite-variable fragments of propositional temporal and modal logics of computation (Q2148903) (← links)
- Undecidability of QLTL and QCTL with two variables and one monadic predicate letter (Q5059700) (← links)
- A recursively enumerable Kripke complete first-order logic not complete with respect to a first-order definable class of frames (Q5224585) (← links)
- Recursive logic frames (Q5469107) (← links)