Logic as a Universal Medium or Logic as a Calculus? Husserl and the Presuppositions of “the Ultimate Presupposition of Twentieth Century Philosophy”

This paper discusses Jean van Heijenoort's (1967) and Jaakko and Merrill B. Hintikka's (1986, 1997) distinction between logic as a universal language and logic as a calculus, and its applicability to Edmund Husserl's phenomenology. Although it is argued that Husserl's phenomenology shares characteristics with both sides, his view of logic is closer to the model‐theoretical, logic‐as‐calculus view. However, Husserl's philosophy as transcendental philosophy is closer to the universalist view. This paper suggests that Husserl's position shows that holding a model‐theoretical view of logic does not necessarily imply a calculus view about the relations between language and the world. The situation calls for reflection about the distinction: It will be suggested that the applicability of the van Heijenoort and the Hintikkas distinction either has to be restricted to a particular philosopher's views about logic, in which case no implications about his or her more general philosophical views should be inferred from it; or the distinction turns into a question of whether our human predicament is inescapable or whether it is possible, presumably by means of model theory, to obtain neutral answers to philosophical questions. Thus the distinction ultimately turns into a question about the correct method for doing philosophy.     

The Role of Mathematics in Deleuze’s Critical Engagement with Hegel

Abstract

The role of mathematics in the development of Gilles Deleuze’s (1925–95) philosophy of difference as an alternative to the dialectical philosophy determined by the Hegelian dialectic logic is demonstrated in this paper by differentiating Deleuze’s interpretation of the problem of the infinitesimal in Difference and Repetition from that which G. W. F Hegel (1770–1831) presents in the Science of Logic. Each deploys the operation of integration as conceived at different stages in the development of the infinitesimal calculus in his treatment of the problem of the infinitesimal. Against the role that Hegel assigns to integration as the inverse transformation of differentiation in the development of his dialectical logic, Deleuze strategically redeploys Leibniz’s account of integration as a method of summation in the form of a series in the development of his philosophy of difference. By demonstrating the relation between the differential point of view of the Leibnizian infinitesimal calculus and the differential calculus of contemporary mathematics, I argue that Deleuze effectively bypasses the methods of the differential calculus which Hegel uses to support the development of the dialectical logic, and by doing so, sets up the critical perspective from which to construct an alternative logic of relations characteristic of a philosophy of difference. The mode of operation of this logic is then demonstrated by drawing upon the mathematical philosophy of Albert Lautman (1908–44), which plays a significant role in Deleuze’s project of constructing a philosophy of difference. Indeed, the logic of relations that Deleuze constructs is dialectical in the Lautmanian sense.     

Varieties of Linear Calculi

A uniform calculus for linear logic is presented. The calculus has the form of a natural deduction system in sequent calculus style with general introduction and elimination rules. General elimination rules are motivated through an inversion principle, the dual form of which gives the general introduction rules. By restricting all the rules to their single-succedent versions, a uniform calculus for intuitionistic linear logic is obtained. The calculus encompasses both natural deduction and sequent calculus that are obtained as special instances from the uniform calculus. Other instances give all the invertibilities and partial invertibilities for the sequent calculus rules of linear logic. The calculus is normalizing and satisfies the subformula property for normal derivations.     

Synchronized Linear-Time Temporal Logic

A new combined temporal logic called synchronized linear-time temporal logic (SLTL) is introduced as a Gentzen-type sequent calculus. SLTL can represent the n-Cartesian product of the set of natural numbers. The cut-elimination and completeness theorems for SLTL are proved. Moreover, a display sequent calculus ??SLTL is defined.     

An analytic tableau calculus for a temporalised belief logic

A tableau is a refutation-based decision procedure for a related logic, and is among the most popular proof procedures for modal logics. In this paper, we present a labelled tableau calculus for a temporalised belief logic called TML⁺, which is obtained by adding a linear-time temporal logic onto a belief logic by the temporalisation method of Finger and Gabbay. We first establish the soundness and the completeness of the labelled tableau calculus based on the soundness and completeness results of its constituent logics. We then sketch a resolution-type proof procedure that complements the tableau calculus and also propose a model checking algorithm for TML⁺ based on the recent results for model checking procedures for temporalised logics. TML⁺ is suitable for formalising trust and agent beliefs and reasoning about their evolution for agent-based systems. Based on the logic TML⁺, the proposed labelled tableau calculus could be used for analysis, design and verification of agent-based systems operating in dynamic environments.     

Labeled Calculi and Finite-Valued Logics

A general class of labeled sequent calculi is investigated, and necessary and sufficient conditions are given for when such a calculus is sound and complete for a finite-valued logic if the labels are interpreted as sets of truth values (sets-as-signs). Furthermore, it is shown that any finite-valued logic can be given an axiomatization by such a labeled calculus using arbitrary "systems of signs," i.e., of sets of truth values, as labels. The number of labels needed is logarithmic in the number of truth values, and it is shown that this bound is tight.     

Finding Missing Proofs with Automated Reasoning

