Switch to: References

Add citations

You must login to add citations.
  1. A Bitstring Semantics for Calculus CL.Fabien Schang & Jens Lemanski - 2022 - In Jean-Yves Beziau & Ioannis Vandoulakis (eds.), The Exoteric Square of Opposition. Birkhauser. pp. 171–193.
    The aim of this chapter is to develop a semantics for Calculus CL. CL is a diagrammatic calculus based on a logic machine presented by Johann Christian Lange in 1714, which combines features of Euler-, Venn-type, tree diagrams, squares of oppositions etc. In this chapter, it is argued that a Boolean account of formal ontology in CL helps to deal with logical oppositions and inferences of extended syllogistics. The result is a combination of Lange’s diagrams with an algebraic semantics of (...)
    Direct download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Extended Syllogistics in Calculus CL.Jens Lemanski - 2020 - Journal of Applied Logics 8 (2):557-577.
    Extensions of traditional syllogistics have been increasingly researched in philosophy, linguistics, and areas such as artificial intelligence and computer science in recent decades. This is mainly due to the fact that syllogistics is seen as a logic that comes very close to natural language abilities. Various forms of extended syllogistics have become established. This paper deals with the question to what extent a syllogistic representation in CL diagrams can be seen as a form of extended syllogistics. It will be shown (...)
    Direct download  
     
    Export citation  
     
    Bookmark   3 citations  
  • Calculus CL as a Formal System.Jens Lemanski & Ludger Jansen - 2020 - In Ahti Veikko Pietarinen, Peter Chapman, Leonie Bosveld-de Smet, Valeria Giardino, James Corter & Sven Linker (eds.), Diagrammatic Representation and Inference. Diagrams 2020. Lecture Notes in Computer Science, vol 12169. 2020. 93413 Cham, Deutschland: pp. 445-460.
    In recent years CL diagrams inspired by Lange’s Cubus Logicus have been used in various contexts of diagrammatic reasoning. However, whether CL diagrams can also be used as a formal system seemed questionable. We present a CL diagram as a formal system, which is a fragment of propositional logic. Syntax and semantics are presented separately and a variant of bitstring semantics is applied to prove soundness and completeness of the system.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   4 citations