This category needs an editor. We encourage you to help if you are qualified.

# Propositional Logic

 Summary Propositional logic is the simpler of the two modern classical logics.  It ignores entirely the structure within propositions.  In classical propositional logic, molecular or compound propositions are built up from atomic propositions by means of the connectives, whose meaning is given by their truth tables.  The principle by which the meaning or truth conditions of compound propositions can be recovered by this "building up" process is known as compositionality. This leaf node is a sub-category of classical logic.  As such, non-standard propositional logics are not normally classified in this category—unless a comparison between classical logic and another logic is being drawn or one is reduced to the other—although restrictions of propositional logic in which nothing not a theorem in ordinary propositional logic is a theorem in the restriction do fit here.  Also appropriate here are modest extensions of propositional logic, provided that Boole's three laws of thought are not violated, viz. a proposition is either true or false, not neither, and not both. Meta-theoretical results for propositional logic are also generally classified as "proof theory," "model theory," "mathematical logic," etc.
 Key works See below.
 Introductions Because of the age of propositional logic there are literally hundreds of introductions to logic which cover this subject reasonably well.   Instructors will have their own favorites. In selecting a book for classroom use, I recommend checking one thing: how much meta-theory is included, so that the book is neither below nor above the level students can handle.
Related categories

263 found
Order:
 1 — 50 / 263
1. I give an account of proof terms for derivations in a sequent calculus for classical propositional logic. The term for a derivation δ of a sequent Σ≻Δ encodes how the premises Σ and conclusions Δ are related in δ. This encoding is many–to–one in the sense that different derivations can have the same proof term, since different derivations may be different ways of representing the same underlying connection between premises and conclusions. However, not all proof terms for a sequent Σ≻Δ (...)

Export citation

Bookmark
2. Logic: A Primer.Erich Rast - manuscript
This text is a short introduction to logic that was primarily used for accompanying an introductory course in Logic for Linguists held at the New University of Lisbon (UNL) in fall 2010. The main idea of this course was to give students the formal background and skills in order to later assess literature in logic, semantics, and related fields and perhaps even use logic on their own for the purpose of doing truth-conditional semantics. This course in logic does not replace (...)
Remove from this list
Translate

Export citation

Bookmark
3. In this article I define a strong conditional for classical sentential logic, and then extend it to three non-classical sentential logics. It is stronger than the material conditional and is not subject to the standard paradoxes of material implication, nor is it subject to some of the standard paradoxes of C. I. Lewis’s strict implication. My conditional has some counterintuitive consequences of its own, but I think its pros outweigh its cons. In any case, one can always augment one’s language (...)
Translate

Export citation

Bookmark
4. Possibility Semantics.Wesley H. Holliday - forthcoming - In Melvin Fitting (ed.), Selected Topics from Contemporary Logics. London: College Publications.
In traditional semantics for classical logic and its extensions, such as modal logic, propositions are interpreted as subsets of a set, as in discrete duality, or as clopen sets of a Stone space, as in topological duality. A point in such a set can be viewed as a "possible world," with the key property of a world being primeness—a world makes a disjunction true only if it makes one of the disjuncts true—which classically implies totality—for each proposition, a world either (...)

Export citation

Bookmark   3 citations
5. Normalisation and Subformula Property for a System of Classical Logic with Tarski’s Rule.Nils Kürbis - 2022 - Archive for Mathematical Logic 61 (1):105-129.
This paper considers a formalisation of classical logic using general introduction rules and general elimination rules. It proposes a definition of ‘maximal formula’, ‘segment’ and ‘maximal segment’ suitable to the system, and gives reduction procedures for them. It is then shown that deductions in the system convert into normal form, i.e. deductions that contain neither maximal formulas nor maximal segments, and that deductions in normal form satisfy the subformula property. Tarski’s Rule is treated as a general introduction rule for implication. (...)

Export citation

