Logical 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. (shrink)

The aim of this paper is to initiate a systematic exploration of the model theory of epistemic plausibility models (EPMs). There are two subtly different definitions in the literature: one by van Benthem and one by Baltag and Smets. Because van Benthem's notion is the most general, most of the paper is dedicated to this notion. We focus on the notion of bisimulation, and show that the most natural generalization of bisimulation to van Benthem-type EPMs fails. We then introduce parametrized (...) bisimulations, and prove various bisimulationimplies- equivalence theorems, a Hennessy-Milner theorem, and several (un)definability results. We discuss the problems arising from the fact that these bisimulations are syntax-dependent (and thus not fully structural), and we present and compare two different ways of coping with this issue: adding a modality to the language, and putting extra constraints on the models. We argue that the most successful solution involves restricting to uniform and locally connected (van Benthem-type) EPMs: for this subclass the intuitively most natural notion of bisimulation and the technically sound notion coincide. Such EPMs turn out to correspond exactly with Baltag/Smets-type EPMs, which can be interpreted as constituting a methodological argument, favoring Baltag and Smets's definition of EPM over that of van Benthem. (shrink)

The Aristotelian square of oppositions is a well-known diagram in logic and linguistics. In recent years, several extensions of the square have been discovered. However, these extensions have failed to become as widely known as the square. In this paper we argue that there is indeed a fundamental difference between the square and its extensions, viz., a difference in informativity. To do this, we distinguish between concrete Aristotelian diagrams and, on a more abstract level, the Aristotelian geometry. We then introduce (...) two new logical geometries, and develop a formal, well-motivated account of their informativity. This enables us to show that the square is strictly more informative than many of the more complex diagrams. (shrink)

In logical geometry, Aristotelian diagrams are studied in a precise and systematic way. Although there has recently been a good amount of progress in logical geometry, it is still unknown which underlying mathematical framework is best suited for formalizing the study of these diagrams. Hence, in this paper, the main aim is to formulate such a framework, using the powerful language of category theory. We build multiple categories, which all have Aristotelian diagrams as their objects, while having different kinds of (...) morphisms between these diagrams. The categories developed here are assessed according to their ability to generalize previous work from logical geometry as well as their interesting category-theoretical properties. According to these evaluations, the most promising category has as its morphisms those functions on fragments that increase in informativity on both the opposition and implication relations. Focusing on this category can significantly increase the effectiveness of further research in logical geometry. (shrink)

In recent years, a number of authors have started studying Aristotelian diagrams containing metalogical notions, such as tautology, contradiction, satisfiability, contingency, strong and weak interpretations of contrariety, etc. The present paper is a contribution to this line of research, and its main aims are both to extend and to deepen our understanding of metalogical diagrams. As for extensions, we not only study several metalogical decorations of larger and less widely known Aristotelian diagrams, but also consider metalogical decorations of another type (...) of logical diagrams, viz. duality diagrams. At a more fundamental level, we present a unifying perspective which sheds new light on the connections between new and existing metalogical diagrams, as well as between object- and metalogical diagrams. Overall, the paper studies two types of logical diagrams and four kinds of metalogical decorations. (shrink)

This paper studies the Lockean thesis from the perspective of contemporary epistemic logic. The Lockean thesis states that belief can be defined as ‘sufficiently high degree of belief’. Its main problem is that it gives rise to a notion of belief which is not closed under conjunction. This problem is typical for classical epistemic logic: it is single-agent and static. I argue that from the perspective of contemporary epistemic logic, the Lockean thesis fares much better. I briefly mention that it (...) can successfully be extended from single-agent to multi-agent settings. More importantly, I show that accepting the Lockean thesis (and a more sophisticated version for conditional beliefs) leads to a significant and unexpected unification in the dynamic behavior of (conditional) belief and high (conditional) probability with respect to public announcements. This constitutes a methodological argument in favor of the Lockean thesis. Furthermore, if one accepts Baltag’s Erlangen program for epistemology, this technical observation has even stronger philosophical implications: because belief and high probability display the same dynamic behavior, it is plausible that they are indeed one and the same epistemic notion. (shrink)

