This category needs an editor. We encourage you to help if you are qualified.
Volunteer, or read more about what this involves.
About this topic
Summary Predicate logic is the more complicated of the two modern classical logics.  It does not consider atomic propositions as indivisible, notwithstanding the etymology, but also considers the structure within propositions. In its treatment of the general, as opposed to the singular, propositions, it achieves the aims of Aristotelian logic in combination with the aims of propositional logic.  In the classification structure chosen by the general editors, second-order and higher-order logics are separate categories, and are therefore not classified as (ordinary) predicate calculus. This may seem a curiosity; it is exlpored in Eklund 1996. In its treatment of singular propositions, relations are permitted, too, as is the special predicate, identity. In classical predicate logic, molecular or compound propositions are built up from atomic propositions by means of the connectives, whose meaning is given by their truth tables.  Likewise, one way of understanding the meaning of the two classical quantifiers, existential and universal, is by taking them to be expanded disjunctions and conjunctions, respectively, over the universe of discourse.  The principle by which the meaning or truth conditions of compound propositions can be recovered by this "building up" process is known as compositionality.  Aside from an appropriate way to understand the meaning of the quantifiers, there is the additional issue of existential import. This leaf node is a sub-category of classical logic.  As such, non-standard predicate logics are not generally 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 predicate logic in which nothing not a theorem in ordinary predicate logic is a theorem in the restriction do fit here.  Also appropriate are modest extensions of predicate logic, excluding higher-order logics as noted above, 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 predicate logic are generally also classified as "proof theory," "model theory," "mathematical logic," etc.
Key works See below.
Introductions Because of the age of predicate 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 two things: (1) The correctness and clarity of the restrictions on universal generalization and existential instantiation; (2) how much meta-theory is included, so that the book is neither below nor above the level students can handle.
Related