Bookmark   2 citations
6. On the Logic of Belief and Propositional Quantification.Yifeng Ding - 2021 - Journal of Philosophical Logic 50 (5):1143-1198.
We consider extending the modal logic KD45, commonly taken as the baseline system for belief, with propositional quantifiers that can be used to formalize natural language sentences such as “everything I believe is true” or “there is something that I neither believe nor disbelieve.” Our main results are axiomatizations of the logics with propositional quantifiers of natural classes of complete Boolean algebras with an operator validating KD45. Among them is the class of complete, atomic, and completely multiplicative BAOs validating KD45. (...)
Translate

Export citation

Bookmark
7. This textbook is a logic manual which includes an elementary course and an advanced course. It covers more than most introductory logic textbooks, while maintaining a comfortable pace that students can follow. The technical exposition is clear, precise and follows a paced increase in complexity, allowing the reader to get comfortable with previous definitions and procedures before facing more difficult material. The book also presents an interesting overall balance between formal and philosophical discussion, making it suitable for both philosophy and (...)

Export citation

Bookmark
8. Normalisation for Bilateral Classical Logic with Some Philosophical Remarks.Nils Kürbis - 2021 - Journal of Applied Logics 2 (8):531-556.
Bilateralists hold that the meanings of the connectives are determined by rules of inference for their use in deductive reasoning with asserted and denied formulas. This paper presents two bilateral connectives comparable to Prior's tonk, for which, unlike for tonk, there are reduction steps for the removal of maximal formulas arising from introducing and eliminating formulas with those connectives as main operators. Adding either of them to bilateral classical logic results in an incoherent system. One way around this problem is (...)

Export citation

Bookmark   2 citations
9. Note on 'Normalisation for Bilateral Classical Logic with Some Philosophical Remarks'.Nils Kürbis - 2021 - Journal of Applied Logics 7 (8):2259-2261.
This brief note corrects an error in one of the reduction steps in my paper 'Normalisation for Bilateral Classical Logic with some Philosophical Remarks' published in the Journal of Applied Logics 8/2 (2021): 531-556.

Export citation

Bookmark   1 citation
10. The Significance of Evidence-Based Reasoning in Mathematics, Mathematics Education, Philosophy, and the Natural Sciences.Bhupinder Singh Anand - 2020 - Mumbai: DBA Publishing (First Edition).
In this multi-disciplinary investigation we show how an evidence-based perspective of quantification---in terms of algorithmic verifiability and algorithmic computability---admits evidence-based definitions of well-definedness and effective computability, which yield two unarguably constructive interpretations of the first-order Peano Arithmetic PA---over the structure N of the natural numbers---that are complementary, not contradictory. The first yields the weak, standard, interpretation of PA over N, which is well-defined with respect to assignments of algorithmically verifiable Tarskian truth values to the formulas of PA under the interpretation. (...)

Export citation

Bookmark   1 citation
11. Constrained Pseudo-Propositional Logic.Ahmad-Saher Azizi-Sultan - 2020 - Logica Universalis 14 (4):523-535.
Propositional logic, with the aid of SAT solvers, has become capable of solving a range of important and complicated problems. Expanding this range, to contain additional varieties of problems, is subject to the complexity resulting from encoding counting constraints in conjunctive normal form. Due to the limitation of the expressive power of propositional logic, generally, such an encoding increases the numbers of variables and clauses excessively. This work eliminates the indicated drawback by interpolating constraint symbols and the set of natural (...)

Export citation

Bookmark
12. Choice-Free Stone Duality.Nick Bezhanishvili & Wesley H. Holliday - 2020 - Journal of Symbolic Logic 85 (1):109-148.
The standard topological representation of a Boolean algebra via the clopen sets of a Stone space requires a nonconstructive choice principle, equivalent to the Boolean Prime Ideal Theorem. In this article, we describe a choice-free topological representation of Boolean algebras. This representation uses a subclass of the spectral spaces that Stone used in his representation of distributive lattices via compact open sets. It also takes advantage of Tarski’s observation that the regular open sets of any topological space form a Boolean (...)

Export citation