This paper explores the interplay between logic-sensitivity and bitstring semantics in the square of opposition. Bitstring semantics is a combinatorial technique for representing the formulas that appear in a logical diagram, while logic-sensitivity entails that such a diagram may depend, not only on the formulas involved, but also on the logic with respect to which they are interpreted. These two topics have already been studied extensively in logical geometry, and are thus well-understood by themselves. However, the precise details of their (...) interplay turn out to be far more complicated. In particular, the paper describes an elegant and natural interaction between bitstrings and logic-sensitivity, which makes perfect sense when bitstrings are viewed as purely combinatorial entities. However, when we view bitstrings as semantically meaningful entities (which is actually the standard perspective, cf. the term ‘bitstring semantics’!), this interaction does not seem to have a full and equally natural counterpart. The paper describes some attempts to address this situation, but all of them are ultimately found wanting. For now, it thus remains an open problem to capture this interaction between bitstrings and logic-sensitivity from a semantic (rather than merely a combinatorial) perspective. (shrink)

The paper examines Schopenhauer’s complex diagrams from the Berlin Lectures of the 1820 s, which show certain partitions of classes. Drawing upon ideas and techniques from logical geometry, we show that Schopenhauer’s partition diagrams systematically give rise to a special type of Aristotelian diagrams, viz. (strong) α -structures.

This paper studies John Buridan's octagons of opposition for the de re modal propositions and the propositions of unusual construction. Both Buridan himself and the secondary literature have emphasized the strong similarities between these two octagons (as well as a third one, for propositions with oblique terms). In this paper, I argue that the interconnection between both octagons is more subtle than has previously been thought: if we move beyond the Aristotelian relations, and also take Boolean considerations into account, then (...) the strong analogy between Buridan's octagons starts to break down. These differences in Boolean structure can already be discerned within the octagons themselves; on a more abstract level, they lead to these two octagons having different degrees of Boolean complexity (i.e. Boolean closures of different sizes). These results are obtained by means of bitstring analysis, which is one of the key tools from contemporary logical geometry. Finally, I argue that this historical investigation is directly relevant for the theoretical framework of logical geometry, and discuss how it helps us to address certain open questions in this framework. (shrink)

© Springer International Publishing Switzerland 2016. We develop a systematic approach for dealing with informationally equivalent Aristotelian diagrams, based on the interaction between the logical properties of the visualized information and the geometrical properties of the concrete polygon/polyhedron. To illustrate the account’s fruitfulness, we apply it to all Aristotelian families of 4-formula fragments that are closed under negation and to all Aristotelian families of 6-formula fragments that are closed under negation.

© The Author 2018. Published by Oxford University Press. All rights reserved. Logical geometry provides a broad framework for systematically studying the logical properties of Aristotelian diagrams. The main aim of this paper is to present and illustrate the foundations of a computational approach to logical geometry. In particular, after briefly discussing some key notions from logical geometry, I describe a logical problem concerning Aristotelian diagrams that is of considerable theoretical importance, viz. the task of finding the maximal Boolean complexity (...) of a given family of Aristotelian diagrams, and I then present and discuss a simple algorithm for automatically solving this task. This algorithm is naturally implemented within the paradigm of logic programming. In order to illustrate the theoretical fruitfulness of this algorithm, I also show how it sheds new light on several well-known families of Aristotelian diagrams. (shrink)

The paper examines Schopenhauer’s complex diagrams from the Berlin Lectures of the 1820 s, which show certain partitions of classes. Drawing upon ideas and techniques from logical geometry, we show that Schopenhauer’s partition diagrams systematically give rise to a special type of Aristotelian diagrams, viz. (strong) α -structures.

