Pages that link to "Item:Q6047662"
From MaRDI portal
The following pages link to On the completeness and the decidability of strictly monadic second‐order logic (Q6047662):
Displaying 7 items.
- Simple proof of the completeness theorem for second-order classical and intuitionistic logic by reduction to first-order mono-sorted logic (Q1884882) (← links)
- Computability by monadic second-order logic (Q2656341) (← links)
- (Q2939010) (← links)
- SAT in Monadic Gödel Logics: A Borderline between Decidability and Undecidability (Q3638278) (← links)
- On the existence of a modal-logical basis for monadic second-order logic (Q4914416) (← links)
- Directed Nowhere Dense Classes of Graphs (Q5417630) (← links)
- On the expressive completeness of the propositional mu-calculus with respect to monadic second order logic (Q6104378) (← links)