This article features long-sought proofs with intriguing properties (such as the absence of double negation and the avoidance of lemmas that appeared to be indispensable), and it features the automated methods for finding them. The theorems of concern are taken from various areas of logic that include two-valued sentential (or propositional) calculus and infinite-valued sentential calculus. Many of the proofs (in effect) answer questions that had remained open for decades, questions focusing on axiomatic proofs. The approaches we take are of added interest in that all rely heavily on the use of a single program that offers logical reasoning, William McCune's automated reasoning program OTTER. The nature of the successes and approaches suggests that this program offers researchers a valuable automated assistant. This article has three main components. First, in view of the interdisciplinary nature of the audience, we discuss the means for using the program in question (OTTER), which flags, parameters, and lists have which effects, and how the proofs it finds are easily read. Second, because of the variety of proofs that we have found and their significance, we discuss them in a manner that permits comparison with the literature. Among those proofs, we offer a proof shorter than that given by Meredith and Prior in their treatment of ukasiewicz's shortest single axiom for the implicational fragment of two-valued sentential calculus, and we offer a proof for the ukasiewicz 23-letter single axiom for the full calculus. Third, with the intent of producing a fruitful dialogue, we pose questions concerning the properties of proofs and, even more pressing, invite questions similar to those this article answers.     

A cirquent calculus system with clustering and ranking

Cirquent calculus is a new proof-theoretic and semantic approach introduced by G. Japaridze for the needs of his theory of computability logic (CoL). The earlier article “From formulas to cirquents in computability logic” by Japaridze generalized formulas in CoL to circuit-style structures termed cirquents. It showed that, through cirquents with what are termed clustering and ranking, one can capture, refine and generalize independence-friendly (IF) logic. Specifically, the approach allows us to account for independence from propositional connectives in the same spirit as IF logic accounts for independence from quantifiers. Japaridze's treatment of IF logic, however, was purely semantical, and no deductive system was proposed. The present paper syntactically constructs a cirquent calculus system with clustering and ranking, sound and complete w.r.t. the propositional fragment of cirquent-based semantics. Such a system captures the propositional version of what is called extended IF logic, thus being an axiomatization of a nontrivial fragment of that logic.     

Completeness of quantum logic

This paper is based on a semantic foundation of quantum logic which makes use of dialog-games. In the first part of the paper the dialogic method is introduced and under the conditions of quantum mechanical measurements the rules of a dialog-game about quantum mechanical propositions are established. In the second part of the paper the quantum mechanical dialog-game is replaced by a calculus of quantum logic. As the main part of the paper we show that the calculus of quantum logic is complete and consistent with respect to the dialogic semantics. Since the dialog-game does not involve the excluded middle the calculus represents a calculus of effective (intuitionistic) quantum logic.In a forthcoming paper it is shown that this calculus is equivalent to a calculus of sequents and more interestingly to a calculus of propositions. With the addition of the excluded middle the latter calculus is a model for the lattice of subspaces of a Hilbert space.On leave of absence from the Institut für Theoretische Physik der Universität zu Köln, W.-Germany.     

Logic and Existence: Timothy Williams

The paper defends the intelligibility of unrestricted quantification. For any natural number n , 'There are at least n individuals' is logically true, when the quantifier is unrestricted. In response to the objection that such sentences should not count as logically true because existence is contingent, it is argued by consideration of cross-world counting principles that in the relevant sense of 'exist' existence is not contingent. A tentative extension of the upward Löwenheim–Skolem theorem to proper classes is used to argue that a sound and complete axiomatization of the logic of unrestricted universal quantification results from adding all sentences of the form 'There are at least n individuals' as axioms to a standard axiomatization of the first-order predicate calculus.
Of the many questions on which logic is neutral, one is usually supposed to be this: 'How many individuals are there?' On the alternative view defended below, truths about the number of individuals are logically true. They are not contingent logical truths, for it is not contingent what individuals there are.     

Importing Logics: Soundness and Completeness Preservation

Importing subsumes several asymmetric ways of combining logics, including modalization and temporalization. A calculus is provided for importing, inheriting the axioms and rules from the given logics and including additional rules for lifting derivations from the imported logic. The calculus is shown to be sound and concretely complete with respect to the semantics of importing as proposed in J. Rasga et al. (100(3):541–581, 2012) Studia Logica.     

Double-Negation Elimination in Some Propositional Logics

This article answers two questions (posed in the literature), each concerning the guaranteed existence of proofs free of double negation. A proof is free of double negation if none of its deduced steps contains a term of the formn(n(t)) for some term t, where n denotes negation. The first question asks for conditions on the hypotheses that, if satisfied, guarantee the existence of a double-negation-free proof when the conclusion is free of double negation. The second question asks about the existence of an axiom system for classical propositional calculus whose use, for theorems with a conclusion free of double negation, guarantees the existence of a double-negation-free proof. After giving conditions that answer the first question, we answer the second question by focusing on the Lukasiewicz three-axiom system. We then extend our studies to infinite-valued sentential calculus and to intuitionistic logic and generalize the notion of being double-negation free. The double-negation proofs of interest rely exclusively on the inference rule condensed detachment, a rule that combines modus ponens with an appropriately general rule of substitution. The automated reasoning program Otter played an indispensable role in this study.     