This paper studies the logical context-sensitivity of Aristotelian diagrams. I propose a new account of measuring this type of context-sensitivity, and illustrate it by means of a small-scale example. Next, I turn toward a more large-scale case study, based on Aristotelian diagrams for the categorical statements with subject negation. On the practical side, I describe an interactive application that can help to explain and illustrate the phenomenon of context-sensitivity in this particular case study. On the theoretical side, I show that (...) applying the proposed measure of context-sensitivity leads to a number of precise yet highly intuitive results. (shrink)

This paper studies Aumann’s agreeing to disagree theorem from the perspective of dynamic epistemic logic. This was first done by Dégremont and Roy (J Phil Log 41:735–764, 2012) in the qualitative framework of plausibility models. The current paper uses a probabilistic framework, and thus stays closer to Aumann’s original formulation. The paper first introduces enriched probabilistic Kripke frames and models, and various ways of updating them. This framework is then used to prove several agreement theorems, which are natural formalizations of (...) Aumann’s original result. Furthermore, a sound and complete axiomatization of a dynamic agreement logic is provided, in which one of these agreement theorems can be derived syntactically. These technical results are used to show the importance of explicitly representing the dynamics behind the agreement theorem, and lead to a clarification of some conceptual issues surrounding the agreement theorem, in particular concerning the role of common knowledge. The formalization of the agreement theorem thus constitutes a concrete example of the so-called dynamic turn in logic. (shrink)

Duality in Logic and Language [draft--do not cite this article] Duality phenomena occur in nearly all mathematically formalized disciplines, such as algebra, geometry, logic and natural language semantics. However, many of these disciplines use the term ‘duality’ in vastly different senses, and while some of these senses are intimately connected to each other, others seem to be entirely … Continue reading Duality in Logic and Language →.

In the recent debate on future contingents and the nature of the future, authors such as G. A. Boyd, W. L. Craig, and E. Hess have made use of various logical notions, such as the Aristotelian relations of contradiction and contrariety, and the ‘open future square of opposition.’ My aim in this paper is not to enter into this philosophical debate itself, but rather to highlight, at a more abstract methodological level, the important role that Aristotelian diagrams can play in (...) organizing and clarifying the debate. After providing a brief survey of the specific ways in which Boyd and Hess make use of Aristotelian relations and diagrams in the debate on the nature of the future, I argue that the position of open theism is best represented by means of a hexagon of opposition. Next, I show that on the classical theist account, this hexagon of opposition ‘collapses’ into a single pair of contradictory statements. This collapse from a hexagon into a pair has several aspects, which can all be seen as different manifestations of a single underlying change. (shrink)

This article describes a specific pedagogical context for an advanced logic course and presents a strategy that might facilitate students’ transition from the object-theoretical to the metatheoretical perspective on logic. The pedagogical context consists of philosophy students who in general have had little training in logic, except for a thorough introduction to syllogistics. The teaching strategy tries to exploit this knowledge of syllogistics, by emphasizing the analogies between ideas from metalogic and ideas from syllogistics, such as existential import, the distinction (...) between contradictories and contraries, and the square of opposition. This strategy helps to improve students’ understanding of metalogic, because it allows the students to integrate these new ideas with their previously acquired knowledge of syllogistics. (shrink)

In this paper we provide an analysis of the logical relations within the conceptual or lexical field of angles in 2D geometry. The basic tripartition into acute/right/obtuse angles is extended in two steps: first zero and straight angles are added, and secondly reflex and full angles are added, in both cases extending the logical space of angles. Within the framework of logical geometry, the resulting partitions of these logical spaces yield bitstring semantics of increasing complexity. These bitstring analyses allow a (...) straightforward account of the Aristotelian relations between angular concepts. In addition, also relational concepts such as complementary and supplementary angles receive a natural bitstring analysis. (shrink)