Bookmark   1 citation
13. Traits essentiels d'une formalisation adéquate.Gheorghe-Ilie Farte - 2020 - Argumentum. Journal of the Seminar of Discursive Logic, Argumentation Theory and Rhetoric 18 (1):163-174.
In order to decide whether a discursive product of human reason corresponds or not to the logical order, one must analyze it in terms of syntactic correctness, consistency, and validity. The first step in logical analysis is formalization, that is, the process by which logical forms of thoughts are represented in different formal languages or logical systems. Although each thought can be properly formalized in different ways, the formalization variants are not equally adequate. The adequacy of formalization seems to depend (...)
Translate

Export citation

Bookmark
14. The Accident of Logical Constants.Tristan Grøtvedt Haze - 2020 - Thought: A Journal of Philosophy 9 (1):34-42.
Work on the nature and scope of formal logic has focused unduly on the distinction between logical and extra-logical vocabulary; which argument forms a logical theory countenances depends not only on its stock of logical terms, but also on its range of grammatical categories and modes of composition. Furthermore, there is a sense in which logical terms are unnecessary. Alexandra Zinke has recently pointed out that propositional logic can be done without logical terms. By defining a logical-term-free language with the (...)

Export citation

Bookmark   1 citation
15. The Power of Logic, 6th Edition.Daniel Howard-Snyder, Frances Howard-Snyder & Ryan Wasserman - 2020 - New York: McGraw-Hill.
This is a basic logic text for first-time logic students. Custom-made texts from the chapters is an option as well. And there is a website to go with text too.

Export citation

Bookmark
16. Calculus CL as a Formal System.Jens Lemanski & Ludger Jansen - 2020 - In Ahti Veikko Pietarinen, Peter Chapman, Leonie Bosveld-de Smet, Valeria Giardino, James Corter & Sven Linker (eds.), Diagrammatic Representation and Inference. Diagrams 2020. Lecture Notes in Computer Science, vol 12169. 2020. 93413 Cham, Deutschland: pp. 445-460.
In recent years CL diagrams inspired by Lange’s Cubus Logicus have been used in various contexts of diagrammatic reasoning. However, whether CL diagrams can also be used as a formal system seemed questionable. We present a CL diagram as a formal system, which is a fragment of propositional logic. Syntax and semantics are presented separately and a variant of bitstring semantics is applied to prove soundness and completeness of the system.

Export citation

Bookmark   3 citations
17. Dynamic Non-Classicality.Matthew Mandelkern - 2020 - Australasian Journal of Philosophy 98 (2):382-392.
I show that standard dynamic approaches to the semantics of epistemic modals invalidate the classical laws of excluded middle and non-contradiction, as well as the law of epistemic non-contradiction. I argue that these facts pose a serious challenge.

Export citation

Bookmark   6 citations
18. A Different Approach for Clique and Household Analysis in Synthetic Telecom Data Using Propositional Logic.Sandro Skansi, Kristina Šekrst & Marko Kardum - 2020 - In Marko Koričić (ed.), 2020 43rd International Convention on Information, Communication and Electronic Technology (MIPRO). IEEE Explore. pp. 1286-1289.
In this paper we propose an non-machine learning artificial intelligence (AI) based approach for telecom data analysis, with a special focus on clique detection. Clique detection can be used to identify households, which is a major challenge in telecom data analysis and predictive analytics. Our approach does not use any form of machine learning, but another type of algorithm: satisfiability for propositional logic. This is a neglected approach in modern AI, and we aim to demonstrate that for certain tasks, it (...)

Export citation

Bookmark
19. Algebraic and Topological Semantics for Inquisitive Logic Via Choice-Free Duality.Nick Bezhanishvili, Gianluca Grilletti & Wesley H. Holliday - 2019 - In Rosalie Iemhoff, Michael Moortgat & Ruy de Queiroz (eds.), Logic, Language, Information, and Computation. WoLLIC 2019. Lecture Notes in Computer Science, Vol. 11541. Springer. pp. 35-52.
We introduce new algebraic and topological semantics for inquisitive logic. The algebraic semantics is based on special Heyting algebras, which we call inquisitive algebras, with propositional valuations ranging over only the ¬¬-fixpoints of the algebra. We show how inquisitive algebras arise from Boolean algebras: for a given Boolean algebra B, we define its inquisitive extension H(B) and prove that H(B) is the unique inquisitive algebra having B as its algebra of ¬¬-fixpoints. We also show that inquisitive algebras determine Medvedev’s logic (...)
Translate

