The following pages link to (Q4395559):
Displaying 10 items.
- Truth and definite truth (Q598266) (← links)
- Computational complexity of the semantics of some natural language constructions (Q598312) (← links)
- Partially ordered connectives and monadic monotone strict NP (Q1024818) (← links)
- IF-logic and truth-definition (Q1267079) (← links)
- Succinctness as a source of complexity in logical formalisms (Q1302307) (← links)
- Degrees of logics with Henkin quantifiers in poor vocabularies (Q1882566) (← links)
- Independence friendly logic with classical negation via flattening is a second-order logic with weak dependencies (Q2453581) (← links)
- Relative computability and uniform continuity of relations (Q2930869) (← links)
- Henkin quantifiers and the definability of truth (Q5928923) (← links)
- Alternating (in)dependence-friendly logic (Q6076360) (← links)