Burgess-Jackson has recently suggested that the debate between theism and atheism can be represented by means of a classical square of opposition. However, in light of the important role that the position of agnosticism plays in Burgess-Jackson’s analysis, it is quite surprising that this position is not represented in the proposed square of opposition. I therefore argue that the square of opposition should be extended to a slightly larger, more complex Aristotelian diagram, viz., a hexagon of opposition. Since this hexagon (...) does represent the position of agnosticism, it arguably yields a more helpful representation of the theism/atheism debate. It would be naïve to presume that Aristotelian diagrams can, by themselves, lead to a comprehensive solution of debates as intricate as that between theism and atheism. Nevertheless, this paper aims to show that these diagrams — especially if they are chosen carefully — have an important methodological role to play, by systematically organizing and clarifying the debate. (shrink)

In logic, Aristotelian diagrams are almost always assumed to be closed under negation, and are thus highly symmetric in nature. In linguistics, by contrast, these diagrams are used to study lexicalization, which is notoriously not closed under negation, thus yielding more asymmetric diagrams. This paper studies the interplay between logical symmetry and linguistic asymmetry in Aristotelian diagrams. I discuss two major symmetric Aristotelian diagrams, viz. the square and the hexagon of opposition, and show how linguistic considerations yield various asymmetric versions (...) of these diagrams. I then discuss a pentagon of opposition, which occupies an uneasy position between the square and the hexagon. Although this pentagon belongs neither to the symmetric realm of logic nor to the asymmetric realm of linguistics, it occurs several times in the literature. The oldest known occurrence can be found in the cosmological work of the 14th-century author Nicole Oresme. (shrink)

Several authors have recently studied Aristotelian diagrams for various metatheoretical notions from logic, such as tautology, satisfiability, and the Aristotelian relations themselves. However, all these metalogical Aristotelian diagrams focus on the semantic (model-theoretical) perspective on logical consequence, thus ignoring the complementary, and equally important, syntactic (proof-theoretical) perspective. In this paper, I propose an explanation for this discrepancy, by arguing that the metalogical square of opposition for semantic consequence exhibits a natural analogy to the well-known square of opposition for the categorical (...) statements from syllogistics, but that this analogy breaks down once we move from semantic to syntactic consequence. I then show that despite this difficulty, one can indeed construct metalogical Aristotelian diagrams from a syntactic perspective, which have their own, equally elegant characterization in terms of the categorical statements. Finally, I construct several metalogical Aristotelian diagrams that incorporate both semantic and syntactic consequence (and their interaction), and study how they are influenced by the underlying logical system’s soundness and/or completeness. All of this provides further support for the methodological/heuristic perspective on Aristotelian diagrams, which holds that the main use of these diagrams lies in facilitating analogies and comparisons between prima facie unrelated domains of investigation. (shrink)

Tylman has recently pointed out some striking conceptual and methodological analogies between philosophy and computer science. In this paper, I focus on one of Tylman’s most convincing cases, viz. the similarity between Plato’s theory of Ideas and the object-oriented programming paradigm, and analyze it in some more detail. In particular, I argue that the platonic doctrine of the Porphyrian tree corresponds to the fact that most object-oriented programming languages do not support multiple inheritance. This analysis further reinforces Tylman’s point regarding (...) the conceptual continuity between classical metaphysical theorizing and contemporary computer science. (shrink)

© 2017 by the authors. Aristotelian diagrams visualize the logical relations among a finite set of objects. These diagrams originated in philosophy, but recently, they have also been used extensively in artificial intelligence, in order to study various knowledge representation formalisms. In this paper, we develop the idea that Aristotelian diagrams can be fruitfully studied as geometrical entities. In particular, we focus on four polyhedral Aristotelian diagrams for the Boolean algebra B4, viz. the rhombic dodecahedron, the tetrakis hexahedron, the tetraicosahedron (...) and the nested tetrahedron. After an in-depth investigation of the geometrical properties and interrelationships of these polyhedral diagrams, we analyze the correlation between logical and geometrical distance in each of these diagrams. The outcome of this analysis is that the Aristotelian rhombic dodecahedron and tetrakis hexahedron exhibit the strongest degree of correlation between logical and geometrical distance; the tetraicosahedron performs worse; and the nested tetrahedron has the lowest degree of correlation. Finally, these results are used to shed new light on the relative strengths and weaknesses of these polyhedral Aristotelian diagrams, by appealing to the congruence principle from cognitive research on diagram design. (shrink)