Contents
230 found
Order:
1 — 50 / 230
  1. 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  
     
    Export citation  
     
    Bookmark  
  2. Rigid and flexible quantification in plural predicate logic.Lucas Champollion, Justin Bledin & Haoze Li - forthcoming - Semantics and Linguistic Theory 27.
    Noun phrases with overt determiners, such as <i>some apples</i> or <i>a quantity of milk</i>, differ from bare noun phrases like <i>apples</i> or <i>milk</i> in their contribution to aspectual composition. While this has been attributed to syntactic or algebraic properties of these noun phrases, such accounts have explanatory shortcomings. We suggest instead that the relevant property that distinguishes between the two classes of noun phrases derives from two modes of existential quantification, one of which holds the values of a variable fixed (...)
    Remove from this list   Direct download  
     
    Export citation  
     
    Bookmark   2 citations  
  3. The Nonarithmeticity of the Predicate Logic of Strictly Primitive Recursive Realizability.Valery Plisko - forthcoming - Review of Symbolic Logic:1-30.
    A notion of strictly primitive recursive realizability is introduced by Damnjanovic in 1994. It is a kind of constructive semantics of the arithmetical sentences using primitive recursive functions. It is of interest to study the corresponding predicate logic. It was argued by Park in 2003 that the predicate logic of strictly primitive recursive realizability is not arithmetical. Park’s argument is essentially based on a claim of Damnjanovic that intuitionistic logic is sound with respect to strictly primitive recursive realizability, but that (...)
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  4. What is LK? Vol.2. Structural Inference-Figures (Textbook Series in Symbolic Logic).Yusuke Kaneko - 2024 - Amazon Kindle.
    LK is much more difficult than NK, and to make matters worse, Gentzen's intention is still unclear when it comes to that system (LK). -/- The second and third volumes of the series titled What is LK? conduct the detailed survey of each inference-figure in a toe-to-toe way, as it were, which most mathematicians looked through. -/- The present volume, Vol.2, looks deeper into structural inference-figures, which is never an easy task.
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  5. Existential Import : an Extensional Approach.Yusuke Kaneko - 2023 - The Basis : The Annual Bulletin of Research Center for Liberal Education, Musashino University 13 (1):85-102.
    The original interest of this article lies in existential import. It provides a broader view on the problem by reference to modern, symbolic logic (ch.1). Gradually, however, our interest will change into the amalgamated expressions often used in logic; that is, why are such expressions as “x is a round triangle” applied in logic? We critically discuss this question from an extensional viewpoint, namely model theoretic semantics (ch.2). We also touch on Church’s λ-calculus in the appendix (app.2).
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  6. What is LK? Vol.1. Sequent (Textbook Series in Symbolic Logic).Yusuke Kaneko - 2023 - Amazon Kindle.
    LK is much more difficult than NK, and to make matters worse, Gentzen's intention is still unclear when it comes to that system (LK). -/- This book, Vol.1 of the series titled What is LK?, tackles this issue, focusing on the sequent, the most enigmatic notion we find in LK. The dependence-relation we find in NK shall play a crucial role in that investigation. -/- The style is typically textbook-like, so readers can learn the system of LK, using this series (...)
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  7. In Quest of Universal Logic: A brief overview of formal logic's evolution. [REVIEW]Arman Kashef - 2023 - Researchgate.
    As a result of trying to distinguish between what we do not know as humans and what we do know, concepts such as dialectic were formed. On this basis, logic was developed to monitor arguments' validity and provide methods for creating valid complex arguments. This work provides a brief overview of such topics and studies the development of formal logic and its semantics. In doing so, we enter the territory of propositional logic and predicate logic. In the next edition, we (...)
    Remove from this list   Direct download  
     
    Export citation  
     
    Bookmark  
  8. Gödel’s Theorem and Direct Self-Reference.Saul A. Kripke - 2023 - Review of Symbolic Logic 16 (2):650-654.
    In his paper on the incompleteness theorems, Gödel seemed to say that a direct way of constructing a formula that says of itself that it is unprovable might involve a faulty circularity. In this note, it is proved that ‘direct’ self-reference can actually be used to prove his result.
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark   4 citations  
  9. Epsilon theorems in intermediate logics.Matthias Baaz & Richard Zach - 2022 - Journal of Symbolic Logic 87 (2):682-720.
    Any intermediate propositional logic can be extended to a calculus with epsilon- and tau-operators and critical formulas. For classical logic, this results in Hilbert’s $\varepsilon $ -calculus. The first and second $\varepsilon $ -theorems for classical logic establish conservativity of the $\varepsilon $ -calculus over its classical base logic. It is well known that the second $\varepsilon $ -theorem fails for the intuitionistic $\varepsilon $ -calculus, as prenexation is impossible. The paper investigates the effect of adding critical $\varepsilon $ - (...)
    Remove from this list   Direct download (4 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  10. In Defence of Discrete Plural Logic (or How to Avoid Logical Overmedication When Dealing with Internally Singularized Pluralities).Gustavo Picazo - 2022 - Disputatio 14 (64):51-63.
    In recent decades, plural logic has established itself as a well-respected member of the extensions of first-order classical logic. In the present paper, I draw attention to the fact that among the examples that are commonly given in order to motivate the need for this new logical system, there are some in which the elements of the plurality in question are internally singularized (e.g. ‘Whitehead and Russell wrote Principia Mathematica’), while in others they are not (e.g. ‘Some philosophers wrote Principia (...)
    Remove from this list   Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  11. Oliver and Smiley on the Collective–Distributive Opposition.Gustavo Picazo - 2022 - Logos and Episteme 13 (2):201-205.
    Two objections are raised against Oliver and Smiley’s analysis of the collective–distributive opposition in their 2016 book: They take it as a basic premise that the collective reading of ‘baked a cake’ corresponds to a predicate different from its distributive reading, and the same applies to all predicate expressions that admit both a collective and a distributive interpretation. At the same time, however, they argue that inflectional forms of the same lexeme reveal a univocity that should be preserved in a (...)
    Remove from this list   Direct download (4 more)  
     
    Export citation  
     
    Bookmark  
  12. Possibility Semantics.Wesley H. Holliday - 2021 - In Melvin Fitting (ed.), Selected Topics from Contemporary Logics. London: College Publications. pp. 363-476.
    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 (...)
    Remove from this list   Direct download  
     
    Export citation  
     
    Bookmark   6 citations  
  13. LOGIC: Lecture Notes for Philosophy, Mathematics, and Computer Science.Andrea Iacona - 2021 - Springer.
    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 (...)
    Remove from this list   Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  14. Normalisation and subformula property for a system of classical logic with Tarski’s rule.Nils Kürbis - 2021 - 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. (...)
    Remove from this list   Direct download (4 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  15. A Binary Quantifier for Definite Descriptions for Cut Free Free Logics.Nils Kürbis - 2021 - Studia Logica 110 (1):219-239.
    This paper presents rules in sequent calculus for a binary quantifier I to formalise definite descriptions: Ix[F, G] means ‘The F is G’. The rules are suitable to be added to a system of positive free logic. The paper extends the proof of a cut elimination theorem for this system by Indrzejczak by proving the cases for the rules of I. There are also brief comparisons of the present approach to the more common one that formalises definite descriptions with a (...)
    Remove from this list   Direct download (4 more)  
     
    Export citation  
     
    Bookmark  
  16. 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. (...)
    Remove from this list   Direct download  
     
    Export citation  
     
    Bookmark   2 citations  
  17. The Barcan formulas and necessary existence: the view from Quarc.Hanoch Ben-Yami - 2020 - Synthese 198 (11):11029-11064.
    The Modal Predicate Calculus gives rise to issues surrounding the Barcan formulas, their converses, and necessary existence. I examine these issues by means of the Quantified Argument Calculus, a recently developed, powerful formal logic system. Quarc is closer in syntax and logical properties to Natural Language than is the Predicate Calculus, a fact that lends additional interest to this examination, as Quarc might offer a better representation of our modal concepts. The validity of the Barcan formulas and their converses is (...)
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark   4 citations  
  18. Stoic logic and multiple generality.Susanne Bobzien & Simon Shogry - 2020 - Philosophers' Imprint 20 (31):1-36.
    We argue that the extant evidence for Stoic logic provides all the elements required for a variable-free theory of multiple generality, including a number of remarkably modern features that straddle logic and semantics, such as the understanding of one- and two-place predicates as functions, the canonical formulation of universals as quantified conditionals, a straightforward relation between elements of propositional and first-order logic, and the roles of anaphora and rigid order in the regimented sentences that express multiply general propositions. We consider (...)
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark   8 citations  
  19. An axiomatic approach to theodicy via formal applied systems.Gesiel B. Da Silva - 2020 - Dissertation, University of Campinas
    Edward Nieznański developed two logical systems in order to deal with a version of the problem of evil associated with two formulations of religious determinism. The aim of this research was to revisit these systems, providing them with a more appropriate formalization. The new resulting systems, namely, N1 and N2, were reformulated in first-order modal logic; they retain much of their original basic structures, but some additional results were obtained. Furthermore, our research found that an underlying minimal set of axioms (...)
    Remove from this list   Direct download  
     
    Export citation  
     
    Bookmark   1 citation  
  20. 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 (...)
    Remove from this list   Direct download  
     
    Export citation  
     
    Bookmark  
  21. truthmakers for 1st order sentences - a proposal.Friedrich Wilhelm Grafe - 2020 - Archive.Org.
    The purpose of this paper is to communicate - as a proposal - a general method of assigning a 'truthmaker' to any 1st order sentence in each of its models. The respective construct is derived from the standard model theoretic (recursive) satisfaction definition for 1st order languages and is a conservative extension thereof. The heuristics of the proposal (which has been somewhat idiosyncratic from the current point of view) and some more technical detail of the construction may be found in (...)
    Remove from this list   Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  22. 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 (...)
    Remove from this list   Direct download (4 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  23. Extended Syllogistics in Calculus CL.Jens Lemanski - 2020 - Journal of Applied Logics 8 (2):557-577.
    Extensions of traditional syllogistics have been increasingly researched in philosophy, linguistics, and areas such as artificial intelligence and computer science in recent decades. This is mainly due to the fact that syllogistics is seen as a logic that comes very close to natural language abilities. Various forms of extended syllogistics have become established. This paper deals with the question to what extent a syllogistic representation in CL diagrams can be seen as a form of extended syllogistics. It will be shown (...)
    Remove from this list   Direct download  
     
    Export citation  
     
    Bookmark   3 citations  
  24. Form and Content: An Introduction to Formal Logic.Derek D. Turner - 2020 - Digital Commons @ Connecticut College.
    Derek Turner, Professor of Philosophy, has written an introductory logic textbook that students at Connecticut College, or anywhere, can access for free. The book differs from other standard logic textbooks in its reliance on fun, low-stakes examples involving dinosaurs, a dog and his friends, etc. This work is published in 2020 under a Creative Commons AttributionNonCommercial-NoDerivatives 4.0 International License. You may share this text in any format or medium. You may not use it for commercial purposes. If you share it, (...)
    Remove from this list   Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  25. 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.
    Remove from this list   Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  26. Edgar Morscher: Die wissenschaftliche Definition. [REVIEW]Moritz Cordes - 2018 - Zeitschrift für Philosophische Forschung 72:443-446.
  27. The proper treatment of variables in predicate logic.Kai F. Wehmeier - 2018 - Linguistics and Philosophy 41 (2):209-249.
    In §93 of The Principles of Mathematics, Bertrand Russell observes that “the variable is a very complicated logical entity, by no means easy to analyze correctly”. This assessment is borne out by the fact that even now we have no fully satisfactory understanding of the role of variables in a compositional semantics for first-order logic. In standard Tarskian semantics, variables are treated as meaning-bearing entities; moreover, they serve as the basic building blocks of all meanings, which are constructed out of (...)
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark   7 citations  
  28. Categories of First-Order Quantifiers.Urszula Wybraniec-Skardowska - 2018 - In Urszula Wybraniec-Skardowska & Ángel Garrido (eds.), The Lvov-Warsaw School. Past and Present. Basel, Switzerland: Springer- Birkhauser,. pp. 575-597.
    One well known problem regarding quantifiers, in particular the 1storder quantifiers, is connected with their syntactic categories and denotations. The unsatisfactory efforts to establish the syntactic and ontological categories of quantifiers in formalized first-order languages can be solved by means of the so called principle of categorial compatibility formulated by Roman Suszko, referring to some innovative ideas of Gottlob Frege and visible in syntactic and semantic compatibility of language expressions. In the paper the principle is introduced for categorial languages generated (...)
    Remove from this list   Direct download (3 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  29. 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 (...)
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark   5 citations  
  30. Disquotation and Infinite Conjunctions.Thomas Schindler & Lavinia Picollo - 2017 - Erkenntnis 83 (5):899-928.
    One of the main logical functions of the truth predicate is to enable us to express so-called ‘infinite conjunctions’. Several authors claim that the truth predicate can serve this function only if it is fully disquotational, which leads to triviality in classical logic. As a consequence, many have concluded that classical logic should be rejected. The purpose of this paper is threefold. First, we consider two accounts available in the literature of what it means to express infinite conjunctions with a (...)
    Remove from this list   Direct download (5 more)  
     
    Export citation  
     
    Bookmark   17 citations  
  31. Semantics and Proof Theory of the Epsilon Calculus.Richard Zach - 2017 - In Sujata Ghosh & Sanjiva Prasad (eds.), Logic and Its Applications. ICLA 2017. Berlin, Heidelberg: Springer. pp. 27-47.
    The epsilon operator is a term-forming operator which replaces quantifiers in ordinary predicate logic. The application of this undervalued formalism has been hampered by the absence of well-behaved proof systems on the one hand, and accessible presentations of its theory on the other. One significant early result for the original axiomatic proof system for the epsilon-calculus is the first epsilon theorem, for which a proof is sketched. The system itself is discussed, also relative to possible semantic interpretations. The problems facing (...)
    Remove from this list   Direct download (3 more)  
     
    Export citation  
     
    Bookmark   4 citations  
  32. The Truth Assignments That Differentiate Human Reasoning From Mechanistic Reasoning: The Evidence-Based Argument for Lucas' Goedelian Thesis.Bhupinder Singh Anand - 2016 - Cognitive Systems Research 40:35-45.
    We consider the argument that Tarski's classic definitions permit an intelligence---whether human or mechanistic---to admit finitary evidence-based definitions of the satisfaction and truth of the atomic formulas of the first-order Peano Arithmetic PA over the domain N of the natural numbers in two, hitherto unsuspected and essentially different, ways: (1) in terms of classical algorithmic verifiabilty; and (2) in terms of finitary algorithmic computability. We then show that the two definitions correspond to two distinctly different assignments of satisfaction and truth (...)
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  33. Gödel's slingshot revisited: does russell's theory of descriptions really evade the slingshot.João Daniel Dantas - 2016 - Dissertation, Ufrn
    “Slingshot Arguments” are a family of arguments underlying the Fregean view that if sentences have reference at all, their references are their truth-values. Usually seen as a kind of collapsing argument, the slingshot consists in proving that, once you suppose that there are some items that are references of sentences (as facts or situations, for example), these items collapse into just two items: The True and The False. This dissertation treats of the slingshot dubbed “Gödel’s slingshot”. Gödel argued that there (...)
    Remove from this list   Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  34. Against Fantology Again.Ingvar Johansson - 2016 - In Leo Zaibert (ed.), The Theory and Practice of Ontology. London: pp. 25-43.
    This essay expands on Barry Smith’s paper “Against Fantology” of 2005, which defends the view that analytic philosophy has throughout its history been marked by a tendency to conceive the syntax of first-order predicate logic as a key to ontology. I present fantology (or "F(a)ntology") in the light of a more general and in itself ontologically neutral operation that I call a default ontologization of a language. I then discuss Quine’s views, since he is the most outspoken fantologist in the (...)
    Remove from this list   Direct download  
     
    Export citation  
     
    Bookmark   2 citations  
  35. Logika.Srećko Kovač - 2016 - Zagreb: Hrvatska sveučilišna naklada, 15th edition, corrected and revised.
    The book contains an introduction to basic logical concepts and methods. It covers traditional logic of categorical judgment and syllogism, modern propositional logic, and introductory elements of predicate logic with corresponding methods (truth tables, natural deduction, truth trees).
    Remove from this list   Direct download  
     
    Export citation  
     
    Bookmark  
  36. 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.
    Remove from this list   Direct download  
     
    Export citation  
     
    Bookmark   3 citations  
  37. Existential Import Today: New Metatheorems; Historical, Philosophical, and Pedagogical Misconceptions.John Corcoran & Hassan Masoud - 2015 - History and Philosophy of Logic 36 (1):39-61.
    Contrary to common misconceptions, today's logic is not devoid of existential import: the universalized conditional ∀ x [S→ P] implies its corresponding existentialized conjunction ∃ x [S & P], not in all cases, but in some. We characterize the proexamples by proving the Existential-Import Equivalence: The antecedent S of the universalized conditional alone determines whether the universalized conditional has existential import, i.e. whether it implies its corresponding existentialized conjunction.A predicate is an open formula having only x free. An existential-import predicate (...)
    Remove from this list   Direct download (7 more)  
     
    Export citation  
     
    Bookmark   4 citations  
  38. Forms of Thought, by E. J. Lowe. [REVIEW]Brian Ball - 2014 - Mind 123 (492):1205-1208.
    Remove from this list   Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  39. An alternative approach for Quasi-Truth.Marcelo E. Coniglio & Luiz H. Da Cruz Silvestrini - 2014 - Logic Journal of the IGPL 22 (2):387-410.
    In 1986, Mikenberg et al. introduced the semantic notion of quasi-truth defined by means of partial structures. In such structures, the predicates are seen as triples of pairwise disjoint sets: the set of tuples which satisfies, does not satisfy and can satisfy or not the predicate, respectively. The syntactical counterpart of the logic of partial truth is a rather complicated first-order modal logic. In the present article, the notion of predicates as triples is recursively extended, in a natural way, to (...)
    Remove from this list   Direct download (3 more)  
     
    Export citation  
     
    Bookmark   13 citations  
  40. “Truth-preserving and consequence-preserving deduction rules”,.John Corcoran - 2014 - Bulletin of Symbolic Logic 20 (1):130-1.
    A truth-preservation fallacy is using the concept of truth-preservation where some other concept is needed. For example, in certain contexts saying that consequences can be deduced from premises using truth-preserving deduction rules is a fallacy if it suggests that all truth-preserving rules are consequence-preserving. The arithmetic additive-associativity rule that yields 6 = (3 + (2 + 1)) from 6 = ((3 + 2) + 1) is truth-preserving but not consequence-preserving. As noted in James Gasser’s dissertation, Leibniz has been criticized for (...)
    Remove from this list   Direct download  
     
    Export citation  
     
    Bookmark  
  41. The First-Order Syntax of Variadic Functions.Samuel Alexander - 2013 - Notre Dame Journal of Formal Logic 54 (1):47-59.
    We extend first-order logic to include variadic function symbols, and prove a substitution lemma. Two applications are given: one to bounded quantifier elimination and one to the definability of certain Borel sets.
    Remove from this list   Direct download (8 more)  
     
    Export citation  
     
    Bookmark  
  42. The Cube, the Square and the Problem of Existential Import.Saloua Chatti & Fabien Schang - 2013 - History and Philosophy of Logic 34 (2):101-132.
    We re-examine the problem of existential import by using classical predicate logic. Our problem is: How to distribute the existential import among the quantified propositions in order for all the relations of the logical square to be valid? After defining existential import and scrutinizing the available solutions, we distinguish between three possible cases: explicit import, implicit non-import, explicit negative import and formalize the propositions accordingly. Then, we examine the 16 combinations between the 8 propositions having the first two kinds of (...)
    Remove from this list   Direct download (5 more)  
     
    Export citation  
     
    Bookmark   14 citations  
  43. The logic of failures of the cinematic imagination: Two case studies – and a logical puzzle and solution in just one.Joseph S. Fulda - 2013 - Pragmatics and Society 4 (1):105-111.
    This piece is intended to explicate - by providing a precising definition of - the common cinematic figure which I term “the failure of the cinematic imagination,“ while presenting a logical puzzle and its solution within a simple Gricean framework. -/- It should be noted that this is neither fully accurate nor fully precise, because of the audience; one should examine the remaining articles in the issue to understand what I mean.
    Remove from this list   Direct download (4 more)  
     
    Export citation  
     
    Bookmark  
  44. Criteria for logical formalization.Jaroslav Peregrin & Vladimír Svoboda - 2013 - Synthese 190 (14):2897-2924.
    The article addresses two closely related questions: What are the criteria of adequacy of logical formalization of natural language arguments, and what gives logic the authority to decide which arguments are good and which are bad? Our point of departure is the criticism of the conception of logical formalization put forth, in a recent paper, by M. Baumgartner and T. Lampert. We argue that their account of formalization as a kind of semantic analysis brings about more problems than it solves. (...)
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark   12 citations  
  45. Reasoning About Truth in First-Order Logic.Claes Strannegård, Fredrik Engström, Abdul Rahim Nizamani & Lance Rips - 2013 - Journal of Logic, Language and Information 22 (1):115-137.
    First, we describe a psychological experiment in which the participants were asked to determine whether sentences of first-order logic were true or false in finite graphs. Second, we define two proof systems for reasoning about truth and falsity in first-order logic. These proof systems feature explicit models of cognitive resources such as declarative memory, procedural memory, working memory, and sensory memory. Third, we describe a computer program that is used to find the smallest proofs in the aforementioned proof systems when (...)
    Remove from this list   Direct download (7 more)  
     
    Export citation  
     
    Bookmark  
  46. Which Mathematical Logic is the Logic of Mathematics?Jaakko Hintikka - 2012 - Logica Universalis 6 (3-4):459-475.
    The main tool of the arithmetization and logization of analysis in the history of nineteenth century mathematics was an informal logic of quantifiers in the guise of the “epsilon–delta” technique. Mathematicians slowly worked out the problems encountered in using it, but logicians from Frege on did not understand it let alone formalize it, and instead used an unnecessarily poor logic of quantifiers, viz. the traditional, first-order logic. This logic does not e.g. allow the definition and study of mathematicians’ uniformity concepts (...)
    Remove from this list   Direct download (7 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  47. Logic: The Laws of Truth.Nicholas J. J. Smith - 2012 - Princeton, N.J.: Princeton University Press.
    Logic is essential to correct reasoning and also has important theoretical applications in philosophy, computer science, linguistics, and mathematics. This book provides an exceptionally clear introduction to classical logic, with a unique approach that emphasizes both the hows and whys of logic. Here Nicholas Smith thoroughly covers the formal tools and techniques of logic while also imparting a deeper understanding of their underlying rationales and broader philosophical significance. In addition, this is the only introduction to logic available today that presents (...)
    Remove from this list   Direct download (4 more)  
     
    Export citation  
     
    Bookmark   20 citations  
  48. Logic: The Drill.Nicholas J. J. Smith & John Cusbert - 2012 - Princeton University Press.
    Contains exercises and solutions to accompany Logic: The Laws of Truth by Nicholas J. J. Smith (Princeton University Press, 2012).
    Remove from this list   Direct download  
     
    Export citation  
     
    Bookmark  
  49. Introduction to mathematical logic.Micha? Walicki - 2012 - Hackensack, NJ: World Scientific.
    A history of logic -- Patterns of reasoning -- A language and its meaning -- A symbolic language -- 1850-1950 mathematical logic -- Modern symbolic logic -- Elements of set theory -- Sets, functions, relations -- Induction -- Turning machines -- Computability and decidability -- Propositional logic -- Syntax and proof systems -- Semantics of PL -- Soundness and completeness -- First order logic -- Syntax and proof systems of FOL -- Semantics of FOL -- More semantics -- Soundness and (...)
    Remove from this list   Direct download  
     
    Export citation  
     
    Bookmark   2 citations  
  50. Ein Redehandlungskalkül: Folgern in einer Sprache.Moritz Cordes & Friedrich Reinmuth - 2011 - XXII. Deutscher Kongress Für Philosophie.
    Wir stellen einen pragmatisierten Kalkül des natürlichen Schließens vor, der sich dadurch auszeichnet, dass Ableitungen reine Folgen objektsprachlicher Sätze sind und ohne graphische oder andere Kommentarmittel auskommen.
    Remove from this list   Direct download  
     
    Export citation  
     
    Bookmark  
1 — 50 / 230