The paper studies the containment companion of a logic \. This consists of the consequence relation \ which satisfies all the inferences of \, where the variables of the conclusion are contained into those of the set of premises, in case this is not inconsistent. In accordance with the work started in [10], we show that a different generalization of the Płonka sum construction, adapted from algebras to logical matrices, allows to provide a matrix-based semantics for containment (...) logics. In particular, we provide an appropriate completeness theorem for a wide family of containment logics, and we show how to produce a complete Hilbert style axiomatization. (shrink)

In his Outlines of Pyrrhonism 2.110–113, Sextus Empiricus presents four different accounts of the conditional, presumably all from the Hellenistic period, in increasing logical strength. While the interpretation and provenance of the first three accounts is relatively secure, the fourth account has perplexed and frustrated interpreters for decades or longer. Most interpreters have ultimately taken a dismissive attitude towards the fourth account and discounted it as being of both little historical and logical interest. We argue that this attitude is unwarranted (...) and demonstrate that the conditional expressed in the fourth account can profitably be understood as a precursor of analytic entailment, familiar from containment logics such as those developed by Parry and Angell. Exploiting recent work by Fine, we present a formal truthmaker semantics for this conditional and show how it sheds light on a number of longstanding issues in the interpretation of this passage. (shrink)

Antoine Arnauld and Pierre Nicole were philosophers and theologians associated with Port-Royal Abbey, a centre of the Catholic Jansenist movement in seventeenth-century France. Their enormously influential Logic or the Art of Thinking, which went through five editions in their lifetimes, treats topics in logic, language, theory of knowledge and metaphysics, and also articulates the response of 'heretical' Jansenist Catholicism to orthodox Catholic and Protestant views on grace, free will and the sacraments. In attempting to combine the categorical theory (...) of the proposition with a Cartesian account of knowledge, their Logic represents the classical view of judgment which inspired the modern transformation in logic and semantic theory by Frege, Russell, Wittgenstein and recent philosophers. This edition presents a new translation of the text, together with a historical introduction and suggestions for further reading. (shrink)

Some expressions of English, like the demonstratives ‘this’ and ‘that’, are referentially promiscuous: distinct free occurrences of them in the same sentence can differ in content relative to the same context. One lesson of referentially promiscuous expressions is that basic logical properties like validity and logical truth obtain or fail to obtain only relative to a context. This approach to logic can be developed in just as rigorous a manner as David Kaplan’s classic logic of demonstratives. The result (...) is a logic that applies to arguments in English containing multiple occurrences of referentially promiscuous expressions. (shrink)

The Logic of Port-Royal, first published in 1662 by the Jansenists Antoine Arnauld and Pierre Nicole, is a work that underlines the inadequacies of the traditional logic. Traditional logic, which included the texts of Aristotle's Organon and the works of the scholastics, was experiencing a mild renaissance in the seventeenth century following its outright and brutal discrediting by the humanists of the previous two centuries. Arnauld and Nicole introduce a fairly original system of logic that attempts (...) to remedy the shortcomings of the revived tradition; they dismiss the Aristotelian "Categories", "Predicables", and "Topics", ignore the scholastic "Doctrine of Terms and Consequence", and suggest a single "General Principle" by means of which the validity of all arguments can be decided. The Principle is based on a notion of containment, divided into entendue and comprehension , which applies to all terms. Because the notion of containment is linked to the objective reality of Cartesian ideas, the authors can claim that their system of logic properly describes reality. The General Principle also suggests that terminist logic is logically and epistemologically prior to sentential logic because, Arnauld and Nicole claim, it governs the Dictum de Omni et Nullo and the Nota Notae. The self-evidence of the two dicta confirmed the validity of all syllogisms of the first figure; furthermore, all syllogisms of other figures could be reduced to one of the first figure. With the General Principle, however, there is no need for such reduction to the first figure. This additional result makes the theorem of sentential logic, "$\supset$r)$\approx$$\supset$-q)", which was needed for the reductions of Baroco and Bocardo, unnecessary. The fact that no theorem of sentential logic is needed to underline term logic guarantees the autonomy of the latter. (shrink)

On verbal epistemology of the neo-Nyaya school in Indic philosophy; includes Sanskrit text, Apūrvavāda from Nyāyasiddhāntadīpa of Śaśadhara.

This is the sequel to Logic. A disciplined mind is one of the most conspicuously missing things in our society. This book can help alleviate that malady. The subtitle of this book is, "Communication of useful knowledge in religion, in the sciences, and in common life." This is a lithograph of an 1833 edition printed in London which also contains "A Discourse on the Education of Children and Youth.".

It is shown that there is a Kripke incomplete logic in NExt(KTB ⊕ □2 p → □3 p). Furthermore, it is also shown that there exists a continuum of Kripke incomplete logics in NExt(KTB ⊕ □5 p → □6 p).