Thomas Aquinas maintained that God foreknows future contingent events and that his foreknowledge does not entail that they are necessarily the case. More specifically, he stated that if God knows a future contingent event, this future contingent event will be necessarily the case de sensu composito, but not de sensu diviso. After emphasizing the unified nature of Aquinas’ notion of necessity, we propose an interpretation of his theses by restating them within the framework of non-normal modal logics. In this framework, (...) the K-axiom does not hold, i.e. the necessity operator does not distribute over the material implication. Moreover, assuming that Aquinas rejected the K-axiom is not only consistent, but also leads to a logical framework that allows us to understand other theses maintained by the Doctor Angelicus. In particular, we argue that Aquinas’ remarks on the principle of non-contradiction rest on an impossible worlds semantics for non-normal modal logics. (shrink)

What does the Kantian realm of ends look like? To partially answer that question, game theory will be used to analyse how Kantians would handle situations of strategic interaction. Starting from a thorough understanding of Kant's categorical imperative, three purportedly Kantian game theoretical models will be analysed and argued to be inconsistent with the categorical imperative. As these existing models are unfit for analysing strategic interaction in the realm of ends, a genuinely Kantian model will be constructed by adding the (...) concepts of ‘moral field’, ‘moral range’ and ‘Kantian utility function’ to the standard game‐theoretical model. Throughout the paper, the prisoner's dilemma will be used both as a case study and as a ground for argumentation. (shrink)

In this article, we present a new logical framework to think about surprise. This research does not just aim to better understand, model and predict human behaviour, but also attempts to provide tools for implementing artificial agents. Moreover, these artificial agents should then also be able to reap the same epistemic benefits from surprise as humans do. We start by discussing the dominant literature regarding propositional surprise and explore its shortcomings. These shortcomings are of both an empirical and a conceptual (...) nature. Next, we propose a philosophical solution to the problems that ail these systems, based on the notion of issue of epistemic interest. Finally, we give a formal framework to think about surprise. More specifically, we develop a probabilistic dynamic epistemic logic that succeeds at formalizing the relevant philosophical concepts. This will be done through an issue management system grounded in topology. As an added bonus, the additional expressive power allows us to capture a richer variety of scenarios, and it also enables a more careful analysis of said scenarios. (shrink)

© Springer International Publishing AG, part of Springer Nature 2018. Nearly all squares of opposition found in the literature represent both the Aristotelian relations and the duality relations, and exhibit a very close correspondence between both types of logical relations. This paper investigates the interplay between Aristotelian and duality relations in diagrams beyond the square. In particular, we study a Buridan octagon, a Lenzen octagon, a Keynes-Johnson octagon and a Moretti octagon. Each of these octagons is a natural extension of (...) the square, both from an Aristotelian perspective and from a duality perspective. The results of our comparative analysis turn out to be highly nuanced. (shrink)

Aristotelian diagrams, such as the square of opposition and other, more complex diagrams, have a long history in philosophical logic. Alpha-structures and ladders are two specific kinds of Aristotelian diagrams, which are often studied together because of their close interactions. The present paper builds upon this research line, by reformulating and investigating alpha-structures and ladders in the contemporary setting of logical geometry, a mathematically sophisticated framework for studying Aristotelian diagrams. In particular, this framework allows us to formulate well-defined functions that (...) construct alpha-structures and ladders out of each other. In order to achieve this, we point out the crucial importance of imposing an ordering on the elements in the diagrams involved, and thus formulate all our results in terms of ordered versions of alpha-structures and ladders. These results shed interesting new light on the prospects of developing a systematic classification of Aristotelian diagrams, which is one of the main ongoing research efforts within logical geometry today. (shrink)

