Pages that link to "Item:Q5387294"
From MaRDI portal
The following pages link to On the Computational Complexity of the Numerically Definite Syllogistic and Related Logics (Q5387294):
Displaying 9 items.
- One-variable logic meets Presburger arithmetic (Q2007734) (← links)
- A system of relational syllogistic incorporating full Boolean reasoning (Q2255203) (← links)
- Easy solutions for a hard problem? The computational complexity of reciprocals with quantificational antecedents (Q2255227) (← links)
- The syllogistic with unity (Q2377188) (← links)
- Quantitative Logic Reasoning (Q3305344) (← links)
- Fuzzy Syllogisms, Numerical Square, Triangle of Contraries, Inter-bivalence (Q4915589) (← links)
- Completing the Picture: Complexity of Graded Modal Logics with Converse (Q6063859) (← links)
- A novel algorithmic construction for deductions of categorical polysyllogisms by Carroll's diagrams (Q6089954) (← links)
- INTERLEAVING LOGIC AND COUNTING (Q6199174) (← links)
