Pages that link to "Item:Q1882566"
From MaRDI portal
The following pages link to Degrees of logics with Henkin quantifiers in poor vocabularies (Q1882566):
Displaying 4 items.
- Computational complexity of the semantics of some natural language constructions (Q598312) (← links)
- Decidability problems in languages with Henkin quantifiers (Q1198829) (← links)
- Variable compactness in 1-order logic (Q4255974) (← links)
- One Henkin Quantifier in the Empty Vocabulary Suffices for Undecidability (Q5377341) (← links)