Year:

  1.  6
    Nonrepresentable Relation Algebras From Groups.Hajnal Andréka, István Németi & Steven Givant - 2020 - Review of Symbolic Logic 13 (4):861-881.
    A series of nonrepresentable relation algebras is constructed from groups. We use them to prove that there are continuum many subvarieties between the variety of representable relation algebras and the variety of coset relation algebras. We present our main construction in terms of polygroupoids.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  2.  16
    Logic and Topology for Knowledge, Knowability, and Belief.Adam Bjorndahl & Aybüke Özgün - 2020 - Review of Symbolic Logic 13 (4):748-775.
    In recent work, Stalnaker proposes a logical framework in which belief is realized as a weakened form of knowledge 35. Building on Stalnaker’s core insights, and using frameworks developed in 11 and 3, we employ topological tools to refine and, we argue, improve on this analysis. The structure of topological subset spaces allows for a natural distinction between what is known and what is knowable; we argue that the foundational axioms of Stalnaker’s system rely intuitively on both of these notions. (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  3.  50
    Bunder’s Paradox.Michael Caie - 2020 - Review of Symbolic Logic 13 (4):829-844.
    Systems of illative logic are logical calculi formulated in the untyped λ-calculus supplemented with certain logical constants.1 In this short paper, I consider a paradox that arises in illative logic. I note two prima facie attractive ways of resolving the paradox. The first is well known to be consistent, and I briefly outline a now standard construction used by Scott and Aczel that establishes this. The second, however, has been thought to be inconsistent. I show that this isn’t so, by (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  4.  15
    Proof Systems for Various Fde-Based Modal Logics.Sergey Drobyshevich & Heinrich Wansing - 2020 - Review of Symbolic Logic 13 (4):720-747.
    We present novel proof systems for various FDE-based modal logics. Among the systems considered are a number of Belnapian modal logics introduced in Odintsov & Wansing and Odintsov & Wansing, as well as the modal logic KN4 with strong implication introduced in Goble. In particular, we provide a Hilbert-style axiom system for the logic $BK^{\square - } $ and characterize the logic BK as an axiomatic extension of the system $BK^{FS} $. For KN4 we provide both an FDE-style axiom system (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  5.  11
    A Note on the Cut-Elimination Proof in “Truth Without Contraction”.Andreas Fjellstad - 2020 - Review of Symbolic Logic 13 (4):882-886.
    This note shows that the permutation instructions presented by Zardini for eliminating cuts on universally quantified formulas in the sequent calculus for the noncontractive theory of truth IKTω are inadequate. To that purpose the note presents a derivation in the sequent calculus for IKTω ending with an application of cut on a universally quantified formula which the permutation instructions cannot deal with. The counterexample is of the kind that leaves open the question whether cut can be shown to be eliminable (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  6.  8
    De Morgan Interpretation of the Lambek–Grishin Calculus.Michael Kaminski & Nissim Francez - 2020 - Review of Symbolic Logic 13 (4):845-856.
    We present an embedding of the Lambek–Grishin calculus into an extension of the nonassociative Lambek calculus with negation. The embedding is based on the De Morgan interpretation of the dual Grishin connectives.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  7.  11
    Certain Modern Ideas and Methods: “Geometric Reality” in the Mathematics of Charlotte Angas Scott.Jemma Lorenat - 2020 - Review of Symbolic Logic 13 (4):681-719.
    Charlotte Angas Scott was an internationally renowned geometer, the first British woman to earn a doctorate in mathematics, and the chair of the Bryn Mawr mathematics department for forty years. There she helped shape the burgeoning mathematics community in the United States. Scott often motivated her research as providing a “geometric treatment” of results that had previously been derived algebraically. The adjective “geometric” likely entailed many things for Scott, from her careful illustration of diagrams to her choice of references and (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  8.  8
    Fractional Semantics for Classical Logic.Mario Piazza & Gabriele Pulcini - 2020 - Review of Symbolic Logic 13 (4):810-828.
    This article presents a new semantics for classical propositional logic. We begin by maximally extending the space of sequent proofs so as to admit proofs for any logical formula; then, we extract the new semantics by focusing on the axiomatic structure of proofs. In particular, the interpretation of a formula is given by the ratio between the number of identity axioms out of the total number of axioms occurring in any of its proofs. The outcome is an informational refinement of (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  9.  32
    Ineffability and Revenge.Chris Scambler - 2020 - Review of Symbolic Logic 13 (4):797-809.
    In recent work Philip Welch has proven the existence of ‘ineffable liars’ for Hartry Field’s theory of truth. These are offered as liar-like sentences that escape classification in Field’s transfinite hierarchy of determinateness operators. In this article I present a slightly more general characterization of the ineffability phenomenon, and discuss its philosophical significance. I show the ineffable sentences to be less ‘liar-like’ than they appear in Welch’s presentation. I also point to some open technical problems whose resolution would greatly clarify (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  10.  5
    Non–Well-Founded Derivations in the Gödel-Löb Provability Logic.Daniyar Shamkanov - 2020 - Review of Symbolic Logic 13 (4):776-796.
    We consider Hilbert-style non–well-founded derivations in the Gödel-Löb provability logic GL and establish that GL with the obtained derivability relation is globally complete for algebraic and neighbourhood semantics.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  11.  11
    Cut and Gamma I: Propositional and Constant Domain R.Yale Weiss - 2020 - Review of Symbolic Logic 13 (4):887-909.
    The main object of this article is to give two novel proofs of the admissibility of Ackermann’s rule (γ) for the propositional relevant logic R. The results are established as corollaries of cut elimination for systems of tableaux for R. Cut elimination, in turn, is established both nonconstructively (as a corollary of completeness) and constructively (using Gentzen-like methods). The extensibility of the techniques is demonstrated by showing that (γ) is admissible for RQ* (R with constant domain quantifiers). The status of (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  12.  17
    Some Observations on Truth Hierarchies: A Correction.Philip D. Welch - 2020 - Review of Symbolic Logic 13 (4):857-860.
    A correction is needed to our paper: to the definition contained within the statement of Lemma 1.5 and thus arguments around it in §3.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  13.  10
    Hereditarily Structurally Complete Positive Logics.Alex Citkin - 2020 - Review of Symbolic Logic 13 (3):483-502.
    Positive logics are $\{ \wedge, \vee, \to \}$-fragments of intermediate logics. It is clear that the positive fragment of $Int$ is not structurally complete. We give a description of all hereditarily structurally complete positive logics, while the question whether there is a structurally complete positive logic which is not hereditarily structurally complete, remains open.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  14.  27
    Incompleteness Via Paradox and Completeness.Walter Dean - 2020 - Review of Symbolic Logic 13 (3):541-592.
    This paper explores the relationship borne by the traditional paradoxes of set theory and semantics to formal incompleteness phenomena. A central tool is the application of the Arithmetized Completeness Theorem to systems of second-order arithmetic and set theory in which various “paradoxical notions” for first-order languages can be formalized. I will first discuss the setting in which this result was originally presented by Hilbert & Bernays and also how it was later adapted by Kreisel and Wang in order to obtain (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  15.  9
    Three Characterizations of Strict Coherence on Infinite-Valued Events.Tommaso Flaminio - 2020 - Review of Symbolic Logic 13 (3):593-610.
    This article builds on a recent paper coauthored by the present author, H. Hosni and F. Montagna. It is meant to contribute to the logical foundations of probability theory on many-valued events and, specifically, to a deeper understanding of the notion of strict coherence. In particular, we will make use of geometrical, measure-theoretical and logical methods to provide three characterizations of strict coherence on formulas of infinite-valued Łukasiewicz logic.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  16.  6
    Strong Completeness of Modal Logics Over 0-Dimensional Metric Spaces.Robert Goldblatt & Ian Hodkinson - 2020 - Review of Symbolic Logic 13 (3):611-632.
    We prove strong completeness results for some modal logics with the universal modality, with respect to their topological semantics over 0-dimensional dense-in-themselves metric spaces. We also use failure of compactness to show that, for some languages and spaces, no standard modal deductive system is strongly complete.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  17.  14
    A Note on the Existence of Ratifiable Acts.Joseph Y. Halpern - 2020 - Review of Symbolic Logic 13 (3):503-508.
    Sufficient conditions are given under which ratifiable acts exist.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  18.  32
    Peirce’s Calculi for Classical Propositional Logic.Minghui Ma & Ahti-Veikko Pietarinen - 2020 - Review of Symbolic Logic 13 (3):509-540.
    This article investigates Charles Peirce’s development of logical calculi for classical propositional logic in 1880–1896. Peirce’s 1880 work on the algebra of logic resulted in a successful calculus for Boolean algebra. This calculus, denoted byPC, is here presented as a sequent calculus and not as a natural deduction system. It is shown that Peirce’s aim was to presentPCas a sequent calculus. The law of distributivity, which Peirce states in 1880, is proved using Peirce’s Rule, which is a residuation, inPC. The (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   4 citations  
  19.  2
    Restricted Interpolation and Lack Thereof in Stit Logic.Grigory K. Olkhovikov - 2020 - Review of Symbolic Logic 13 (3):459-482.
    We consider the propositional logic equipped with Chellas stit operators for a finite set of individual agents plus the historical necessity modality. We settle the question of whether such a logic enjoys restricted interpolation property, which requires the existence of an interpolant only in cases where the consequence contains no Chellas stit operators occurring in the premise. We show that if action operators count as logical symbols, then such a logic has restricted interpolation property iff the number of agents does (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  20.  37
    Relevance for the Classical Logician.Ethan Brauer - 2020 - Review of Symbolic Logic 13 (2):436-457.
    Although much technical and philosophical attention has been given to relevance logics, the notion of relevance itself is generally left at an intuitive level. It is difficult to find in the literature an explicit account of relevance in formal reasoning. In this article I offer a formal explication of the notion of relevance in deductive logic and argue that this notion has an interesting place in the study of classical logic. The main idea is that a premise is relevant to (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  21.  19
    Generic Large Cardinals as Axioms.Monroe Eskew - 2020 - Review of Symbolic Logic 13 (2):375-387.
    We argue against Foreman’s proposal to settle the continuum hypothesis and other classical independent questions via the adoption of generic large cardinal axioms.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  22.  22
    Standard Bayes Logic is Not Finitely Axiomatizable.Zalán Gyenis - 2020 - Review of Symbolic Logic 13 (2):326-337.
    In the article [2] a hierarchy of modal logics has been defined to capture the logical features of Bayesian belief revision. Elements in that hierarchy were distinguished by the cardinality of the set of elementary propositions. By linking the modal logics in the hierarchy to the modal logics of Medvedev frames it has been shown that the modal logic of Bayesian belief revision determined by probabilities on a finite set of elementary propositions is not finitely axiomatizable. However, the infinite case (...)
    No categories
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  23.  15
    Seventeenth-Century Scholastic Syllogistics. Between Logic and Mathematics?Miroslav Hanke - 2020 - Review of Symbolic Logic 13 (2):219-248.
    The seventeenth century can be viewed as an era of innovation in the formal and natural sciences and of paradigmatic diversity in philosophy. Within this environment, the present study focuses on scholastic logic and, in particular, syllogistic. In seventeenth-century scholastic logic two different approaches to logic can be identified, one represented by the Dominicans Báñez, Poinsot, and Comas del Brugar, the other represented by the Jesuits Hurtado, Arriaga, Oviedo, and Compton. These two groups of authors can be contrasted in three (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  24.  5
    On Morita Equivalence and Interpretability.Paul Anh Mceldowney - 2020 - Review of Symbolic Logic 13 (2):388-415.
    In a recent article, Barrett & Halvorson define a notion of equivalence for first-order theories, which they call “Morita equivalence.” To argue that Morita equivalence is a reasonable measure of “theoretical equivalence,” they make use of the claim that Morita extensions “say no more” than the theories they are extending. The goal of this article is to challenge this central claim by raising objections to their argument for it and by showing why there is good reason to think that the (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  25.  30
    The Large Structures of Grothendieck Founded on Finite-Order Arithmetic.Colin Mclarty - 2020 - Review of Symbolic Logic 13 (2):296-325.
    The large-structure tools of cohomology including toposes and derived categories stay close to arithmetic in practice, yet published foundations for them go beyond ZFC in logical strength. We reduce the gap by founding all the theorems of Grothendieck’s SGA, plus derived categories, at the level of Finite-Order Arithmetic, far below ZFC. This is the weakest possible foundation for the large-structure tools because one elementary topos of sets with infinity is already this strong.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  26.  6
    Varieties of de Morgan Monoids: Covers of Atoms.T. Moraschini, J. G. Raftery & J. J. Wannenburg - 2020 - Review of Symbolic Logic 13 (2):338-374.
    The variety DMM of De Morgan monoids has just four minimal subvarieties. The join-irreducible covers of these atoms in the subvariety lattice of DMM are investigated. One of the two atoms consisting of idempotent algebras has no such cover; the other has just one. The remaining two atoms lack nontrivial idempotent members. They are generated, respectively, by 4-element De Morgan monoids C4 and D4, where C4 is the only nontrivial 0-generated algebra onto which finitely subdirectly irreducible De Morgan monoids may (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  27.  14
    Belnap–Dunn Modal Logics: Truth Constants Vs. Truth Values.Sergei P. Odintsov & Stanislav O. Speranski - 2020 - Review of Symbolic Logic 13 (2):416-435.
    We shall be concerned with the modal logic BK—which is based on the Belnap–Dunn four-valued matrix, and can be viewed as being obtained from the least normal modal logic K by adding ‘strong negation’. Though all four values ‘truth’, ‘falsity’, ‘neither’ and ‘both’ are employed in its Kripke semantics, only the first two are expressible as terms. We show that expanding the original language of BK to include constants for ‘neither’ or/and ‘both’ leads to quite unexpected results. To be more (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  28.  23
    A Fully Classical Truth Theory Characterized by Substructural Means.Federico Matías Pailos - 2020 - Review of Symbolic Logic 13 (2):249-268.
    We will present a three-valued consequence relation for metainferences, called CM, defined through ST and TS, two well known substructural consequence relations for inferences. While ST recovers every classically valid inference, it invalidates some classically valid metainferences. While CM works as ST at the inferential level, it also recovers every classically valid metainference. Moreover, CM can be safely expanded with a transparent truth predicate. Nevertheless, CM cannot recapture every classically valid meta-metainference. We will afterwards develop a hierarchy of consequence relations (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  29.  33
    Another Look at the Second Incompleteness Theorem.Albert Visser - 2020 - Review of Symbolic Logic 13 (2):269-295.
    In this paper we study proofs of some general forms of the Second Incompleteness Theorem. These forms conform to the Feferman format, where the proof predicate is fixed and the representation of the set of axioms varies. We extend the Feferman framework in one important point: we allow the interpretation of number theory to vary.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  30.  46
    Modularity in Mathematics.Jeremy Avigad - 2020 - Review of Symbolic Logic 13 (1):47-79.
    In a wide range of fields, the word “modular” is used to describe complex systems that can be decomposed into smaller systems with limited interactions between them. This essay argues that mathematical knowledge can fruitfully be understood as having a modular structure and explores the ways in which modularity in mathematics is epistemically advantageous.
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark   5 citations  
  31. A Recovery Operator for Nontransitive Approaches.Eduardo Alejandro Barrio, Federico Pailos & Damian Szmuc - 2020 - Review of Symbolic Logic 13 (1):80-104.
    In some recent articles, Cobreros, Egré, Ripley, & van Rooij have defended the idea that abandoning transitivity may lead to a solution to the trouble caused by semantic paradoxes. For that purpose, they develop the Strict-Tolerant approach, which leads them to entertain a nontransitive theory of truth, where the structural rule of Cut is not generally valid. However, that Cut fails in general in the target theory of truth does not mean that there are not certain safe instances of Cut (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  32.  22
    Mechanizing Principia Logico-Metaphysica in Functional Type-Theory.Daniel Kirchner, Christoph Benzmüller & Edward N. Zalta - 2020 - Review of Symbolic Logic 13 (1):206-218.
    Principia Logico-Metaphysica contains a foundational logical theory for metaphysics, mathematics, and the sciences. It includes a canonical development of Abstract Object Theory [AOT], a metaphysical theory that distinguishes between ordinary and abstract objects.This article reports on recent work in which AOT has been successfully represented and partly automated in the proof assistant system Isabelle/HOL. Initial experiments within this framework reveal a crucial but overlooked fact: a deeply-rooted and known paradox is reintroduced in AOT when the logic of complex terms is (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  33.  51
    The Peripatetic Program in Categorical Logic: Leibniz on Propositional Terms.Marko Malink & Anubav Vasudevan - 2020 - Review of Symbolic Logic 13 (1):141-205.
    Greek antiquity saw the development of two distinct systems of logic: Aristotle’s theory of the categorical syllogism and the Stoic theory of the hypothetical syllogism. Some ancient logicians argued that hypothetical syllogistic is more fundamental than categorical syllogistic on the grounds that the latter relies on modes of propositional reasoning such asreductio ad absurdum. Peripatetic logicians, by contrast, sought to establish the priority of categorical over hypothetical syllogistic by reducing various modes of propositional reasoning to categorical form. In the 17th (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  34.  32
    Motivated Proofs: What They Are, Why They Matter and How to Write Them.Rebecca Lea Morris - 2020 - Review of Symbolic Logic 13 (1):23-46.
    Mathematicians judge proofs to possess, or lack, a variety of different qualities, including, for example, explanatory power, depth, purity, beauty and fit. Philosophers of mathematical practice have begun to investigate the nature of such qualities. However, mathematicians frequently draw attention to another desirable proof quality: being motivated. Intuitively, motivated proofs contain no "puzzling" steps, but they have received little further analysis. In this paper, I begin a philosophical investigation into motivated proofs. I suggest that a proof is motivated if and (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  35.  16
    Syllogistic Logic with Cardinality Comparisons, on Infinite Sets.Lawrence S. Moss & Selçuk Topal - 2020 - Review of Symbolic Logic 13 (1):1-22.
    This article enlarges classical syllogistic logic with assertions having to do with comparisons between the sizes of sets. So it concerns a logical system whose sentences are of the following forms: All x are y and Some x are y, There are at least as many x as y, and There are more x than y. Here x and y range over subsets of a given infinite set. Moreover, x and y may appear complemented, with the natural meaning. We formulate (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  36.  16
    Formal Representations of Dependence and Groundedness.Edoardo Rivello - 2020 - Review of Symbolic Logic 13 (1):105-140.
    We study, in an abstract and general framework, formal representations of dependence and groundedness which occur in semantic theories of truth. Our goals are: (a) to relate the different ways in which groundedness is defined according to the way dependence is represented; and (b) to represent different notions of dependence as instances of a suitable generalisation of the mathematical notion of functional dependence.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  37. Voluntary Imagination: A Fine-Grained Analysis.Ilaria Canavotto, Francesco Berto & Alessandro Giordani - 2020 - Review of Symbolic Logic:1-26.
    We study imagination as reality-oriented mental simulation : the activity of simulating nonactual scenarios in one’s mind, to investigate what would happen if they were realized. Three connected questions concerning ROMS are: What is the logic, if there is one, of such an activity? How can we gain new knowledge via it? What is voluntary in it and what is not? We address them by building a list of core features of imagination as ROMS, drawing on research in cognitive psychology (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
 Previous issues
  
Next issues