On the Completeness of Spider Diagrams Augmented with Constants

DOI10.1007/978-3-0348-0600-8_7zbMath1401.03031OpenAlexW2112911839MaRDI QIDQ2948608

Gem Stapleton, John Taylor, Peter Chapman, Simon Thompson, John Howse

Publication date: 6 October 2015

Published in: Visual Reasoning with Diagrams (Search for Journal in Brave)

Full work available at URL: https://kar.kent.ac.uk/42317/1/paper.pdf

zbMATH Keywords

constantscompletenessdiagrammatic reasoningsoundnessmonadic first-order logicspider diagrams

Mathematics Subject Classification ID

Other nonclassical logic (03B60) Decidability of theories and sets of sentences (03B25) Subsystems of classical logic (including intuitionistic logic) (03B20)

Related Items (4)

Singular propositions, negation and the square of opposition ⋮ The semiotics of spider diagrams ⋮ Presence and absence of individuals in diagrammatic logics: an empirical comparison ⋮ Heterogeneous Proofs: Spider Diagrams Meet Higher-Order Provers

Cites Work

• Unnamed Item
• Unnamed Item
• Automated theorem proving in Euler diagram systems
• The Expressiveness of Spider Diagrams
• Spider Diagrams
• Diagrammatic Representation and Inference
• Diagrammatic Representation and Inference
• Diagrammatic Representation and Inference
• Graph Drawing

This page was built for publication: On the Completeness of Spider Diagrams Augmented with Constants