Journal of Philosophical Logic 47 (2):325-363 (2018)
AbstractLogical geometry systematically studies Aristotelian diagrams, such as the classical square of oppositions and its extensions. These investigations rely heavily on the use of bitstrings, which are compact combinatorial representations of formulas that allow us to quickly determine their Aristotelian relations. However, because of their general nature, bitstrings can be applied to a wide variety of topics in philosophical logic beyond those of logical geometry. Hence, the main aim of this paper is to present a systematic technique for assigning bitstrings to arbitrary finite fragments of formulas in arbitrary logical systems, and to study the logical and combinatorial properties of this technique. It is based on the partition of logical space that is induced by a given fragment, and sheds new light on a number of interesting issues, such as the logic-dependence of the Aristotelian relations and the subtle interplay between the Aristotelian and Boolean structure of logical fragments. Finally, the bitstring technique also allows us to systematically analyze fragments from contemporary logical systems, such as public announcement logic, which could not be done before.
Similar books and articles
Logical Geometries and Information in the Square of Oppositions.Hans5 Smessaert & Lorenz6 Demey - 2014 - Journal of Logic, Language and Information 23 (4):527-565.
Metalogical Decorations of Logical Diagrams.Lorenz Demey & Hans Smessaert - 2016 - Logica Universalis 10 (2-3):233-292.
Formal systems of fuzzy logic and their fragments.Petr Cintula, Petr Hájek & Rostislav Horčík - 2007 - Annals of Pure and Applied Logic 150 (1-3):40-65.
Logical Consequence and Natural Language.Michael Glanzberg - 2015 - In Colin R. Caret & Ole T. Hjortland (eds.), Foundations of Logical Consequence. Oxford University Press. pp. 71-120.
The Theory of Form Logic.Wolfgang Freitag & Alexandra Zinke - 2012 - Logic and Logical Philosophy 21 (4):363-389.
Logical Consequence: Its nature, structure, and application.Colin R. Caret & Ole T. Hjortland - 2015 - In Colin R. Caret & Ole T. Hjortland (eds.), Foundations of Logical Consequence. Oxford University Press.
Structured theory presentations and logic representations.Robert Harper, Donald Sannella & Andrzej Tarlecki - 1994 - Annals of Pure and Applied Logic 67 (1-3):113-160.
Topological Aspects of Combinatorial Possibility.Thomas Mormann - 1997 - Logic and Logical Philosophy 5:75 - 92.
Peirce and the logical status of diagrams.Sun-joo Shin - 1994 - History and Philosophy of Logic 15 (1):45-68.
Logical Relations between Predicative Propositions in Aristotelian Logic.Davood Heydari - 2012 - Kheradnameh Sadra Quarterly 66.
Added to PP
Historical graph of downloads
Citations of this work
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.
Schopenhauer’s Partition Diagrams and Logical Geometry.Jens Lemanski & Lorenz Demey - 2021 - In A. Basu, G. Stapleton, S. Linker, C. Legg, E. Manalo & P. Viana (eds.), Diagrams 2021: Diagrammatic Representation and Inference. 93413 Cham, Deutschland: pp. 149-165.
Logic Diagrams, Sacred Geometry and Neural Networks.Jens Lemanski - 2019 - Logica Universalis 13 (4):495-513.
References found in this work
A Natural History of Negation.Jon Barwise & Laurence R. Horn - 1991 - Journal of Symbolic Logic 56 (3):1103.
Universal moral grammar: Theory, evidence, and the future.John Mikhail - 1912 - Trends in Cognitive Sciences 11 (4):143 –152.