The standard notion of formal theory, in logic, is in general biased exclusively towards assertion: it commonly refers only to collections of assertions that any agent who accepts the generating axioms of the theory should also be committed to accept. In reviewing the main abstract approaches to the study of logical consequence, we point out why this notion of theory is unsatisfactory at multiple levels, and introduce a novel notion of theory that attacks the shortcomings of the received notion (...) by allowing one to take both assertions and denials on a par. This novel notion of theory is based on a bilateralist approach to consequence operators, which we hereby introduce, and whose main properties we investigate in the present paper. (shrink)

In this paper we investigate those extensions of the bimodal provability logic ${\vec CSM}_{0}$ (alias ${\vec PRL}_{1}$ or ${\vec F}^{-})$ which are subframe logics, i.e. whose general frames are closed under a certain type of substructures. Most bimodal provability logics are in this class. The main result states that all finitely axiomatizable subframe logics containing ${\vec CSM}_{0}$ are decidable. We note that, as a rule, interesting systems in this class do not have the finite model property and are not (...) even complete with respect to Kripke semantics. (shrink)

In this paper we investigate the problem of testing the coherence of an assessment of conditional probability following a purely logical setting. In particular we will prove that the coherence of an assessment of conditional probability χ can be characterized by means of the logical consistency of a suitable theory T χ defined on the modal-fuzzy logic FP k (RŁΔ) built up over the many-valued logic RŁΔ. Such modal-fuzzy logic was previously introduced in Flaminio (Lecture Notes in (...) Computer Science, vol. 3571, 2005) in order to treat conditional probability by means of a list of simple probabilities following the well known (smart) ideas exposed by Halpern (Proceedings of the eighth conference on theoretical aspects of rationality and knowledge, pp 17–30, 2001) and by Coletti and Scozzafava (Trends Logic 15, 2002). Roughly speaking, such logic is obtained by adding to the language of RŁΔ a list of k modalities for “probably” and axioms reflecting the properties of simple probability measures. Moreover we prove that the satisfiability problem for modal formulas of FP k (RŁΔ) is NP-complete. Finally, as main result of this paper, we prove FP k (RŁΔ) in order to prove that the problem of establishing the coherence of rational assessments of conditional probability is NP-complete. (shrink)

The addition of "actually" operators to modal languages allows us to capture important inferential behaviours which cannot be adequately captured in logics formulated in simpler languages. Previous work on modal logics containing "actually" operators has concentrated entirely upon extensions of KT5 and has employed a particular modeltheoretic treatment of them. This paper proves completeness and decidability results for a range of normal and nonnormal but quasi-normal propositional modal logics containing "actually" operators, the weakest of which are conservative extensions of K, (...) using a novel generalisation of the standard semantics. (shrink)

The logics BN4 and E4 can be considered as the 4-valued logics of the relevant conditional and (relevant) entailment, respectively. The logic BN4 was developed by Brady in 1982 and the logic E4 by Robles and Méndez in 2016. The aim of this paper is to investigate the implicative variants (of both systems) which contain Routley and Meyer’s logic B and endow them with a Belnap-Dunn type bivalent semantics.

In this paper we prove the uncompactness of every stit logic that contains a generalized refref conditional and is a sublogic of the stit logic with refref equivalence, a syntactical condition of uncompactness that covers infinitely many stit logics. This result is established through the uncompactness of every stit logic whose semantic structures contain no chain of busy choice sequences with cardinality , where is any natural number . The basic idea in the proof is to apply (...) the notion of companions to stit sentences in finding busy choice sequences in structures, and to make use of a relation between chains of busy choice sequences and generalized refref conditionals in connecting the two conditions of uncompactness mentioned above. (shrink)

We assess Meyer’s formalization of arithmetic in his [21], based on the strong relevant logic R and compare this with arithmetic based on a suitable logic of meaning containment, which was developed in Brady [7]. We argue in favour of the latter as it better captures the key logical concepts of meaning and truth in arithmetic. We also contrast the two approaches to classical recapture, again favouring our approach in [7]. We then consider our previous development of (...) Peano arithmetic including primitive recursive functions, finally extending this work to that of general recursion. (shrink)

We examine the relationship between the logics of nonsense of Bochvar and Halldén and the containment logics in the neighborhood of William Parry’s A I. We detail two strategies for manufacturing containment logics from nonsense logics—taking either connexive and paraconsistent fragments of such systems—and show how systems determined by these techniques have appeared as Frederick Johnson’s R C and Carlos Oller’s A L. In particular, we prove that Johnson’s system is precisely the intersection of Bochvar’s B 3 and (...) Graham Priest’s non-symmetrized connexive logic and that Oller’s system lies just beneath the intersection of B 3 and Priest’s paraconsistent L P. We conclude by examining Oller’s system in more depth, giving it a characterization in terms of L P and showing that it plays the same role to Harry Deutsch’s paraconsistent containment logic S that Aleksandr Zinov'ev’s S 1 plays with respect to A I. (shrink)

