Syllogisms in rudimentary linear logic, diagrammatically
From MaRDI portal
Publication:2255209
Abstract: We present a reading of the traditional syllogistics in a fragment of the propositional intuitionistic multiplicative linear logic and prove that with respect to a diagrammatic logical calculus that we introduced in a previous paper, a syllogism is provable in such a fragment if and only if it is diagrammatically provable. We extend this result to syllogistics with complemented terms `a la De Morgan, with respect to a suitable extension of the diagrammatic reasoning system for the traditional case and a corresponding reading of such De Morgan style syllogistics in the previously referred to fragment of linear logic.
Recommendations
Cites work
- scientific article; zbMATH DE number 1670606 (Why is no real title available?)
- scientific article; zbMATH DE number 3852463 (Why is no real title available?)
- scientific article; zbMATH DE number 4055576 (Why is no real title available?)
- scientific article; zbMATH DE number 1237648 (Why is no real title available?)
- scientific article; zbMATH DE number 1773524 (Why is no real title available?)
- scientific article; zbMATH DE number 1787156 (Why is no real title available?)
- scientific article; zbMATH DE number 2086746 (Why is no real title available?)
- scientific article; zbMATH DE number 3797703 (Why is no real title available?)
- scientific article; zbMATH DE number 3448519 (Why is no real title available?)
- scientific article; zbMATH DE number 786485 (Why is no real title available?)
- scientific article; zbMATH DE number 794693 (Why is no real title available?)
- scientific article; zbMATH DE number 918108 (Why is no real title available?)
- scientific article; zbMATH DE number 3066797 (Why is no real title available?)
- A Decidable Constraint Diagram Reasoning System
- A diagrammatic calculus of syllogisms
- A diagrammatic inference system with Euler circles
- A diagrammatic treatment of syllogistic
- A survey of reasoning systems based on Euler diagrams
- An algebraic correctness criterion for intuitionistic multiplicative proof-nets
- Automated theorem proving with spider diagrams
- Bounded linear logic: A modular approach to polynomial-time computability
- Completeness of an ancient logic
- Diagrammatic Representation and Inference
- Euler’s visual logic
- Heterogeneous reasoning with Euler/Venn diagrams containing named constants and FOL
- Linear diagrams for syllogisms (with relationals)
- On the insufficiency of linear diagrams for syllogisms
- Reasoning with sentences and diagrams
- Spider Diagrams
- The Advent of Formal Diagrammatic Reasoning Systems
- The Expressiveness of Spider Diagrams
- The structure of multiplicatives
- The structure of valid \(n\)-term syllogisms
- Towards a model theory of diagrams
- What is a syllogism?
Cited in
(6)- On the insufficiency of linear diagrams for syllogisms
- The Indemonstrables of Chrysippus of Soli in Marlo Logical Diagrams. Could Propositional Calculus Be Nothing but Syllogisms?
- Ologisms
- A new algorithmic decision for categorical syllogisms via Carroll's diagrams
- A Diagrammatic Calculus of Syllogisms
- Proclus and the Neoplatonic syllogistic
This page was built for publication: Syllogisms in rudimentary linear logic, diagrammatically
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2255209)