Year:

  1.  28
    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  
  2.  15
    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  
  3.  18
    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  
  4.  10
    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  
  5.  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  
  6.  22
    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  
  7.  3
    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  
  8.  12
    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  
  9.  19
    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  
  10.  27
    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  
  11.  33
    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   3 citations  
  12. 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   1 citation  
  13.  14
    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  
  14.  43
    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 as reductio 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 (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  15.  17
    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   1 citation  
  16.  12
    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  
  17.  13
    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  
  18.  3
    A Note on the Cut-Elimination Proof in “Truth Without Contraction”.Andreas Fjellstad - 2020 - Review of Symbolic Logic:1-5.
    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 (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
 Previous issues
  
Next issues