Six interesting variants of the logics BN4 and E4—which can be considered as the 4-valued logics of the relevant conditional and entailment, respectively—were previously developed in the literature. All these systems are related to the family of relevant logics and contain Routley and Meyer's basic logic B, which is well-known to be specifically associated with the ternary relational semantics. The aim of this paper is to develop reduced general Routley-Meyer semantics for them. Strong soundness and completeness theorems are proved (...) for each one of the logics. (shrink)

Proof Theory of Modal Logic is devoted to a thorough study of proof systems for modal logics, that is, logics of necessity, possibility, knowledge, belief, time, computations etc. It contains many new technical results and presentations of novel proof procedures. The volume is of immense importance for the interdisciplinary fields of logic, knowledge representation, and automated deduction.

Hao Wang was one of the few confidants of the great mathematician and logician Kurt Gödel. _A Logical Journey_ is a continuation of Wang's _Reflections on Gödel_ and also elaborates on discussions contained in _From Mathematics to Philosophy_. A decade in preparation, it contains important and unfamiliar insights into Gödel's views on a wide range of issues, from Platonism and the nature of logic, to minds and machines, the existence of God, and positivism and phenomenology. The impact of Gödel's (...) theorem on twentieth-century thought is on par with that of Einstein's theory of relativity, Heisenberg's uncertainty principle, or Keynesian economics. These previously unpublished intimate and informal conversations, however, bring to light and amplify Gödel's other major contributions to logic and philosophy. They reveal that there is much more in Gödel's philosophy of mathematics than is commonly believed, and more in his philosophy than his philosophy of mathematics. Wang writes that "it is even possible that his quite informal and loosely structured conversations with me, which I am freely using in this book, will turn out to be the fullest existing expression of the diverse components of his inadequately articulated general philosophy." The first two chapters are devoted to Gödel's life and mental development. In the chapters that follow, Wang illustrates the quest for overarching solutions and grand unifications of knowledge and action in Gödel's written speculations on God and an afterlife. He gives the background and a chronological summary of the conversations, considers Gödel's comments on philosophies and philosophers, and his attempt to demonstrate the superiority of the mind's power over brains and machines. Three chapters are tied together by what Wang perceives to be Gödel's governing ideal of philosophy: an exact theory in which mathematics and Newtonian physics serve as a model for philosophy or metaphysics. Finally, in an epilog Wang sketches his own approach to philosophy in contrast to his interpretation of Gödel's outlook. (shrink)

We give a simple sequent calculus presentation of R.B. Angell’s logic of analytic containment, recently championed by Kit Fine as a plausible logic of partial content.

A textbook on modal logic, intended for readers already acquainted with the elements of formal logic, containing nearly 500 exercises. Brian F. Chellas provides a systematic introduction to the principal ideas and results in contemporary treatments of modality, including theorems on completeness and decidability. Illustrative chapters focus on deontic logic and conditionality. Modality is a rapidly expanding branch of logic, and familiarity with the subject is now regarded as a necessary part of every philosopher's technical equipment. (...) Chellas here offers an up-to-date and reliable guide essential for the student. (shrink)

Frithjof Schuon (1907-1998), the author of more than 25 books on religion and spirituality, is the foremost representative of the "Perennialist" or "Traditionalist" school of comparative religious thought. This new edition of Logic and Transcendence, his most important philosophical work, is a fully revised translation from the French original and contains:.

We provide a semantics for relevant logics with addition of Aristotle's Thesis, ∼(A→∼A) and also Boethius,(A→B)→∼(A→∼B). We adopt the Routley-Meyer affixing style of semantics but include in the model structures a regulatory structure for all interpretations of formulae, with a view to obtaining a lessad hoc semantics than those previously given for such logics. Soundness and completeness are proved, and in the completeness proof, a new corollary to the Priming Lemma is introduced (c.f.Relevant Logics and their Rivals I, Ridgeview, 1982).

In this paper we investigate those extensions of the bimodal provability logic \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document} ${\vec CSM}_{0}$\end{document} (alias \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document} ${\vec PRL}_{1}$\end{document} or \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document} ${\vec F}^{-})$\end{document} which are subframe logics, i.e. whose general frames are closed under a certain type of substructures. Most bimodal provability logics are in this class. The main result states that all (...) finitely axiomatizable subframe logics containing \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document} ${\vec CSM}_{0}$\end{document} are decidable. We note that, as a rule, interesting systems in this class do not have the finite model property and are not even complete with respect to Kripke semantics. (shrink)

