Switch to: References

Add citations

You must login to add citations.
  1. Replacement in Logic.Lloyd Humberstone - 2013 - Journal of Philosophical Logic 42 (1):49-89.
    We study a range of issues connected with the idea of replacing one formula by another in a fixed context. The replacement core of a consequence relation ⊢ is the relation holding between a set of formulas {A1,..., Am,...} and a formula B when for every context C, we have C,..., C,... ⊢ C. Section 1 looks at some differences between which inferences are lost on passing to the replacement cores of the classical and intuitionistic consequence relations. For example, we (...)
    Download  
     
    Export citation  
     
    Bookmark   5 citations  
  • Propositional Logics Related to Heyting's and Johansson's.Krister Segerberg - 1968 - Theoria 34 (1):26-61.
    Download  
     
    Export citation  
     
    Bookmark   54 citations  
  • Conservativeness and uniqueness.Peter Schroeder-Heister - 1985 - Theoria 51 (3):159-173.
    Download  
     
    Export citation  
     
    Bookmark   14 citations  
  • Identical twins, deduction theorems, and pattern functions: Exploring the implicative BCsK fragment of S. [REVIEW]Lloyd Humberstone - 2007 - Journal of Philosophical Logic 36 (5):435 - 487.
    We recapitulate (Section 1) some basic details of the system of implicative BCSK logic, which has two primitive binary implicational connectives, and which can be viewed as a certain fragment of the modal logic S5. From this modal perspective we review (Section 2) some results according to which the pure sublogic in either of these connectives (i.e., each considered without the other) is an exact replica of the material implication fragment of classical propositional logic. In Sections 3 and 5 we (...)
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  • Logical Friendliness and Sympathy in Logic.David C. Makinson - 2005 - In Jean-Yves Béziau (ed.), Logica Universalis: Towards a General Theory of Logic. Boston: Birkhäuser Verlog. pp. 191--205.
    Defines and examines a notion of logical friendliness, a broadening of the familiar notion of classical consequence. Also reviews familiar notions and operations with which friendliness makes contact, providing a new light in which they may be seen.
    Download  
     
    Export citation  
     
    Bookmark  
  • Matrix approach in methodology of sentential calculi.Ryszard Wójcicki - 1973 - Studia Logica 32 (1):7 - 39.
    Download  
     
    Export citation  
     
    Bookmark   82 citations  
  • What is a Rule of Inference?Neil Tennant - 2021 - Review of Symbolic Logic 14 (2):307-346.
    We explore the problems that confront any attempt to explain or explicate exactly what a primitive logical rule of inferenceis, orconsists in. We arrive at a proposed solution that places a surprisingly heavy load on the prospect of being able to understand and deal with specifications of rules that are essentiallyself-referring. That is, any rule$\rho $is to be understood via a specification that involves, embedded within it, reference to rule$\rho $itself. Just how we arrive at this position is explained by (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • On Some Mistaken Beliefs About Core Logic and Some Mistaken Core Beliefs About Logic.Neil Tennant - 2018 - Notre Dame Journal of Formal Logic 59 (4):559-578.
    This is in part a reply to a recent work of Vidal-Rosset, which expresses various mistaken beliefs about Core Logic. Rebutting these leads us further to identify, and argue against, some mistaken core beliefs about logic.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Discriminator logics.Matthew Spinks, Robert Bignall & Robert Veroff - 2014 - Australasian Journal of Logic 11 (2).
    A discriminator logic is the 1 -assertional logic of a discriminator variety V having two constant terms 0 and 1 such that V ⊨ 0 1 iff every member of V is trivial. Examples of such logics abound in the literature. The main result of this research announcement asserts that a certain non-Fregean deductive system SBPC, which closely resembles the classical propositional calculus, is canonical for the class of discriminator logics in the sense that any discriminator logic S can be (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • Classical Logic with n Truth Values as a Symmetric Many-Valued Logic.A. Salibra, A. Bucciarelli, A. Ledda & F. Paoli - 2020 - Foundations of Science 28 (1):115-142.
    We introduce Boolean-like algebras of dimension n ($$n{\mathrm {BA}}$$ n BA s) having n constants $${{{\mathsf {e}}}}_1,\ldots,{{{\mathsf {e}}}}_n$$ e 1, …, e n, and an $$(n+1)$$ ( n + 1 ) -ary operation q (a “generalised if-then-else”) that induces a decomposition of the algebra into n factors through the so-called n-central elements. Varieties of $$n{\mathrm {BA}}$$ n BA s share many remarkable properties with the variety of Boolean algebras and with primal varieties. The $$n{\mathrm {BA}}$$ n BA s provide the (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Algebraic study of Sette's maximal paraconsistent logic.Alexej P. Pynko - 1995 - Studia Logica 54 (1):89 - 128.
    The aim of this paper is to study the paraconsistent deductive systemP 1 within the context of Algebraic Logic. It is well known due to Lewin, Mikenberg and Schwarse thatP 1 is algebraizable in the sense of Blok and Pigozzi, the quasivariety generated by Sette's three-element algebraS being the unique quasivariety semantics forP 1. In the present paper we prove that the mentioned quasivariety is not a variety by showing that the variety generated byS is not equivalent to any algebraizable (...)
    Download  
     
    Export citation  
     
    Bookmark   12 citations  
  • The deducibilities of S.Jean Porte - 1981 - Journal of Philosophical Logic 10 (4):409 - 422.
    Download  
     
    Export citation  
     
    Bookmark   6 citations  
  • What is a Non-truth-functional Logic?João Marcos - 2009 - Studia Logica 92 (2):215-240.
    What is the fundamental insight behind truth-functionality ? When is a logic interpretable by way of a truth-functional semantics? To address such questions in a satisfactory way, a formal definition of truth-functionality from the point of view of abstract logics is clearly called for. As a matter of fact, such a definition has been available at least since the 70s, though to this day it still remains not very widely well-known. A clear distinction can be drawn between logics characterizable through: (...)
    Download  
     
    Export citation  
     
    Bookmark   7 citations  
  • For Want of an ‘And’: A Puzzle about Non-Conservative Extension.Lloyd Humberstone - 2005 - History and Philosophy of Logic 26 (3):229-266.
    Section 1 recalls a point noted by A. N. Prior forty years ago: that a certain formula in the language of a purely implicational intermediate logic investigated by R. A. Bull is unprovable in that logic but provable in the extension of the logic by the usual axioms for conjunction, once this connective is added to the language. Section 2 reminds us that every formula is interdeducible with (i.e. added to intuitionistic logic, yields the same intermediate logic as) some conjunction-free (...)
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • Algebraic Study of Two Deductive Systems of Relevance Logic.Josep Maria Font & Gonzalo Rodríguez - 1994 - Notre Dame Journal of Formal Logic 35 (3):369-397.
    In this paper two deductive systems associated with relevance logic are studied from an algebraic point of view. One is defined by the familiar, Hilbert-style, formalization of R; the other one is a weak version of it, called WR, which appears as the semantic entailment of the Meyer-Routley-Fine semantics, and which has already been suggested by Wójcicki for other reasons. This weaker consequence is first defined indirectly, using R, but we prove that the first one turns out to be an (...)
    Download  
     
    Export citation  
     
    Bookmark   18 citations  
  • Zero-place operations and functional completeness, and the definition of new connectives.I. L. Humberstone - 1993 - History and Philosophy of Logic 14 (1):39-66.
    Tarski 1968 makes a move in the course of providing an account of ?definitionally equivalent? classes of algebras with a businesslike lack of fanfare and commentary, the significance of which may accordingly be lost on the casual reader. In ?1 we present this move as a response to a certain difficulty in the received account of what it is to define a function symbol (or ?operation symbol?). This difficulty, which presents itself as a minor technicality needing to be got around (...)
    Download  
     
    Export citation  
     
    Bookmark   5 citations  
  • Supervenience, Dependence, Disjunction.Lloyd Humberstone - forthcoming - Logic and Logical Philosophy:1.
    Download  
     
    Export citation  
     
    Bookmark   8 citations  
  • (1 other version)Identical Twins, Deduction Theorems, and Pattern Functions: Exploring the Implicative BCSK Fragment of S5.Lloyd Humberstone - 2006 - Journal of Philosophical Logic 35 (5):435-487.
    We recapitulate (Section 1) some basic details of the system of implicative BCSK logic, which has two primitive binary implicational connectives, and which can be viewed as a certain fragment of the modal logic S5. From this modal perspective we review (Section 2) some results according to which the pure sublogic in either of these connectives (i.e., each considered without the other) is an exact replica of the material implication fragment of classical propositional logic. In Sections 3 and 5 we (...)
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  • Explicating Logical Independence.Lloyd Humberstone - 2020 - Journal of Philosophical Logic 49 (1):135-218.
    Accounts of logical independence which coincide when applied in the case of classical logic diverge elsewhere, raising the question of what a satisfactory all-purpose account of logical independence might look like. ‘All-purpose’ here means: working satisfactorily as applied across different logics, taken as consequence relations. Principal candidate characterizations of independence relative to a consequence relation are that there the consequence relation concerned is determined by only by classes of valuations providing for all possible truth-value combinations for the formulas whose independence (...)
    Download  
     
    Export citation  
     
    Bookmark   8 citations  
  • On the Equivalence for Non‐Derivability Testing of Finite Smiley Models and Finite Modified Smiley Models.Ronald Harrop - 1971 - Mathematical Logic Quarterly 17 (1):137-143.
    Download  
     
    Export citation  
     
    Bookmark  
  • On the Closure Properties of the Class of Full G-models of a Deductive System.Josep Maria Font, Ramon Jansana & Don Pigozzi - 2006 - Studia Logica 83 (1-3):215-278.
    In this paper we consider the structure of the class FGModS of full generalized models of a deductive system S from a universal-algebraic point of view, and the structure of the set of all the full generalized models of S on a fixed algebra A from the lattice-theoretical point of view; this set is represented by the lattice FACSs A of all algebraic closed-set systems C on A such that (A, C) ε FGModS. We relate some properties of these structures (...)
    Download  
     
    Export citation  
     
    Bookmark   9 citations  
  • A mind of a non-countable set of ideas.Alexander Citkin - 2008 - Logic and Logical Philosophy 17 (1-2):23-39.
    The paper is dedicated to the 80th birthday of the outstanding Russian logician A.V. Kuznetsov. It is addressing a history of the ideas and research conducted by him in non-classical and intermediate logics.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Synonymy and Intra-Theoretical Pluralism.Patrick Allo - 2015 - Australasian Journal of Philosophy 93 (1):77-91.
    The starting point of this paper is a version of intra-theoretical pluralism that was recently proposed by Hjortland [2013]. In a first move, I use synonymy-relations to formulate an intuitively compelling objection against Hjortland's claim that, if one uses a single calculus to characterise the consequence relations of the paraconsistent logic LP and the paracomplete logic K3, one immediately obtains multiple consequence relations for a single language and hence a reply to the Quinean charge of meaning variance. In a second (...)
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  • Full Models for Sentential Logics.Josep Maria Font & Ramon Jansana - 1995 - Bulletin of the Section of Logic 24 (3):123-131.
    Download  
     
    Export citation  
     
    Bookmark  
  • Hard and Soft Logical Information.Allo Patrick - 2017 - Journal of Logic and Computation:1-20.
    In this paper I use the distinction between hard and soft information from the dynamic epistemic logic tradition to extend prior work on informational conceptions of logic to include non-monotonic consequence-relations. In particular, I defend the claim that at least some non-monotonic logics can be understood on the basis of soft or “belief-like” logical information, and thereby question the orthodox view that all logical information is hard, “knowledge-like”, information.
    Download  
     
    Export citation  
     
    Bookmark  
  • Sentence connectives in formal logic.Lloyd Humberstone - forthcoming - Stanford Encyclopedia of Philosophy.
    Download  
     
    Export citation  
     
    Bookmark   11 citations