正结合演算

从结构推理的观点来看,结合演算是一种很弱的逻辑,因为它仅容纳一种结构规则,即“结合规则”。正结合演算作为一种“正命题逻辑”,是结合演算的基础。本文构建了正结合演算结构推理系统BL和对应的公理系统B,阐述了结合演算拒斥“交换规则”、“收缩规则”和“弱化规则”的理论意义和应用价值,证明了系统BL和系统B的等价性。     

A Cut-Free Sequent Calculus for Defeasible Erotetic Inferences

In recent years, the effort to formalize erotetic inferences—i.e., inferences to and from questions—has become a central concern for those working in erotetic logic. However, few have sought to formulate a proof theory for these inferences. To fill this lacuna, we construct a calculus for (classes of) sequents that are sound and complete for two species of erotetic inferences studied by Inferential Erotetic Logic (IEL): erotetic evocation and erotetic implication. While an effort has been made to axiomatize the former in a sequent system, there is currently no proof theory for the latter. Moreover, the extant axiomatization of erotetic evocation fails to capture its defeasible character and provides no rules for introducing or eliminating question-forming operators. In contrast, our calculus encodes defeasibility conditions on sequents and provides rules governing the introduction and elimination of erotetic formulas. We demonstrate that an elimination theorem holds for a version of the cut rule that applies to both declarative and erotetic formulas and that the rules for the axiomatic account of question evocation in IEL are admissible in our system.

     

Logic and Mathematics in the Seventeenth Century

According to the received view (Bocheński, Kneale), from the end of the fourteenth to the second half of nineteenth century, logic enters a period of decadence. If one looks at this period, the richness of the topics and the complexity of the discussions that characterized medieval logic seem to belong to a completely different world: a simplified theory of the syllogism is the only surviving relic of a glorious past. Even though this negative appraisal is grounded on good reasons, it overlooks, however, a remarkable innovation that imposes itself at the beginning of the sixteenth century: the attempt to connect the two previously separated disciplines of logic and mathematics. This happens along two opposite directions: the one aiming to base mathematical proofs on traditional (Aristotelian) logic; the other attempting to reduce logic to a mathematical (algebraical) calculus. This second trend was reinforced by the claim, mainly propagated by Hobbes, that the activity of thinking was the same as that of performing an arithmetical calculus. Thus, in the period of what Bocheński characterizes as ‘classical logic’, one may find the seeds of a process which was completed by Boole and Frege and opened the door to the contemporary, mathematical form of logic.     

Proving theorems of the second order Lambek calculus in polynomial time

In the Lambek calculus of order 2 we allow only sequents in which the depth of nesting of implications is limited to 2. We prove that the decision problem of provability in the calculus can be solved in time polynomial in the length of the sequent. A normal form for proofs of second order sequents is defined. It is shown that for every proof there is a normal form proof with the same axioms. With this normal form we can give an algorithm that decides provability of sequents in polynomial time.The author was sponsored by project NF 102/62–356 (Structural and Semantic Parallels in Natural Languages and Programming Languages), funded by the Netherlands Organization for the Advancement of Research (NWO).Presented byCecylia Rauszer     

A Gentzen Calculus for Nothing but the Truth

In their paper Nothing but the Truth Andreas Pietz and Umberto Rivieccio present Exactly True Logic (ETL), an interesting variation upon the four-valued logic for first-degree entailment FDE that was given by Belnap and Dunn in the 1970s. Pietz & Rivieccio provide this logic with a Hilbert-style axiomatisation and write that finding a nice sequent calculus for the logic will presumably not be easy. But a sequent calculus can be given and in this paper we will show that a calculus for the Belnap-Dunn logic we have defined earlier can in fact be reused for the purpose of characterising ETL, provided a small alteration is made—initial assignments of signs to the sentences of a sequent to be proved must be different from those used for characterising FDE. While Pietz & Rivieccio define ETL on the language of classical propositional logic we also study its consequence relation on an extension of this language that is functionally complete for the underlying four truth values. On this extension the calculus gets a multiple-tree character—two proof trees may be needed to establish one proof.     

Relational Semantics of the Lambek Calculus Extended with Classical Propositional Logic

We show that the relational semantics of the Lambek calculus, both nonassociative and associative, is also sound and complete for its extension with classical propositional logic. Then, using filtrations, we obtain the finite model property for the nonassociative Lambek calculus extended with classical propositional logic.     

Reasoning About Collectively Accepted Group Beliefs

A proof-theoretical treatment of collectively accepted group beliefs is presented through a multi-agent sequent system for an axiomatization of the logic of acceptance. The system is based on a labelled sequent calculus for propositional multi-agent epistemic logic with labels that correspond to possible worlds and a notation for internalized accessibility relations between worlds. The system is contraction- and cut-free. Extensions of the basic system are considered, in particular with rules that allow the possibility of operative members or legislators. Completeness with respect to the underlying Kripke semantics follows from a general direct and uniform argument for labelled sequent calculi extended with mathematical rules for frame properties. As an example of the use of the calculus we present an analysis of the discursive dilemma.