Export citation

Bookmark   2 citations
20. 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. Much of Stoic (...)

Export citation

Bookmark   3 citations
21. Question-Begging Arguments as Ones That Do Not Extend Knowledge.Rainer Ebert - 2019 - Philosophy and Progress 65 (1):125-144.
In this article, I propose a formal criterion that distinguishes between deductively valid arguments that do and do not beg the question. I define the concept of a Never-failing Minimally Competent Knower (NMCK) and suggest that an argument begs the question just in case it cannot possibly assist an NMCK in extending his or her knowledge.

Export citation

Bookmark
22. Two-Sided Trees for Sentential Logic, Predicate Logic, and Sentential Modal Logic.Jesse Fitts & David Beisecker - 2019 - Teaching Philosophy 42 (1):41-56.
This paper will present two contributions to teaching introductory logic. The first contribution is an alternative tree proof method that differs from the traditional one-sided tree method. The second contribution combines this tree system with an index system to produce a user-friendly tree method for sentential modal logic.

Export citation

Bookmark
23. 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 I demonstrate (...)

Export citation

Bookmark   1 citation
24. Oskari Kuusela, Wittgenstein on Logic as the Method of Philosophy: Re‐Examining the Roots and Development of Analytic Philosophy . Xi + 297, £55.00 Hb. [REVIEW]Alessio Persichetti - 2019 - Philosophical Investigations 42 (4):424-427.

Export citation

Bookmark
25. Bilateralism, Independence and Coordination.Gonçalo Santos - 2018 - Teorema: International Journal of Philosophy 37 (1):23-27.
Bilateralism is a theory of meaning according to which assertion and denial are independent speech acts. Bilateralism also proposes two coordination principles for assertion and denial. I argue that if assertion and denial are independent speech acts, they cannot be coordinated by the bilateralist principles.

Export citation

Bookmark
26. Wordmorph!: A Word Game to Introduce Natural Deduction.Ian Stoner - 2018 - Teaching Philosophy 41 (2):199-204.
Some logic students falter at the transition from the mechanical method of truth tables to the less-mechanical method of natural deduction. This short paper introduces a word game intended to ease that transition.

Export citation

Bookmark
27. How May the Propositional Calculus Represent?Tristan Haze - 2017 - South American Journal of Logic 3 (1):173-184.
This paper is a conceptual study in the philosophy of logic. The question considered is 'How may formulae of the propositional calculus be brought into a representational relation to the world?'. Four approaches are distinguished: (1) the denotational approach, (2) the abbreviational approach, (3) the truth-conditional approach, and (4) the modelling approach. (2) and (3) are very familiar, so I do not discuss them. (1), which is now largely obsolete, led to some interesting twists and turns in early analytic philosophy (...)

Export citation

Bookmark
28. On the Concept of a Notational Variant.Alexander W. Kocurek - 2017 - In Alexandru Baltag, Jeremy Seligman & Tomoyuki Yamada (eds.), Logic, Rationality, and Interaction (LORI 2017, Sapporo, Japan). pp. 284-298.
In the study of modal and nonclassical logics, translations have frequently been employed as a way of measuring the inferential capabilities of a logic. It is sometimes claimed that two logics are “notational variants” if they are translationally equivalent. However, we will show that this cannot be quite right, since first-order logic and propositional logic are translationally equivalent. Others have claimed that for two logics to be notational variants, they must at least be compositionally intertranslatable. The definition of compositionality these (...)

Export citation