This junior/senior level text is devoted to a study of first-order logic and its role in the foundations of mathematics: What is a proof? How can a proof be justified? To what extent can a proof be made a purely mechanical procedure? How much faith can we have in a proof that is so complex that no one can follow it through in a lifetime? The first substantial answers to these questions have only been obtained in this century. The (...) most striking results are contained in Goedel's work: First, it is possible to give a simple set of rules that suffice to carry out all mathematical proofs; but, second, these rules are necessarily incomplete - it is impossible, for example, to prove all true statements of arithmetic. The book begins with an introduction to first-order logic, Goedel's theorem, and model theory. A second part covers extensions of first-order logic and limitations of the formal methods. The book covers several advanced topics, not commonly treated in introductory texts, such as Trachtenbrot's undecidability theorem. Fraissé's elementary equivalence, and Lindstroem's theorem on the maximality of first-order logic. (shrink)

Leibniz's conceptual containment theory says that singular propositions of the form a is F are true when the complete concept of being a contains the concept of being F. In this paper, I provide a new semantics for first-order logic built around this idea. The semantics resolves longstanding problems for Leibniz's theory and can represent, without possible worlds, both hyperintensional distinctions among properties and a certain kind of presumably impossible situation that standard approaches cannot represent. The semantics also (...) captures the strong soundness and completeness of classical first-order logic. (shrink)

[[[ (Here only the chapters 3 – 8, see *** ) First I argue that the prohibition of linguistic self-reference as a solution to the antinomy problem contains a pragmatic contradiction and is thus not only too restrictive, but just inconsistent (chap.1). Furthermore, the possibilities of non-restrictive strategies for antinomy avoidance are discussed, whereby the explicit inclusion of the – pragmatically presuposed – consistency requirement proves to be the optimal strategy (chap.2). ]]] The central question here is that about the (...) actual reason for antinomic structures. It turns out to be a form of negative self-conditioning (chap.3). This makes it necessary to clarify the status of negative concepts (chap.4). The generalization of these considerations (chap.5) leads to the actual analysis of the antinomic basic structure (chap.6): Decisively for the pragmatics of the concept is that it positively owns a meaning, so that positivity is always constituted by the concept qua concept. Thus a negative concept is characterized by a fundamental ambivalence: From a semantic point of view it has negative character, in its pragmatic status as a concept, however, it has positive character. If the meaning is especially that of a negative self-reference, the ambivalence leads to the antinomic constellation of a negative self-condition – that is the crux of the matter here! The concept thus possesses the property defined by it exactly when it does not possess it and vice versa. A closer analysis shows that the function of reflective structures for the occurrence of antinomies has to be judged much more differentiated than previous opinions suggest. Not only are four forms of reflectivity to be distinguished in this context – ontic, semantic, pragmatic reflectivity, and especially the form of negative self-condition; but it is also apparent that these are intertwined with each other in a way that is difficult to be understood. The astonishing variety of relationships associated with this makes the irritation that has always emanated from the antinomy problem appear more comprehensible. In the developed pragmatic perspective furtheron parallels to the structure of self-consciousness become visible (chap.7). I conclude with considerations about the significance of the antinomic structure for the problem of dialectics, especially for the synthesis formation of mutually exclusive terms (chap.8). (shrink)

_Logic: The Basics_ is an accessible introduction to several core areas of logic. The first part of the book features a self-contained introduction to the standard topics in classical logic, such as: · mathematical preliminaries · propositional logic · quantified logic · English and standard ‘symbolic translations’ · tableau procedures. Alongside comprehensive coverage of the standard topics, this thoroughly revised second edition also introduces several philosophically important nonclassical logics, free logics, and modal logics, and gives the (...) reader an idea of how they can take their knowledge further. With its wealth of exercises, _Logic: The Basics _is a useful textbook for courses ranging from the introductory level to the early graduate level, and also as a reference for students and researchers in philosophical logic. (shrink)

Presents a self-contained introduction to logic suitable for majors and nonmajors, and can be covered entirely in a one-semester course. Natural deduction systems of sentential logic and of first-order logic, truth tables, and the basic ideas of model theory are presented without superfluous discussion.

For a novice this book is a mathematically-oriented introduction to modal logic, the discipline within mathematical logic studying mathematical models of reasoning which involve various kinds of modal operators. It starts with very fundamental concepts and gradually proceeds to the front line of current research, introducing in full details the modern semantic and algebraic apparatus and covering practically all classical results in the field. It contains both numerous exercises and open problems, and presupposes only minimal knowledge in mathematics. (...) A specialist can use the book as a source of references. Results and methods of many directions in propositional modal logic, from completeness and duality to algorithmic problems, are collected and systematically presented in one volume. (shrink)