Axiomatization of Some Basic and Modal Boolean Connexive Logics

Boolean connexive logic is an extension of Boolean logic that is closed under Modus Ponens and contains Aristotle’s and Boethius’ theses. According to these theses (i) a sentence cannot imply its negation and the negation of a sentence cannot imply the sentence; and (ii) if the antecedent implies the consequent, then the antecedent cannot imply the negation of the consequent and if the antecedent implies the negation of the consequent, then the antecedent cannot imply the consequent. Such a logic was first introduced by Jarmużek and Malinowski, by means of so-called relating semantics and tableau systems. Subsequently its modal extension was determined by means of the combination of possible-worlds semantics and relating semantics. In the following article we present axiomatic systems of some basic and modal Boolean connexive logics. Proofs of completeness will be carried out using canonical models defined with respect to maximal consistent sets.

On the Origin of Logical Determinism in Babylonia

In this paper, I show that the idea of logical determinism can be traced back from the Old Babylonian period at least. According to this idea, there are some signs (omens) which can explain the appearance of all events. These omens demonstrate the will of gods and their power realized through natural forces. As a result, each event either necessarily appears or necessarily disappears. This idea can be examined as the first version of eternalism – the philosophical belief that each temporal event (including past and future events) is actual. In divination lists in Akkadian presented as codes we can reconstruct Boolean matrices showing that the Babylonians used some logical-algebraic structures in their reasoning. The idea of logical contingency was introduced within a new mood of thinking presented by the Greek prose – historical as well as philosophical narrations. In the Jewish genre ’aggādōt, the logical determinism is supposed to be in opposition to the Greek prose.

Completeness: From Husserl to Carnap

In his Doppelvortrag (1901), Edmund Husserl introduced two concepts of “definiteness” which have been interpreted as a vindication of his role in the history of completeness. Some commentators defended that the meaning of these notions should be understood as categoricity, while other scholars believed that it is closer to syntactic completeness. A detailed study of the early twentieth-century axiomatics and Husserl’s Doppelvortrag shows, however, that many concepts of completeness were conflated as equivalent. Although “absolute definiteness” was principally an attempt to characterize non-extendible manifolds and axiom systems (different from Hilbert’s axiom of completeness), an absolutely definite theory has a unique model and, thus, it is non-forkable and semantically complete (decidable). Non-forkability and decidability were formally delimited by Fraenkel and Carnap almost three decades later and, in fact, they mentioned Husserl as precursor of the latter. Therefore, this paper contributes to a reassessment of Husserl’s place in the history of logic.