Bookmark   3 citations
29. Bilateralist Detours: From Intuitionist to Classical Logic and Back.Nils Kürbis - 2017 - Logique Et Analyse 60 (239):301-316.
There is widespread agreement that while on a Dummettian theory of meaning the justified logic is intuitionist, as its constants are governed by harmonious rules of inference, the situation is reversed on Huw Price's bilateralist account, where meanings are specified in terms of primitive speech acts assertion and denial. In bilateral logics, the rules for classical negation are in harmony. However, as it is possible to construct an intuitionist bilateral logic with harmonious rules, there is no formal argument against intuitionism (...)

Export citation

Bookmark   1 citation
30. An Arithmetization of Logical Oppositions.Fabien Schang - 2016 - In Jean-Yves Beziau & Gianfranco Basti (eds.), The Square of Opposition: A Cornerstone of Thought. Bâle, Suisse: pp. 215-237.
An arithmetic theory of oppositions is devised by comparing expressions, Boolean bitstrings, and integers. This leads to a set of correspondences between three domains of investigation, namely: logic, geometry, and arithmetic. The structural properties of each area are investigated in turn, before justifying the procedure as a whole. Io finish, I show how this helps to improve the logical calculus of oppositions, through the consideration of corresponding operations between integers.

Export citation

Bookmark   3 citations
31. Logical Squares for Classical Logic Sentences.Urszula Wybraniec-Skardowska - 2016 - Logica Universalis 10 (2-3):293-312.
In this paper, with reference to relationships of the traditional square of opposition, we establish all the relations of the square of opposition between complex sentences built from the 16 binary and four unary propositional connectives of the classical propositional calculus. We illustrate them by means of many squares of opposition and, corresponding to them—octagons, hexagons or other geometrical objects.

Export citation

Bookmark   4 citations
32. The Logic Game: A Two-Player Game of Propositional Logic.Daniel J. Hicks & John Milanese - 2015 - Teaching Philosophy 38 (1):77-93.
This paper introduces The Logic Game, a two-player strategy game designed to help students in introductory logic classes learn the truth conditions for the logical operators. The game materials can be printed using an ordinary printer on ordinary paper, takes 10-15 minutes to play, and the rules are fairly easy to learn. This paper includes a complete set of rules, a URL for a website hosting all of the game materials, and the results of a study of the effectiveness of (...)

Export citation

Bookmark
33. What is Wrong with Classical Negation?Nils Kürbis - 2015 - Grazer Philosophische Studien 92 (1):51-86.
The focus of this paper are Dummett's meaning-theoretical arguments against classical logic based on consideration about the meaning of negation. Using Dummettian principles, I shall outline three such arguments, of increasing strength, and show that they are unsuccessful by giving responses to each argument on behalf of the classical logician. What is crucial is that in responding to these arguments a classicist need not challenge any of the basic assumptions of Dummett's outlook on the theory of meaning. In particular, I (...)

Export citation

Bookmark   14 citations
34. On Hilbert's Axiomatics of Propositional Logic.V. Michele Abrusci - 2014 - Perspectives on Science 22 (1):115-132.
Hilbert's conference lectures during the year 1922, Neuebegründung der Mathematik. Erste Mitteilung and Die logischen Grundlagen der Mathematik (both are published in (Hilbert [1935] 1965) pp. 157-195), contain his first public presentation of an axiom system for propositional logic, or at least for a fragment of propositional logic, which is largely influenced by the study on logical woks of Frege and Russell during the previous years.The year 1922 is at the beginning of Hilbert's foundational program in its definitive form. The (...)

Export citation

Bookmark
35. Inférences traditionelles comme n-lemmes.Gheorghe-Ilie Farte - 2014 - Argumentum. Journal of the Seminar of Discursive Logic, Argumentation Theory and Rhetoric 12 (2):136-140.
In this paper we propose to present from a new perspective some loci comunes of traditional logic. More exactly, we intend to show that some hypothetico-disjunctive inferences (i.e. the complex constructive dilemma, the complex destructive dilemma, the simple constructive dilemma, the simple destructive dilemma) and two hypothetico-categorical inferences (namely modus ponendo-ponens and modus tollendo-tollens) particularize two more abstract inferential structures: the constructive n-lemma and the destructive nlemma.
Translate

