Results for 'propositional logic'

1000+ found
Order:
  1. Completeness Before Post: Bernays, Hilbert, and the Development of Propositional Logic.Richard Zach - 1999 - Bulletin of Symbolic Logic 5 (3):331-366.
    Some of the most important developments of symbolic logic took place in the 1920s. Foremost among them are the distinction between syntax and semantics and the formulation of questions of completeness and decidability of logical systems. David Hilbert and his students played a very important part in these developments. Their contributions can be traced to unpublished lecture notes and other manuscripts by Hilbert and Bernays dating to the period 1917-1923. The aim of this paper is to describe these results, (...)
    Download  
     
    Export citation  
     
    Bookmark   24 citations  
  2. Raval’s Method a Simplified Approach to Propositional Logic Arguments.Ravinder Kumar Singh - manuscript
    Basic Argument forms Modus Ponens , Modus Tollens , Hypothetical Syllogism and Dilemma contains ‘If –then’ conditions. Conclusions from the Arguments containing ‘If –then’ conditions can be deduced very easily without any significant memorization by applying Raval’s method. Method: In Raval’s method If P then Q is written as P (2$) – Q (1$) and viewed numerically, in currency form i.e. P is viewed as 2$ and Q is viewed as 1$ and implications from this notations are valid conclusions. If (...)
    Download  
     
    Export citation  
     
    Bookmark  
  3. What is the Logic of Propositional Identity?Charles Sayward - 2006 - Logic and Logical Philosophy 15 (1):3-15.
    Propositional identity is not expressed by a predicate. So its logic is not given by the ordinary first order axioms for identity. What are the logical axioms governing this concept, then? Some axioms in addition to those proposed by Arthur Prior are proposed.
    Download  
     
    Export citation  
     
    Bookmark  
  4. Stoic Sequent Logic and Proof Theory.Susanne Bobzien - 2019 - History and Philosophy of Logic 40 (3):234-265.
    This paper contends that Stoic logic (i.e. Stoic analysis) deserves more attention from contemporary logicians. It sets out how, compared with contemporary propositional calculi, Stoic analysis is closest to methods of backward proof search for Gentzen-inspired substructural sequent logics, as they have been developed in logic programming and structural proof theory, and produces its proof search calculus in tree form. It shows how multiple similarities to Gentzen sequent systems combine with intriguing dissimilarities that may enrich contemporary discussion. (...)
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  5. Stoic Logic.Susanne Bobzien - 2003 - In Brad Inwood (ed.), The Cambridge Companion to Stoic Philosophy. Cambridge University Press.
    ABSTRACT: An introduction to Stoic logic. Stoic logic can in many respects be regarded as a fore-runner of modern propositional logic. I discuss: 1. the Stoic notion of sayables or meanings (lekta); the Stoic assertibles (axiomata) and their similarities and differences to modern propositions; the time-dependency of their truth; 2.-3. assertibles with demonstratives and quantified assertibles and their truth-conditions; truth-functionality of negations and conjunctions; non-truth-functionality of disjunctions and conditionals; language regimentation and ‘bracketing’ devices; Stoic basic principles (...)
    Download  
    Translate
     
     
    Export citation  
     
    Bookmark   6 citations  
  6. Forall X: Calgary. An Introduction to Formal Logic.P. D. Magnus, Tim Button, Aaron Thomas-Bolduc, Richard Zach & Robert Trueman - 2020
    forall x: Calgary is a full-featured textbook on formal logic. It covers key notions of logic such as consequence and validity of arguments, the syntax of truth-functional propositional logic TFL and truth-table semantics, the syntax of first-order (predicate) logic FOL with identity (first-order interpretations), translating (formalizing) English in TFL and FOL, and Fitch-style natural deduction proof systems for both TFL and FOL. It also deals with some advanced topics such as truth-functional completeness and modal (...). Exercises with solutions are available. It is provided in PDF (for screen reading, printing, and a special version for dyslexics) and in LaTeX source code. (shrink)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  7. Dynamic Semantics, Imperative Logic and Propositional Attitudes.Berislav Žarnić - 2002 - Uppsala Universitet.
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  8. Force, Content and Logic.Michael Schmitz - 2019 - In Gabriele M. Mras, Paul Weingartner & Bernhard Ritter (eds.), Philosophy of Logic and Mathematics: Contributions of the 41st International Wittgenstein Symposium. pp. 221-223.
    The Frege point to the effect that e.g. the clauses of conditionals are not asserted and therefore cannot be assertions is often taken to establish a dichotomy between the content of a speech act, which is propositional and belongs to logic and semantics, and its force, which belongs to pragmatics. Recently this dichotomy has been questioned by philosophers such as Peter Hanks and Francois Recanati, who propose act-theoretic accounts of propositions, argue that we can’t account for propositional (...)
    Download  
     
    Export citation  
     
    Bookmark  
  9. Quantified Propositional Gödel Logics.Matthias Baaz, Agata Ciabattoni & Richard Zach - 2000 - In Andrei Voronkov & Michel Parigot (eds.), Logic for Programming and Automated Reasoning. 7th International Conference, LPAR 2000. Berlin: Springer. pp. 240-256.
    It is shown that Gqp↑, the quantified propositional Gödel logic based on the truth-value set V↑ = {1 - 1/n : n≥1}∪{1}, is decidable. This result is obtained by reduction to Büchi's theory S1S. An alternative proof based on elimination of quantifiers is also given, which yields both an axiomatization and a characterization of Gqp↑ as the intersection of all finite-valued quantified propositional Gödel logics.
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  10.  22
    VALIDITY: A Learning Game Approach to Mathematical Logic.Steven James Bartlett - 1973, 1974, 2014 - Hartford, CT: Lebon Press.
    The first learning game to be developed to help students to develop and hone skills in constructing proofs in both the propositional and first-order predicate calculi. It comprises an autotelic (self-motivating) learning approach to assist students in developing skills and strategies of proof in the propositional and predicate calculus. The text of VALIDITY consists of a general introduction that describes earlier studies made of autotelic learning games, paying particular attention to work done at the Law School of Yale (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  11. On the Logic of Common Belief and Common Knowledge.Luc Lismont & Philippe Mongin - 1994 - Theory and Decision 37 (1):75-106.
    The paper surveys the currently available axiomatizations of common belief (CB) and common knowledge (CK) by means of modal propositional logics. (Throughout, knowledge- whether individual or common- is defined as true belief.) Section 1 introduces the formal method of axiomatization followed by epistemic logicians, especially the syntax-semantics distinction, and the notion of a soundness and completeness theorem. Section 2 explains the syntactical concepts, while briefly discussing their motivations. Two standard semantic constructions, Kripke structures and neighbourhood structures, are introduced in (...)
    Download  
     
    Export citation  
     
    Bookmark   17 citations  
  12. A Note on Carnap’s Result and the Connectives.Tristan Haze - 2019 - Axiomathes 29 (3):285-288.
    Carnap’s result about classical proof-theories not ruling out non-normal valuations of propositional logic formulae has seen renewed philosophical interest in recent years. In this note I contribute some considerations which may be helpful in its philosophical assessment. I suggest a vantage point from which to see the way in which classical proof-theories do, at least to a considerable extent, encode the meanings of the connectives (not by determining a range of admissible valuations, but in their own way), and (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  13. The Sign of Consequence.Francesco Bellucci - 2016 - The Digital Encyclopedia of Peirce Studies 1:1-5.
    The “sign of consequence” is a notation for propositional logic that Peirce invented in 1886 and used at least until 1894. It substituted the “copula of inclusion” which he had been using since 1870.
    Download  
     
    Export citation  
     
    Bookmark  
  14. Genuine Process Logic.Wolfgang Sohst - 2017 - Collected Lectures of MoMo Berlin.
    The Genuine Process Logic described here (abbreviation: GPL) places the object-bound process itself at the center of formalism. It should be suitable for everyday use, i.e. it is not primarily intended for the formalization of computer programs, but instead, as a counter-conception to the classical state logics. The new and central operator of the GPL is an action symbol replacing the classical state symbols, e.g. of equivalence or identity. The complete renunciation of object-language state expressions also results in a (...)
    Download  
     
    Export citation  
     
    Bookmark  
  15.  60
    Epistemic Multilateral Logic.Luca Incurvati & Julian J. Schlöder - forthcoming - Review of Symbolic Logic:1-44.
    We present epistemic multilateral logic, a general logical framework for reasoning involving epistemic modality. Standard bilateral systems use propositional formulae marked with signs for assertion and rejection. Epistemic multilateral logic extends standard bilateral systems with a sign for the speech act of weak assertion (Incurvati and Schlöder 2019) and an operator for epistemic modality. We prove that epistemic multilateral logic is sound and complete with respect to the modal logic S5 modulo an appropriate translation. The (...)
    Download  
     
    Export citation  
     
    Bookmark  
  16. Logics for Modelling Collective Attitudes.Daniele Porello - 2018 - Fundamenta Infromaticae 158 (1-3):239-27.
    We introduce a number of logics to reason about collective propositional attitudes that are defined by means of the majority rule. It is well known that majoritarian aggregation is subject to irrationality, as the results in social choice theory and judgment aggregation show. The proposed logics for modelling collective attitudes are based on a substructural propositional logic that allows for circumventing inconsistent outcomes. Individual and collective propositional attitudes, such as beliefs, desires, obligations, are then modelled by (...)
    Download  
     
    Export citation  
     
    Bookmark  
  17. A Logic of Justification and Truthmaking.Alessandro Giordani - 2013 - Review of Symbolic Logic 6 (2):323-342.
    In the present paper we propose a system of propositional logic for reasoning about justification, truthmaking, and the connection between justifiers and truthmakers. The logic of justification and truthmaking is developed according to the fundamental ideas introduced by Artemov. Justifiers and truthmakers are treated in a similar way, exploiting the intuition that justifiers provide epistemic grounds for propositions to be considered true, while truthmakers provide ontological grounds for propositions to be true. This system of logic is (...)
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  18. Completeness of an Ancient Logic.John Corcoran - 1972 - Journal of Symbolic Logic 37 (4):696-702.
    In previous articles, it has been shown that the deductive system developed by Aristotle in his "second logic" is a natural deduction system and not an axiomatic system as previously had been thought. It was also stated that Aristotle's logic is self-sufficient in two senses: First, that it presupposed no other logical concepts, not even those of propositional logic; second, that it is (strongly) complete in the sense that every valid argument expressible in the language of (...)
    Download  
     
    Export citation  
     
    Bookmark   54 citations  
  19. Proofnets for S5: Sequents and Circuits for Modal Logic.Greg Restall - 2007 - In C. Dimitracopoulos, L. Newelski & D. Normann (eds.), Logic Colloquium 2005. Cambridge: Cambridge University Press. pp. 151-172.
    In this paper I introduce a sequent system for the propositional modal logic S5. Derivations of valid sequents in the system are shown to correspond to proofs in a novel natural deduction system of circuit proofs (reminiscient of proofnets in linear logic, or multiple-conclusion calculi for classical logic). -/- The sequent derivations and proofnets are both simple extensions of sequents and proofnets for classical propositional logic, in which the new machinery—to take account of the (...)
    Download  
     
    Export citation  
     
    Bookmark   12 citations  
  20. The Logic of Partitions: Introduction to the Dual of the Logic of Subsets: The Logic of Partitions.David Ellerman - 2010 - Review of Symbolic Logic 3 (2):287-350.
    Modern categorical logic as well as the Kripke and topological models of intuitionistic logic suggest that the interpretation of ordinary “propositionallogic should in general be the logic of subsets of a given universe set. Partitions on a set are dual to subsets of a set in the sense of the category-theoretic duality of epimorphisms and monomorphisms—which is reflected in the duality between quotient objects and subobjects throughout algebra. If “propositionallogic is thus (...)
    Download  
     
    Export citation  
     
    Bookmark   6 citations  
  21. Modal Logic S4 as a Paraconsistent Logic with a Topological Semantics.Marcelo E. Coniglio & Leonardo Prieto-Sanabria - 2017 - In Carlos Caleiro, Francisco Dionisio, Paula Gouveia, Paulo Mateus & João Rasga (eds.), Logic and Computation: Essays in Honour of Amilcar Sernadas. London, UK: College Publications. pp. 171-196.
    In this paper the propositional logic LTop is introduced, as an extension of classical propositional logic by adding a paraconsistent negation. This logic has a very natural interpretation in terms of topological models. The logic LTop is nothing more than an alternative presentation of modal logic S4, but in the language of a paraconsistent logic. Moreover, LTop is a logic of formal inconsistency in which the consistency and inconsistency operators have a (...)
    Download  
     
    Export citation  
     
    Bookmark  
  22. What is the Correct Logic of Necessity, Actuality and Apriority?Peter Fritz - 2014 - Review of Symbolic Logic 7 (3):385-414.
    This paper is concerned with a propositional modal logic with operators for necessity, actuality and apriority. The logic is characterized by a class of relational structures defined according to ideas of epistemic two-dimensional semantics, and can therefore be seen as formalizing the relations between necessity, actuality and apriority according to epistemic two-dimensional semantics. We can ask whether this logic is correct, in the sense that its theorems are all and only the informally valid formulas. This paper (...)
    Download  
     
    Export citation  
     
    Bookmark   7 citations  
  23. The Founding of Logic.John Corcoran - 1994 - Ancient Philosophy 14 (S1):9-24.
    Since the time of Aristotle's students, interpreters have considered Prior Analytics to be a treatise about deductive reasoning, more generally, about methods of determining the validity and invalidity of premise-conclusion arguments. People studied Prior Analytics in order to learn more about deductive reasoning and to improve their own reasoning skills. These interpreters understood Aristotle to be focusing on two epistemic processes: first, the process of establishing knowledge that a conclusion follows necessarily from a set of premises (that is, on the (...)
    Download  
     
    Export citation  
     
    Bookmark   14 citations  
  24.  63
    Hyperlogic: A System for Talking About Logics.Alexander W. Kocurek - 2019 - Proceedings for the 22nd Amsterdam Colloquium.
    Sentences about logic are often used to show that certain embedding expressions, including attitude verbs, conditionals, and epistemic modals, are hyperintensional. Yet it not clear how to regiment “logic talk” in the object language so that it can be compositionally embedded under such expressions. This paper does two things. First, it argues against a standard account of logic talk, viz., the impossible worlds semantics. It is shown that this semantics does not easily extend to a language with (...)
    Download  
     
    Export citation  
     
    Bookmark  
  25. Modal Logic with Names.George Gargov & Valentin Goranko - 1993 - Journal of Philosophical Logic 22 (6):607 - 636.
    We investigate an enrichment of the propositional modal language L with a "universal" modality ■ having semantics x ⊧ ■φ iff ∀y(y ⊧ φ), and a countable set of "names" - a special kind of propositional variables ranging over singleton sets of worlds. The obtained language ℒ $_{c}$ proves to have a great expressive power. It is equivalent with respect to modal definability to another enrichment ℒ(⍯) of ℒ, where ⍯ is an additional modality with the semantics x (...)
    Download  
     
    Export citation  
     
    Bookmark   47 citations  
  26. A New Semantics for Systems of Logic of Essence.Alessandro Giordani - 2014 - Studia Logica 102 (3):411-440.
    The purpose of the present paper is to provide a way of understanding systems of logic of essence by introducing a new semantic framework for them. Three central results are achieved: first, the now standard Fitting semantics for the propositional logic of evidence is adapted in order to provide a new, simplified semantics for the propositional logic of essence; secondly, we show how it is possible to construe the concept of necessary truth explicitly by using (...)
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  27. Hypersequents and the Proof Theory of Intuitionistic Fuzzy Logic.Matthias Baaz & Richard Zach - 2000 - In Peter G. Clote & Helmut Schwichtenberg (eds.), Computer Science Logic. 14th International Workshop, CSL 2000. Berlin: Springer. pp. 187– 201.
    Takeuti and Titani have introduced and investigated a logic they called intuitionistic fuzzy logic. This logic is characterized as the first-order Gödel logic based on the truth value set [0,1]. The logic is known to be axiomatizable, but no deduction system amenable to proof-theoretic, and hence, computational treatment, has been known. Such a system is presented here, based on previous work on hypersequent calculi for propositional Gödel logics by Avron. It is shown that the (...)
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  28. Ancient Logic and its Modern Interpretations.John Corcoran (ed.) - 1974 - Boston: Reidel.
    This book treats ancient logic: the logic that originated in Greece by Aristotle and the Stoics, mainly in the hundred year period beginning about 350 BCE. Ancient logic was never completely ignored by modern logic from its Boolean origin in the middle 1800s: it was prominent in Boole’s writings and it was mentioned by Frege and by Hilbert. Nevertheless, the first century of mathematical logic did not take it seriously enough to study the ancient (...) texts. A renaissance in ancient logic studies occurred in the early 1950s with the publication of the landmark Aristotle’s Syllogistic by Jan Łukasiewicz, Oxford UP 1951, 2nd ed. 1957. Despite its title, it treats the logic of the Stoics as well as that of Aristotle. Łukasiewicz was a distinguished mathematical logician. He had created many-valued logic and the parenthesis-free prefix notation known as Polish notation. He co-authored with Alfred Tarski’s an important paper on metatheory of propositional logic and he was one of Tarski’s the three main teachers at the University of Warsaw. Łukasiewicz’s stature was just short of that of the giants: Aristotle, Boole, Frege, Tarski and Gödel. No mathematical logician of his caliber had ever before quoted the actual teachings of ancient logicians. -/- Not only did Łukasiewicz inject fresh hypotheses, new concepts, and imaginative modern perspectives into the field, his enormous prestige and that of the Warsaw School of Logic reflected on the whole field of ancient logic studies. Suddenly, this previously somewhat dormant and obscure field became active and gained in respectability and importance in the eyes of logicians, mathematicians, linguists, analytic philosophers, and historians. Next to Aristotle himself and perhaps the Stoic logician Chrysippus, Łukasiewicz is the most prominent figure in ancient logic studies. A huge literature traces its origins to Łukasiewicz. -/- This Ancient Logic and Its Modern Interpretations, is based on the 1973 Buffalo Symposium on Modernist Interpretations of Ancient Logic, the first conference devoted entirely to critical assessment of the state of ancient logic studies. (shrink)
    Download  
     
    Export citation  
     
    Bookmark   18 citations  
  29.  76
    Propositional Interval Neighborhood Logics: Expressiveness, Decidability, and Undecidable Extensions.Davide Bresolin, Valentin Goranko, Angelo Montanari & Guido Sciavicco - 2009 - Annals of Pure and Applied Logic 161 (3):289-304.
    In this paper, we investigate the expressiveness of the variety of propositional interval neighborhood logics , we establish their decidability on linearly ordered domains and some important subclasses, and we prove the undecidability of a number of extensions of PNL with additional modalities over interval relations. All together, we show that PNL form a quite expressive and nearly maximal decidable fragment of Halpern–Shoham’s interval logic HS.
    Download  
     
    Export citation  
     
    Bookmark   5 citations  
  30. Compact Propositional Gödel Logics.Matthias Baaz & Richard Zach - 1998 - In 28th IEEE International Symposium on Multiple-Valued Logic, 1998. Proceedings. Los Alamitos: IEEE Press. pp. 108-113.
    Entailment in propositional Gödel logics can be defined in a natural way. While all infinite sets of truth values yield the same sets of tautologies, the entailment relations differ. It is shown that there is a rich structure of infinite-valued Gödel logics, only one of which is compact. It is also shown that the compact infinite-valued Gödel logic is the only one which interpolates, and the only one with an r.e. entailment relation.
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  31. Trees for a 3-Valued Logic.Fred Johnson - 1984 - Analysis 44 (1):43-6.
    Fred shows how problems with Slater's restriction of the classical propositional logic can be solved.
    Download  
     
    Export citation  
     
    Bookmark  
  32.  46
    A General Tableau Method for Propositional Interval Temporal Logics: Theory and Implementation.V. Goranko, A. Montanari, P. Sala & G. Sciavicco - 2006 - Journal of Applied Logic 4 (3):305-330.
    In this paper we focus our attention on tableau methods for propositional interval temporal logics. These logics provide a natural framework for representing and reasoning about temporal properties in several areas of computer science. However, while various tableau methods have been developed for linear and branching time point-based temporal logics, not much work has been done on tableau methods for interval-based ones. We develop a general tableau method for Venema's \cdt\ logic interpreted over partial orders (\nsbcdt\ for short). (...)
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  33. Russell’s Conception of Propositional Attitudes in Relation to Pragmatism.Nikolay Milkov - 2020 - An Anthology of Philosophical Studies 14:117-128.
    The conventional wisdom has it that between 1905 and 1919 Russell was critical to pragmatism. In particular, in two essays written in 1908–9, he sharply attacked the pragmatist theory of truth, emphasizing that truth is not relative to human practice. In fact, however, Russell was much more indebted to the pragmatists, in particular to William James, as usually believed. For example, he borrowed from James two key concepts of his new epistemology: sense-data, and the distinction between knowledge by acquaintance and (...)
    Download  
     
    Export citation  
     
    Bookmark  
  34.  86
    Qualia Logic 2 Brief Notes on Qualia Logic.Paul Merriam - manuscript
    Some not quite random thoughts on the logic of qualia.
    Download  
     
    Export citation  
     
    Bookmark  
  35. Qualia Logic.Paul Merriam - manuscript
    The logic of qualia is different than classical logic. We take the first steps in defining it and applying it to the Hard Problem.
    Download  
     
    Export citation  
     
    Bookmark  
  36. A Logic for Epistemic Two-Dimensional Semantics.Peter Fritz - 2013 - Synthese 190 (10):1753-1770.
    Epistemic two-dimensional semantics is a theory in the philosophy of language that provides an account of meaning which is sensitive to the distinction between necessity and apriority. While this theory is usually presented in an informal manner, I take some steps in formalizing it in this paper. To do so, I define a semantics for a propositional modal logic with operators for the modalities of necessity, actuality, and apriority that captures the relevant ideas of epistemic two-dimensional semantics. I (...)
    Download  
     
    Export citation  
     
    Bookmark   14 citations  
  37.  39
    The ILLTP Library for Intuitionistic Linear Logic.Carlos Olarte, Valeria Correa Vaz De Paiva, Elaine Pimentel & Giselle Reis - manuscript
    Benchmarking automated theorem proving (ATP) systems using standardized problem sets is a well-established method for measuring their performance. However, the availability of such libraries for non-classical logics is very limited. In this work we propose a library for benchmarking Girard's (propositional) intuitionistic linear logic. For a quick bootstrapping of the collection of problems, and for discussing the selection of relevant problems and understanding their meaning as linear logic theorems, we use translations of the collection of Kleene's intuitionistic (...)
    Download  
     
    Export citation  
     
    Bookmark  
  38. Aggregating Sets of Judgments: An Impossibility Result.Christian List & Philip Pettit - 2002 - Economics and Philosophy 18 (1):89-110.
    Suppose that the members of a group each hold a rational set of judgments on some interconnected questions, and imagine that the group itself has to form a collective, rational set of judgments on those questions. How should it go about dealing with this task? We argue that the question raised is subject to a difficulty that has recently been noticed in discussion of the doctrinal paradox in jurisprudence. And we show that there is a general impossibility theorem that that (...)
    Download  
     
    Export citation  
     
    Bookmark   174 citations  
  39. Schemata: The Concept of Schema in the History of Logic.John Corcoran - 2006 - Bulletin of Symbolic Logic 12 (2):219-240.
    The syllogistic figures and moods can be taken to be argument schemata as can the rules of the Stoic propositional logic. Sentence schemata have been used in axiomatizations of logic only since the landmark 1927 von Neumann paper [31]. Modern philosophers know the role of schemata in explications of the semantic conception of truth through Tarski’s 1933 Convention T [42]. Mathematical logicians recognize the role of schemata in first-order number theory where Peano’s second-order Induction Axiom is approximated (...)
    Download  
     
    Export citation  
     
    Bookmark   11 citations  
  40. INFORMATION-THEORETIC LOGIC.John Corcoran - 1998 - In C. Martínez U. Rivas & L. Villegas-Forero (eds.), Truth in Perspective edited by C. Martínez, U. Rivas, L. Villegas-Forero, Ashgate Publishing Limited, Aldershot, England (1998) 113-135. ASHGATE. pp. 113-135.
    Information-theoretic approaches to formal logic analyse the "common intuitive" concept of propositional implication (or argumental validity) in terms of information content of propositions and sets of propositions: one given proposition implies a second if the former contains all of the information contained by the latter; an argument is valid if the conclusion contains no information beyond that of the premise-set. This paper locates information-theoretic approaches historically, philosophically and pragmatically. Advantages and disadvantages are identified by examining such approaches in (...)
    Download  
     
    Export citation  
     
    Bookmark   14 citations  
  41.  96
    Non-Constructive Procedural Theory of Propositional Problems and the Equivalence of Solutions.Ivo Pezlar - 2019 - In Igor Sedlár & Martin Blicha (eds.), The Logica Yearbook 2018. London: College Publications. pp. 197-210.
    We approach the topic of solution equivalence of propositional problems from the perspective of non-constructive procedural theory of problems based on Transparent Intensional Logic (TIL). The answer we put forward is that two solutions are equivalent if and only if they have equivalent solution concepts. Solution concepts can be understood as a generalization of the notion of proof objects from the Curry-Howard isomorphism.
    Download  
     
    Export citation  
     
    Bookmark  
  42. Outline of a Logic of Knowledge of Acquaintance.Samuele Iaquinto & Giuseppe Spolaore - 2019 - Analysis 79 (1):52-61.
    The verb ‘to know’ can be used both in ascriptions of propositional knowledge and ascriptions of knowledge of acquaintance. In the formal epistemology literature, the former use of ‘know’ has attracted considerable attention, while the latter is typically regarded as derivative. This attitude may be unsatisfactory for those philosophers who, like Russell, are not willing to think of knowledge of acquaintance as a subsidiary or dependent kind of knowledge. In this paper we outline a logic of knowledge of (...)
    Download  
     
    Export citation  
     
    Bookmark  
  43. Effective Finite-Valued Approximations of General Propositional Logics.Matthias Baaz & Richard Zach - 2008 - In Arnon Avron, Nachum Dershowitz & Alexander Rabinovich (eds.), Pillars of Computer Science: Essays Dedicated to Boris (Boaz) Trakhtenbrot on the Occasion of His 85th Birthday. Berlin: Springer. pp. 107–129.
    Propositional logics in general, considered as a set of sentences, can be undecidable even if they have “nice” representations, e.g., are given by a calculus. Even decidable propositional logics can be computationally complex (e.g., already intuitionistic logic is PSPACE-complete). On the other hand, finite-valued logics are computationally relatively simple—at worst NP. Moreover, finite-valued semantics are simple, and general methods for theorem proving exist. This raises the question to what extent and under what circumstances propositional logics represented (...)
    Download  
     
    Export citation  
     
    Bookmark  
  44.  97
    Non-Normal Modalities in Variants of Linear Logic.D. Porello & N. Troquard - 2015 - Journal of Applied Non-Classical Logics 25 (3):229-255.
    This article presents modal versions of resource-conscious logics. We concentrate on extensions of variants of linear logic with one minimal non-normal modality. In earlier work, where we investigated agency in multi-agent systems, we have shown that the results scale up to logics with multiple non-minimal modalities. Here, we start with the language of propositional intuitionistic linear logic without the additive disjunction, to which we add a modality. We provide an interpretation of this language on a class of (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  45. Tensed Ontology Based on Simple Partial Logic.Daisuke Kachi - 2002 - Proceedings of Ninth International Symposium on Temporal Representation and Reasoning: TIME-02:141-145.
    Simple partial logic (=SPL) is, broadly speaking, an extensional logic which allows for the truth-value gap. First I give a system of propositional SPL by partializing classical logic, as well as extending it with several non-classical truth-functional operators. Second I show a way based on SPL to construct a system of tensed ontology, by representing tensed statements as two kinds of necessary statements in a linear model that consists of the present and future worlds. Finally I (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  46. Logic: The Megarics.Susanne Bobzien - 1999 - In Keimpe Algra & et al (eds.), The Cambridge History of Hellenistic Philosophy. Cambridge University Press.
    ABSTRACT: Summary presentation of the surviving logic theories of Philo the Dialectician (aka Philo of Megara) and Diodorus Cronus, including some general remarks on propositional logical elements in their logic, a presentation of their theories of the conditional and a presentation of their modal theories, including a brief suggestion for a solution of the Master Argument.
    Download  
    Translate
     
     
    Export citation  
     
    Bookmark   1 citation  
  47.  56
    The Logic of Causation: Definition, Induction and Deduction of Deterministic Causality.Avi Sion - 1999-2000, 2003- - Geneva, Switzerland: CreateSpace & Kindle; Lulu..
    The Logic of Causation: Definition, Induction and Deduction of Deterministic Causality is a treatise of formal logic and of aetiology. It is an original and wide-ranging investigation of the definition of causation (deterministic causality) in all its forms, and of the deduction and induction of such forms. The work was carried out in three phases over a dozen years (1998-2010), each phase introducing more sophisticated methods than the previous to solve outstanding problems. This study was intended as part (...)
    Download  
     
    Export citation  
     
    Bookmark  
  48.  17
    On the Logics with Propositional Quantifiers Extending S5Π.Yifeng Ding - 2018 - In Guram Bezhanishvili, Giovanna D'Agostino, George Metcalfe & Thomas Studer (eds.), Advances in Modal Logic 12, proceedings of the 12th conference on "Advances in Modal Logic," held in Bern, Switzerland, August 27-31, 2018. pp. 219-235.
    Scroggs's theorem on the extensions of S5 is an early landmark in the modern mathematical studies of modal logics. From it, we know that the lattice of normal extensions of S5 is isomorphic to the inverse order of the natural numbers with infinity and that all extensions of S5 are in fact normal. In this paper, we consider extending Scroggs's theorem to modal logics with propositional quantifiers governed by the axioms and rules analogous to the usual ones for ordinary (...)
    Download  
     
    Export citation  
     
    Bookmark  
  49. Post Completeness in Congruential Modal Logics.Peter Fritz - 2016 - In Lev Beklemishev, Stéphane Demri & András Máté (eds.), Advances in Modal Logic, Volume 11. College Publications. pp. 288-301.
    Well-known results due to David Makinson show that there are exactly two Post complete normal modal logics, that in both of them, the modal operator is truth-functional, and that every consistent normal modal logic can be extended to at least one of them. Lloyd Humberstone has recently shown that a natural analog of this result in congruential modal logics fails, by showing that not every congruential modal logic can be extended to one in which the modal operator is (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  50. Dialecticians and Stoics on the Classification of Propositions.Theodor Ebert - 1993 - In Klaus Döring & Theodor Ebert (eds.), Dialektiker und Stoiker. Zur Logik der Stoa und ihrer Vorläufer. Stuttgart: Steiner Verlag. pp. 111-127.
    This paper discusses the reports in Diogenes Laertius and in Sextus Empiricus concerning the classification of propositions. It is argued that the material in Sextus uses a source going back to the Dialectical school whose most prominent members were Diodorus Cronus and Philo of Megara. The material preserved in Diogenes Laertius, on the other hand, goes back to Chrysippus.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
1 — 50 / 1000