Switch to: References

Citations of:

Algebraic Methods in Philosophical Logic

Oxford, England: Oxford University Press (2001)

Add citations

You must login to add citations.
  1. Russell's completeness proof.Peter Milne - 2008 - History and Philosophy of Logic 29 (1):31-62.
    Bertrand Russell’s 1906 article ‘The Theory of Implication’ contains an algebraic weak completeness proof for classical propositional logic. Russell did not present it as such. We give an exposition of the proof and investigate Russell’s view of what he was about, whether he could have appreciated the proof for what it is, and why there is no parallel of the proof in Principia Mathematica.
    Download  
     
    Export citation  
     
    Bookmark  
  • Expanding the universe of universal logic.James Trafford - 2014 - Theoria: Revista de Teoría, Historia y Fundamentos de la Ciencia 29 (3):325-343.
    In [5], Béziau provides a means by which Gentzen’s sequent calculus can be combined with the general semantic theory of bivaluations. In doing so, according to Béziau, it is possible to construe the abstract “core” of logics in general, where logical syntax and semantics are “two sides of the same coin”. The central suggestion there is that, by way of a modification of the notion of maximal consistency, it is possible to prove the soundness and completeness for any normal logic. (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • An Inferentialist Approach to Paraconsistency.James Trafford - 2014 - Abstracta 8 (1):55-73.
    This paper develops and motivates a paraconsistent approach to semantic paradox from within a modest inferentialist framework. I begin from the bilateralist theory developed by Greg Restall, which uses constraints on assertions and denials to motivate a multiple-conclusion sequent calculus for classical logic, and, via which, classical semantics can be determined. I then use the addition of a transparent truth-predicate to motivate an intermediate speech-act. On this approach, a liar-like sentence should be “weakly asserted”, involving a commitment to the sentence (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Some Useful 16-Valued Logics: How a Computer Network Should Think.Yaroslav Shramko & Heinrich Wansing - 2005 - Journal of Philosophical Logic 34 (2):121-153.
    In Belnap's useful 4-valued logic, the set 2 = {T, F} of classical truth values is generalized to the set 4 = ������(2) = {Ø, {T}, {F}, {T, F}}. In the present paper, we argue in favor of extending this process to the set 16 = ᵍ (4) (and beyond). It turns out that this generalization is well-motivated and leads from the bilattice FOUR₂ with an information and a truth-and-falsity ordering to another algebraic structure, namely the trilattice SIXTEEN₃ with an (...)
    Download  
     
    Export citation  
     
    Bookmark   60 citations  
  • Co-constructive logic for proofs and refutations.James Trafford - 2014 - Studia Humana 3 (4):22-40.
    This paper considers logics which are formally dual to intuitionistic logic in order to investigate a co-constructive logic for proofs and refutations. This is philosophically motivated by a set of problems regarding the nature of constructive truth, and its relation to falsity. It is well known both that intuitionism can not deal constructively with negative information, and that defining falsity by means of intuitionistic negation leads, under widely-held assumptions, to a justification of bivalence. For example, we do not want to (...)
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  • Paraconsistent Logic.David Ripley - 2015 - Journal of Philosophical Logic 44 (6):771-780.
    In some logics, anything whatsoever follows from a contradiction; call these logics explosive. Paraconsistent logics are logics that are not explosive. Paraconsistent logics have a long and fruitful history, and no doubt a long and fruitful future. To give some sense of the situation, I’ll spend Section 1 exploring exactly what it takes for a logic to be paraconsistent. It will emerge that there is considerable open texture to the idea. In Section 2, I’ll give some examples of techniques for (...)
    Download  
     
    Export citation  
     
    Bookmark   15 citations  
  • Logical Geometries and Information in the Square of Oppositions.Hans Smessaert & Lorenz Demey - 2014 - Journal of Logic, Language and Information 23 (4):527-565.
    The Aristotelian square of oppositions is a well-known diagram in logic and linguistics. In recent years, several extensions of the square have been discovered. However, these extensions have failed to become as widely known as the square. In this paper we argue that there is indeed a fundamental difference between the square and its extensions, viz., a difference in informativity. To do this, we distinguish between concrete Aristotelian diagrams and, on a more abstract level, the Aristotelian geometry. We then introduce (...)
    Download  
     
    Export citation  
     
    Bookmark   24 citations  
  • Questions and Answers in an Orthoalgebraic Approach.Reinhard Blutner - 2012 - Journal of Logic, Language and Information 21 (3):237-277.
    Taking the lead from orthodox quantum theory, I will introduce a handy generalization of the Boolean approach to propositions and questions: the orthoalgebraic framework. I will demonstrate that this formalism relates to a formal theory of questions (or ‘observables’ in the physicist’s jargon). This theory allows formulating attitude questions, which normally are non-commuting, i.e., the ordering of the questions affects the answer behavior of attitude questions. Further, it allows the expression of conditional questions such as “If Mary reads the book, (...)
    Download  
     
    Export citation  
     
    Bookmark   6 citations  
  • Meaning as an inferential role.Jaroslav Peregrin - 2006 - Erkenntnis 64 (1):1-35.
    While according to the inferentialists, meaning is always a kind of inferential role, proponents of other approaches to semantics often doubt that actual meanings, as they see them, can be generally reduced to inferential roles. In this paper we propose a formal framework for considering the hypothesis of the.
    Download  
     
    Export citation  
     
    Bookmark   26 citations  
  • Requiem for logical nihilism, or: Logical nihilism annihilated.Bogdan Dicher - 2020 - Synthese 198 (8):7073-7096.
    Logical nihilism is the view that the relation of logical consequence is empty: there are counterexamples to any putative logical law. In this paper, I argue that the nihilist threat is illusory. The nihilistic arguments do not work. Moreover, the entire project is based on a misguided interpretation of the generality of logic.
    Download  
     
    Export citation  
     
    Bookmark   7 citations  
  • Almost structural completeness; an algebraic approach.Wojciech Dzik & Michał M. Stronkowski - 2016 - Annals of Pure and Applied Logic 167 (7):525-556.
    Download  
     
    Export citation  
     
    Bookmark   10 citations  
  • On Magari's concept of general calculus: notes on the history of tarski's methodology of deductive sciences.S. Roberto Arpaia - 2006 - History and Philosophy of Logic 27 (1):9-41.
    This paper is an historical study of Tarski's methodology of deductive sciences (in which a logic S is identified with an operator Cn S, called the consequence operator, on a given set of expressions), from its appearance in 1930 to the end of the 1970s, focusing on the work done in the field by Roberto Magari, Piero Mangani and by some of their pupils between 1965 and 1974, and comparing it with the results achieved by Tarski and the Polish school (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Functorial duality for ortholattices and de Morgan lattices.Katalin Bimbó - 2007 - Logica Universalis 1 (2):311-333.
    . Relational semantics for nonclassical logics lead straightforwardly to topological representation theorems of their algebras. Ortholattices and De Morgan lattices are reducts of the algebras of various nonclassical logics. We define three new classes of topological spaces so that the lattice categories and the corresponding categories of topological spaces turn out to be dually isomorphic. A key feature of all these topological spaces is that they are ordered relational or ordered product topologies.
    Download  
     
    Export citation  
     
    Bookmark   7 citations  
  • What Logics Mean: From Proof Theory to Model-Theoretic Semantics, by James W. Garson: Cambridge: Cambridge University Press, 2013, pp. xv + 285, £10.99. [REVIEW]Jaroslav Peregrin - 2015 - Australasian Journal of Philosophy 93 (3):613-616.
    Download  
     
    Export citation  
     
    Bookmark  
  • A Generalization of the Routley-Meyer Semantic Framework.Morgan Thomas - 2015 - Journal of Philosophical Logic 44 (4):411-427.
    We develop an axiomatic theory of “generalized Routley-Meyer logics.” These are first-order logics which are can be characterized by model theories in a certain generalization of Routley-Meyer semantics. We show that all GRM logics are subclassical, have recursively enumerable consequence relations, satisfy the compactness theorem, and satisfy the standard structural rules and conjunction and disjunction introduction/elimination rules. We also show that the GRM logics include classical logic, intuitionistic logic, LP/K3/FDE, and the relevant logics.
    Download  
     
    Export citation  
     
    Bookmark   5 citations  
  • The Birth of quantum logic.Miklós Rédei - 2007 - History and Philosophy of Logic 28 (2):107-122.
    By quoting extensively from unpublished letters written by John von Neumann to Garret Birkhoff during the preparatory phase (in 1935) of their ground-breaking 1936 paper that established quantum logic, the main steps in the thought process leading to the 1936 Birkhoff–von Neumann paper are reconstructed. The reconstruction makes it clear why Birkhoff and von Neumann rejected the notion of quantum logic as the projection lattice of an infinite dimensional complex Hilbert space and why they postulated in their 1936 paper that (...)
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  • Hyper-contradictions, generalized truth values and logics of truth and falsehood.Yaroslav Shramko & Heinrich Wansing - 2006 - Journal of Logic, Language and Information 15 (4):403-424.
    In Philosophical Logic, the Liar Paradox has been used to motivate the introduction of both truth value gaps and truth value gluts. Moreover, in the light of “revenge Liar” arguments, also higher-order combinations of generalized truth values have been suggested to account for so-called hyper-contradictions. In the present paper, Graham Priest's treatment of generalized truth values is scrutinized and compared with another strategy of generalizing the set of classical truth values and defining an entailment relation on the resulting sets of (...)
    Download  
     
    Export citation  
     
    Bookmark   30 citations  
  • Semantics for dual and symmetric combinatory calculi.Katalin Bimbó - 2004 - Journal of Philosophical Logic 33 (2):125-153.
    We define dual and symmetric combinatory calculi (inequational and equational ones), and prove their consistency. Then, we introduce algebraic and set theoretical relational and operational - semantics, and prove soundness and completeness. We analyze the relationship between these logics, and argue that inequational dual logics are the best suited to model computation.
    Download  
     
    Export citation  
     
    Bookmark   6 citations  
  • Duality and Inferential Semantics.James Trafford - 2015 - Axiomathes 25 (4):495-513.
    It is well known that classical inferentialist semantics runs into problems regarding abnormal valuations. It is equally well known that the issues can be resolved if we construct the inference relation in a multiple-conclusion sequent calculus. The latter has been prominently developed in recent work by Restall, with the guiding interpretation that the valid sequent says that the simultaneous assertion of all of Γ with the denial of all of Δ is incoherent. However, such structures face significant interpretive challenges, and (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Weakly Implicative (Fuzzy) Logics I: Basic Properties. [REVIEW]Petr Cintula - 2006 - Archive for Mathematical Logic 45 (6):673-704.
    This paper presents two classes of propositional logics (understood as a consequence relation). First we generalize the well-known class of implicative logics of Rasiowa and introduce the class of weakly implicative logics. This class is broad enough to contain many “usual” logics, yet easily manageable with nice logical properties. Then we introduce its subclass–the class of weakly implicative fuzzy logics. It contains the majority of logics studied in the literature under the name fuzzy logic. We present many general theorems for (...)
    Download  
     
    Export citation  
     
    Bookmark   29 citations  
  • Contradictory Information: Too Much of a Good Thing. [REVIEW]J. Michael Dunn - 2010 - Journal of Philosophical Logic 39 (4):425 - 452.
    Both I and Belnap, motivated the "Belnap-Dunn 4-valued Logic" by talk of the reasoner being simply "told true" (T) and simply "told false" (F), which leaves the options of being neither "told true" nor "told false" (N), and being both "told true" and "told false" (B). Belnap motivated these notions by consideration of unstructured databases that allow for negative information as well as positive information (even when they conflict). We now experience this on a daily basis with the Web. But (...)
    Download  
     
    Export citation  
     
    Bookmark   12 citations  
  • Minimally generated abstract logics.Steffen Lewitzka & Andreas B. M. Brunner - 2009 - Logica Universalis 3 (2):219-241.
    In this paper we study an alternative approach to the concept of abstract logic and to connectives in abstract logics. The notion of abstract logic was introduced by Brown and Suszko —nevertheless, similar concepts have been investigated by various authors. Considering abstract logics as intersection structures we extend several notions to their κ -versions, introduce a hierarchy of κ -prime theories, which is important for our treatment of infinite connectives, and study different concepts of κ -compactness. We are particularly interested (...)
    Download  
     
    Export citation  
     
    Bookmark   5 citations  
  • A positive information logic for inferential information.Sebastian Sequoiah-Grayson - 2009 - Synthese 167 (2):409 - 431.
    Performing an inference involves irreducibly dynamic cognitive procedures. The article proposes that a non-associative information frame, corresponding to a residuated pogroupoid, underpins the information structure involved. The argument proceeds by expounding the informational turn in logic, before outlining the cognitive actions at work in deductive inference. The structural rules of Weakening, Contraction, Commutation, and Association are rejected on the grounds that they cause us to lose track of the information flow in inferential procedures. By taking the operation of information application (...)
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  • Logics for classes of Boolean monoids.Gerard Allwein, Hilmi Demir & Lee Pike - 2004 - Journal of Logic, Language and Information 13 (3):241-266.
    This paper presents the algebraic and Kripke modelsoundness and completeness ofa logic over Boolean monoids. An additional axiom added to thelogic will cause the resulting monoid models to be representable as monoidsof relations. A star operator, interpreted as reflexive, transitiveclosure, is conservatively added to the logic. The star operator isa relative modal operator, i.e., one that is defined in terms ofanother modal operator. A further example, relative possibility,of this type of operator is given. A separate axiom,antilogism, added to the logic (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Order- dual realational semantics for non-distributive propositional logics.Chrysafis Hartonas - 2016 - Logic Journal of the IGPL 25 (2):145-182.
    This article addresses and resolves some issues of relational, Kripke-style, semantics for the logics of bounded lattice expansions with operators of well-defined distribution types, focusing on the case where the underlying lattice is not assumed to be distributive. It therefore falls within the scope of the theory of Generalized Galois Logics, introduced by Dunn, and it contributes to its extension. We introduce order-dual relational semantics and present a semantic analysis and completeness theorems for non-distributive lattice logic with n -ary additive (...)
    Download  
     
    Export citation  
     
    Bookmark   9 citations  
  • Inferentializing Semantics.Jaroslav Peregrin - 2010 - Journal of Philosophical Logic 39 (3):255 - 274.
    The entire development of modern logic is characterized by various forms of confrontation of what has come to be called proof theory with what has earned the label of model theory. For a long time the widely accepted view was that while model theory captures directly what logical formalisms are about, proof theory is merely our technical means of getting some incomplete grip on this; but in recent decades the situation has altered. Not only did proof theory expand into new (...)
    Download  
     
    Export citation  
     
    Bookmark   9 citations  
  • Varieties of misrepresentation and homomorphism.Francesca Pero & Mauricio Suárez - 2016 - European Journal for Philosophy of Science 6 (1):71-90.
    This paper is a critical response to Andreas Bartels’ sophisticated defense of a structural account of scientific representation. We show that, contrary to Bartels’ claim, homomorphism fails to account for the phenomenon of misrepresentation. Bartels claims that homomorphism is adequate in two respects. First, it is conceptually adequate, in the sense that it shows how representation differs from misrepresentation and non-representation. Second, if properly weakened, homomorphism is formally adequate to accommodate misrepresentation. We question both claims. First, we show that homomorphism (...)
    Download  
     
    Export citation  
     
    Bookmark   11 citations  
  • Residuation subreducts of pocrigs.Janis Cırulis - 2010 - Bulletin of the Section of Logic 39 (1/2):11-16.
    Download  
     
    Export citation  
     
    Bookmark  
  • Possible Worlds in Use.Andrzej Indrzejczak - 2011 - Studia Logica 99 (1-3):229-248.
    The paper is a brief survey of the most important semantic constructions founded on the concept of possible world. It is impossible to capture in one short paper the whole variety of the problems connected with manifold applications of possible worlds. Hence, after a brief explanation of some philosophical matters I take a look at possible worlds from rather technical standpoint of logic and focus on the applications in formal semantics. In particular, I would like to focus on the fruitful (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • From Modal Discourse to Possible Worlds.Maxwell J. Cresswell - 2006 - Studia Logica 82 (3):307-327.
    The possible-worlds semantics for modality says that a sentence is possibly true if it is true in some possible world. Given classical prepositional logic, one can easily prove that every consistent set of propositions can be embedded in a ‘maximal consistent set’, which in a sense represents a possible world. However the construction depends on the fact that standard modal logics are finitary, and it seems false that an infinite collection of sets of sentences each finite subset of which is (...)
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  • Symmetric Categorial Grammar.Michael Moortgat - 2009 - Journal of Philosophical Logic 38 (6):681-710.
    The Lambek-Grishin calculus is a symmetric version of categorial grammar obtained by augmenting the standard inventory of type-forming operations (product and residual left and right division) with a dual family: coproduct, left and right difference. Interaction between these two families is provided by distributivity laws. These distributivity laws have pleasant invariance properties: stability of interpretations for the Curry-Howard derivational semantics, and structure-preservation at the syntactic end. The move to symmetry thus offers novel ways of reconciling the demands of natural language (...)
    Download  
     
    Export citation  
     
    Bookmark   5 citations