Export citation

Bookmark
36. Łukasiewicz Negation and Many-Valued Extensions of Constructive Logics.Thomas Macaulay Ferguson - 2014 - In Proc. 44th International Symposium on Multiple-Valued Logic. IEEE Computer Society Press. pp. 121-127.
This paper examines the relationships between the many-valued logics G~ and Gn~ of Esteva, Godo, Hajek, and Navara, i.e., Godel logic G enriched with Łukasiewicz negation, and neighbors of intuitionistic logic. The popular fragments of Rauszer's Heyting-Brouwer logic HB admit many-valued extensions similar to G which may likewise be enriched with Łukasiewicz negation; the fuzzy extensions of these logics, including HB, are equivalent to G ~, as are their n-valued extensions equivalent to Gn~ for any n ≥ 2. These enriched (...)

Export citation

Bookmark
37. Partiality and Adjointness in Modal Logic.Wesley H. Holliday - 2014 - In Rajeev Goré, Barteld Kooi & Agi Kurucz (eds.), Advances in Modal Logic, Volume 10. CSLI Publications. pp. 313-332.
Following a proposal of Humberstone, this paper studies a semantics for modal logic based on partial “possibilities” rather than total “worlds.” There are a number of reasons, philosophical and mathematical, to find this alternative semantics attractive. Here we focus on the construction of possibility models with a finitary flavor. Our main completeness result shows that for a number of standard modal logics, we can build a canonical possibility model, wherein every logically consistent formula is satisfied, by simply taking each individual (...)

Export citation

Bookmark   5 citations
38. Znaczenie pojęcia odrzucania we współczesnej logice.Karolina Rożko - 2014 - Diametros 41:115-126.
The main aim of this article is to show how the notion of refutation has been changing in logic for the last few years. The idea of refutation was known to Aristotle, but the formal concept was introduced by Jan Łukasiewicz. Afterwards this notion was investigated by the Polish group of logicians headed by Jerzy Słupecki. Several interesting articles about refutation have appeared in the last years. In this article, I present in outline the history of the notion of refutation (...)
Translate

Export citation

Bookmark
39. A Carnapian Approach to Counterexamples to Modus Ponens.Constantin C. Brîncuș & Iulian D. Toader - 2013 - Romanian Journal of Analytic Philosophy 7:78-85.
This paper attempts to motivate the view that instead of rejecting modus ponens as invalid in certain situations, one could preserve its validity by associating such situations with non-normal interpretations of logical connectives.
Remove from this list

Export citation

Bookmark   1 citation
40. Why Hypothetical Syllogism is Invalid for Indicative Conditionals.Moti Mizrahi - 2013 - Thought: A Journal of Philosophy 2 (1):40-43.
In this article, I present a schema for generating counterexamples to the argument form known as Hypothetical Syllogism with indicative conditionals. If my schema for generating counterexamples to HS works as I think it does, then HS is invalid for indicative conditionals.

Export citation

Bookmark   11 citations
41. Conditionals Are Material: The Positive Arguments.Adam Rieger - 2013 - Synthese 190 (15):3161-3174.
A number of papers have argued in favour of the material account of indicative conditionals, but typically they either concentrate on defending the account from the charge that it has counterintuitive consequences, or else focus on some particular positive argument in favour of the theory. In this paper, I survey the various positive arguments that can be given, presenting simple versions where possible and showing the connections between them. I conclude with some methodological considerations.

Export citation

Bookmark   15 citations
42. Revising Up: Strengthening Classical Logic in the Face of Paradox.David Ripley - 2013 - Philosophers' Imprint 13.
This paper provides a defense of the full strength of classical logic, in a certain form, against those who would appeal to semantic paradox or vagueness in an argument for a weaker logic. I will not argue that these paradoxes are based on mistaken principles; the approach I recommend will extend a familiar formulation of classical logic by including a fully transparent truth predicate and fully tolerant vague predicates. It has been claimed that these principles are not compatible with classical (...)

Export citation