Around the turn of the 20th century, Keynes and Johnson extended the well-known square of opposition to an octagon of opposition, in order to account for subject negation (e.g., statements like ‘all non-S are P’). The main goal of this paper is to study the logical properties of the Keynes-Johnson (KJ) octagons of opposition. In particular, we will discuss three concrete examples of KJ octagons: the original one for subject-negation, a contemporary one from knowledge representation, and a third one (hitherto (...) not yet studied) from deontic logic. We show that these three KJ octagons are all Aristotelian isomorphic, but not all Boolean isomorphic to each other (the first two are representable by bitstrings of length 7, whereas the third one is representable by bitstrings of length 6). These results nicely fit within our ongoing research efforts toward setting up a systematic classification of squares, octagons, and other diagrams of opposition. Finally, obtaining a better theoretical understanding of the KJ octagons allows us to answer some open questions that have arisen in recent applications of these diagrams. (shrink)

© 2018, Springer International Publishing AG, part of Springer Nature. Aristotelian diagrams are used extensively in contemporary research in artificial intelligence. The present paper investigates the geometric and cognitive differences between two types of Aristotelian diagrams for the Boolean algebra B4. Within the class of 3D visualizations, the main geometric distinction is that between the cube-based diagrams and the tetrahedron-based diagrams. Geometric properties such as collinearity, central symmetry and distance are examined from a cognitive perspective, focusing on diagram design principles (...) such as congruence/isomorphism and apprehension. The cognitive effectiveness of the different visualizations is compared for the representation of implication versus opposition relations, and for subdiagram embeddings. (shrink)

In order to elucidate his logical analysis of modal quantified propositions (e.g. ‘all men are necessarily mortal’), the 14th century philosopher John Buridan constructed a modal octagon of oppositions. In the present paper we study this modal octagon from the perspective of contemporary logical geometry. We argue that the modal octagon contains precisely six squares of opposition as subdiagrams, and classify these squares based on their logical properties. On a more abstract level, we show that Buridan’s modal octagon precisely captures (...) the interaction between two classical squares of opposition, viz. one for the quantifiers and one for the modalities. Finally, we argue that several aspects of our contemporary formal analyses were already hinted at by Buridan himself. (shrink)

This paper compares two 3D logical diagrams for the Boolean algebra B4, viz. the rhombic dodecahedron and the nested tetrahedron. Geometric properties such as collinearity and central symmetry are examined from a cognitive perspective, focussing on diagram design principles such as congruence/isomorphism and apprehension.

The workshop took place in Leuven, Belgium, and was hosted by the KU Leuven's Centre for Logic and Analytic Philosophy. The workshop’s theme was the syntactical treatment of (alethic, epistemic, etc.) modalities. The standard view on modalities nowadays is that they are operators. Syntactic theories, however, treat modalities as predicates, and thus have to assume a background theory which is sufficiently strong to encode its own formulas (usually, one works with some system of arithmetic and Gödel coding). As a consequence, (...) such theories suffer from paradoxes of self-referentiality. For example, just as the liar sentence states of itself that it is false, the knower sentence states of itself that it is unknown. Kaplan and Montague (1960: 'A paradox regained', Notre Dame J. Formal Logic, vol. 1, pp. 79–90) famously showed that any sufficiently strong theory that contains the knower is inconsistent. (shrink)

The Region Connection Calculus (RCC) is a qualitative spatial reasoning formalism, developed in knowledge representation and geographical information systems. We argue that RCC can be viewed as a more fine-grained approach to the use of Euler diagrams to visualize categorical statements like ‘all A are B’. We present RCC using the syntax of first-order modal logic and a topological semantics. We compare the Gergonne relations (a well-known set of 5 jointly exhaustive and pairwise disjoint relations between two non-empty sets, visualized (...) using Euler-type diagrams) with RCC8 (a similar set of 8 relations for regions). (shrink)