Pages that link to "Item:Q3371150"
From MaRDI portal
The following pages link to Aristotelian Syntax from a Computational–Combinatorial Point of View (Q3371150):
Displaying 7 items.
- A deductive database on Aristotelian logic (Q1123023) (← links)
- A syntactic view of computational adequacy (Q1652968) (← links)
- Pāṇini's Grammar and Modern Computation (Q2963983) (← links)
- AN INTENSIONAL LEIBNIZ SEMANTICS FOR ARISTOTELIAN LOGIC (Q3577745) (← links)
- Computing the maximal Boolean complexity of families of Aristotelian diagrams (Q4612443) (← links)
- Aristotelian Logic Axioms in Propositional Logic: The Pouch Method (Q5208111) (← links)
- A novel algorithmic construction for deductions of categorical polysyllogisms by Carroll's diagrams (Q6089954) (← links)