Bookmark   27 citations
43. Propositional Logic Card Games.Anthony Shiver - 2013 - Teaching Philosophy 36 (1):51-58.
In this paper I discuss card games designed to supplement or replace exercise sets on derivability and entailment in propositional logic. I present rules for two propositional logic card games that introduce chance and competition into discussions of propositional logic. The latter sections provide brief practical and theoretical notes on this kind of game, including ways courses that use these games can be more effective than courses that do not.

Export citation

Bookmark
44. On Löb Algebras, II.Majid Alizadeh & Mohammad Ardeshir - 2012 - Logic Journal of the IGPL 20 (1):27-44.
We study the variety of Löb algebras, the algebraic structures associated with Formal Propositional Calculus. Among other things, we show that there exist only two maximal intermediate logics in the lattice of intermediate logics over Basic Propositional Calculus. We introduce countably many locally finite sub-varieties of the variety of Löb algebras and show that their corresponding intermediate logics have the interpolation property. Finally, we characterize all chain basic algebras with empty set of generators, and show that there are continuum many (...)

Export citation

Bookmark   3 citations
45. Peirce's Truth-Functional Analysis and the Origin of the Truth Table.Irving H. Anellis - 2012 - History and Philosophy of Logic 33 (1):87 - 97.
We explore the technical details and historical evolution of Charles Peirce's articulation of a truth table in 1893, against the background of his investigation into the truth-functional analysis of propositions involving implication. In 1997, John Shosky discovered, on the verso of a page of the typed transcript of Bertrand Russell's 1912 lecture on ?The Philosophy of Logical Atomism? truth table matrices. The matrix for negation is Russell's, alongside of which is the matrix for material implication in the hand of Ludwig (...)

Export citation

Bookmark   6 citations
46. What's Wrong with Logic?Rani Lill Anjum - 2012 - Argumentos 4 (8).
The truth functional account of conditional statements ‘if A then B’ is not only inadequate; it eliminates the very conditionality expressed by ‘if’. Focusing only on the truth-values of the statements ‘A’ and ‘B’ and different combinations of these, one is bound to miss out on the conditional relation expressed between them. All approaches that treat conditionals as functions of their antecedents and consequents will end up in some sort of logical atomism where causal matters simply are reduced to the (...)
Translate

Export citation

Bookmark
47. The Immersion Method II (Logic & Malcolm X).Virgil W. Brower - 2012 - Inside Higher Ed, May 3.
Virgil W. Brower writes that courses based on intense discussions of great works of literature need not be limited to elite institutions.

Export citation

Bookmark
48. This paper deals with Austinian ifs of every stripe within classical logic. It is argued that they are truth-functional and the theory of conditional elements is used. Ellipsis is key. Corrects an error in Fulda (2010) in translation and therefore scope. -/- The PDF is made available gratis by the Publisher.

Export citation

Bookmark
49. Strengthening the Antecedent, Concessive Conditionals, Conditional Rhetorical Questions, and the Theory of Conditional Elements.Hector Hernandez Ortiz & Joseph S. Fulda - 2012 - Journal of Pragmatics 44 (3):328-331.
Extends the theory of conditional elements in three ways. The critical way, primarily due to the senior author, is the solution to the fallacy of the strengthened antecedent within classical logic.
We present a system of relational syllogistic, based on classical propositional logic, having primitives of the following form: $$\begin{array}{ll}\mathbf{Some}\, a \,{\rm are} \,R-{\rm related}\, {\rm to}\, \mathbf{some} \,b;\\ \mathbf{Some}\, a \,{\rm are}\,R-{\rm related}\, {\rm to}\, \mathbf{all}\, b;\\ \mathbf{All}\, a\, {\rm are}\,R-{\rm related}\, {\rm to}\, \mathbf{some}\, b;\\ \mathbf{All}\, a\, {\rm are}\,R-{\rm related}\, {\rm to}\, \mathbf{all} \,b.\end{array}$$ Such primitives formalize sentences from natural language like ‘ All students read some textbooks’. Here a, b denote arbitrary sets (of objects), and R denotes an (...)