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.
  Show all references
Related categories
Siblings:See also:
169 found
Search inside:
(import / add options)   Sort by:
1 — 50 / 169
  1. Jonathan E. Adler (2000). First-Order Logic. Journal of Philosophy 97 (10):577-580.
    Remove from this list | Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  2. Henry Africk (1992). Classical Logic, Intuitionistic Logic, and the Peirce Rule. Notre Dame Journal of Formal Logic 33 (2):229-235.
    A simple method is provided for translating proofs in Grentzen's LK into proofs in Gentzen's LJ with the Peirce rule adjoined. A consequence is a simpler cut elimination operator for LJ + Peirce that is primitive recursive.
    Remove from this list | Direct download (5 more)  
     
    My bibliography  
     
    Export citation  
  3. Samuel Alexander (2013). The First-Order Syntax of Variadic Functions. 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 (5 more)  
     
    My bibliography  
     
    Export citation  
  4. Robert A. Alps & Robert C. Neveln (1981). A Predicate Logic Based on Indefinite Description and Two Notions of Identity. Notre Dame Journal of Formal Logic 22 (3):251-263.
  5. Alice Ambrose (1962). Fundamentals of Symbolic Logic. New York, Holt, Rinehart and Winston.
  6. Mohamed A. Amer (1989). First Order Logic with Empty Structures. Studia Logica 48 (2):169 - 177.
    For first order languages with no individual constants, empty structures and truth values (for sentences) in them are defined. The first order theories of the empty structures and of all structures (the empty ones included) are axiomatized with modus ponens as the only rule of inference. Compactness is proved and decidability is discussed. Furthermore, some well known theorems of model theory are reconsidered under this new situation. Finally, a word is said on other approaches to the whole problem.
    Remove from this list | Direct download (5 more)  
     
    My bibliography  
     
    Export citation  
  7. Edgar Jose Andrade & Edward Samuel Becerra (2008). Establishing Connections Between Aristotle's Natural Deduction and First-Order Logic. History and Philosophy of Logic 29 (4):309-325.
    This article studies the mathematical properties of two systems that model Aristotle's original syllogistic and the relationship obtaining between them. These systems are Corcoran's natural deduction syllogistic and ?ukasiewicz's axiomatization of the syllogistic. We show that by translating the former into a first-order theory, which we call T RD, we can establish a precise relationship between the two systems. We prove within the framework of first-order logic a number of logical properties about T RD that bear upon the same properties (...)
    Remove from this list | Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  8. R. B. Angell (1986). Truth-Functional Conditionals and Modern Vs. Traditional Syllogistic. Mind 95 (378):210-223.
  9. Mohammad Ardeshir (1999). A Translation of Intuitionistic Predicate Logic Into Basic Predicate Logic. Studia Logica 62 (3):341-352.
    Basic Predicate Logic, BQC, is a proper subsystem of Intuitionistic Predicate Logic, IQC. For every formula in the language {, , , , , , }, we associate two sequences of formulas 0,1,... and 0,1,... in the same language. We prove that for every sequent , there are natural numbers m, n, such that IQC , iff BQC n m. Some applications of this translation are mentioned.
    Remove from this list | Direct download (7 more)  
     
    My bibliography  
     
    Export citation  
  10. Axel Arturo Barceló Aspeitia (2007). What Does '&' Mean? The Proceedings of the Twenty-First World Congress of Philosophy 5:45-50.
    Using conjunction as an example, I show a technical and philosophical problem when trying to conciliate the currently prevailing views on the meaning of logical connectives: the inferientialist (also called 'syntactic') one based on introduction and elimination rules, and the representationalist (also called 'semantic') one given through truth tables. Mostly I show that the widespread strategy of using the truth theoretical definition of logical consequence to collapse both definitions must be rejected by inferentialists. An important consequence of my argument is (...)
    Remove from this list | Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  11. Jeremy Avigad, Eliminating Definitions and Skolem Functions in First-Order Logic.
    From proofs in any classical first-order theory that proves the existence of at least two elements, one can eliminate definitions in polynomial time. From proofs in any classical first-order theory strong enough to code finite functions, including sequential theories, one can also eliminate Skolem functions in polynomial time.
    Remove from this list | Direct download (5 more)  
     
    My bibliography  
     
    Export citation  
  12. Jeremy Avigad & Richard Zach, The Epsilon Calculus. Stanford Encyclopedia of Philosophy.
    The epsilon calculus is a logical formalism developed by David Hilbert in the service of his program in the foundations of mathematics. The epsilon operator is a term-forming operator which replaces quantifiers in ordinary predicate logic. Specifically, in the calculus, a term..
    Remove from this list | Direct download  
     
    My bibliography  
     
    Export citation  
  13. John Bacon (1982). First-Order Logic Based on Inclusion and Abstraction. Journal of Symbolic Logic 47 (4):793-808.
  14. John Bacon (1975). Elementary Symbolic Logic. Teaching Philosophy 1 (2):220-221.
  15. A. J. Baker (1977). Classical Logical Relations. Notre Dame Journal of Formal Logic 18 (1):164-168.
    Remove from this list | Direct download (4 more)  
     
    My bibliography  
     
    Export citation  
  16. John A. Barker (1975). Relevance Logic, Classical Logic, and Disjunctive Syllogism. Philosophical Studies 27 (6):361 - 376.
  17. Stephen Barker (1997). Material Implication and General Indicative Conditionals. Philosophical Quarterly 47 (187):195-211.
    This paper falls into two parts. In the first part, I argue that consideration of general indicative conditionals, e.g., sentences like If a donkey brays it is beaten, provides a powerful argument that a pure material implication analysis of indicative if p, q is correct. In the second part I argue, opposing writers like Jackson, that a Gricean style theory of pragmatics can explain the manifest assertability conditions of if p, q in terms of its conventional content – assumed to (...)
    Remove from this list | Direct download (8 more)  
     
    My bibliography  
     
    Export citation  
  18. Michael Baumgartner & Timm Lampert (2008). Adequate Formalization. Synthese 164 (1):93-115.
    This article identifies problems with regard to providing criteria that regulate the matching of logical formulae and natural language. We then take on to solve these problems by defining a necessary and sufficient criterion of adequate formalization. On the basis of this criterion we argue that logic should not be seen as an ars iudicandi capable of evaluating the validity or invalidity of informal arguments, but as an ars explicandi that renders transparent the formal structure of informal reasoning.
    Remove from this list | Direct download (6 more)  
     
    My bibliography  
     
    Export citation  
  19. Richard Beatty (1969). Peirce's Development of Quantifiers and of Predicate Logic. Notre Dame Journal of Formal Logic 10 (1):64-76.
  20. David Bell (1971). Fallacies in Predicate Logic? Mind 80 (317):145-147.
    Remove from this list | Direct download (5 more)  
     
    My bibliography  
     
    Export citation  
  21. Alfred W. Benn (1907). Symbolic Logic (a Reply). Mind 16 (63):470-473.
    Remove from this list | Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  22. Katalin Bimbó (2010). Schönfinkel-Type Operators for Classical Logic. Studia Logica 95 (3):355-378.
    We briefly overview some of the historical landmarks on the path leading to the reduction of the number of logical connectives in classical logic. Relying on the duality inherent in Boolean algebras, we introduce a new operator ( Nallor ) that is the dual of Schönfinkel’s operator. We outline the proof that this operator by itself is sufficient to define all the connectives and operators of classical first-order logic ( Fol ). Having scrutinized the proof, we pinpoint the theorems of (...)
    Remove from this list | Direct download (6 more)  
     
    My bibliography  
     
    Export citation  
  23. Katalin Bimbó, Combinatory Logic. Stanford Encyclopedia of Philosophy.
    Remove from this list | Direct download  
     
    My bibliography  
     
    Export citation  
  24. V. A. Bocharov (1983). Subject-Predicate Calculus Free From Existential Import. Studia Logica 42 (2-3):209 - 221.
    Two subject-predicate calculi with equality,SP = and its extensionUSP =, are presented as systems of natural deduction. Both the calculi are systems of free logic. Their presentation is preceded by an intuitive motivation.It is shown that Aristotle's syllogistics without the laws of identitySaP andSiP is definable withinSP =, and that the first-order predicate logic is definable withinUSP =.
    Remove from this list | Direct download (5 more)  
     
    My bibliography  
     
    Export citation  
  25. Ivan Boh (1962). Symbolic Logic. Modern Schoolman 39 (3):277-281.
    Remove from this list | Direct download (4 more)  
     
    My bibliography  
     
    Export citation  
  26. L. Borkowski (1961). A Didactical Approach to the Zero-One Decision Procedure of the Expressions of the First Order Monadic Predicate Calculus. Studia Logica 11 (1):76.
    Remove from this list | Direct download (4 more)  
     
    My bibliography  
     
    Export citation  
  27. Ludwik Borkowski (1957). Systems of the Propositional and of the Functional Calculus Based on One Primitive Term. Studia Logica 6 (1):7 - 55.
  28. Eric M. Brown, Logic II: The Theory of Propositions.
    This is part two of a complete exposition of Logic, in which there is a radically new synthesis of Aristotelian-Scholastic Logic with modern Logic. Part II is the presentation of the theory of propositions. Simple, composite, atomic, compound, modal, and tensed propositions are all examined. Valid consequences and propositional logical identities are rigorously proven. Modal logic is rigorously defined and proven. This is the first work of Logic known to unite Aristotelian logic and modern logic using scholastic logic as the (...)
    Remove from this list | Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  29. Kai Brünnler (2006). Cut Elimination Inside a Deep Inference System for Classical Predicate Logic. Studia Logica 82 (1):51 - 71.
    Deep inference is a natural generalisation of the one-sided sequent calculus where rules are allowed to apply deeply inside formulas, much like rewrite rules in term rewriting. This freedom in applying inference rules allows to express logical systems that are difficult or impossible to express in the cut-free sequent calculus and it also allows for a more fine-grained analysis of derivations than the sequent calculus. However, the same freedom also makes it harder to carry out this analysis, in particular it (...)
    Remove from this list | Direct download (6 more)  
     
    My bibliography  
     
    Export citation  
  30. C. Butz & I. Moerdijk (1999). An Elementary Definability Theorem for First Order Logic. Journal of Symbolic Logic 64 (3):1028-1036.
    Remove from this list | Direct download (6 more)  
     
    My bibliography  
     
    Export citation  
  31. John Byrnes (1998). Peirce's First-Order Logic of 1885. Transactions of the Charles S. Peirce Society 34 (4):949 - 976.
    Remove from this list | Direct download  
     
    My bibliography  
     
    Export citation  
  32. F. K. C. (1978). Lewis Carroll's Symbolic Logic. Review of Metaphysics 31 (3):472-473.
    Remove from this list | Direct download  
     
    My bibliography  
     
    Export citation  
  33. W. C. C. (1952). Book Review:Symbolic Logic C. I. Lewis, C. H. Langford. [REVIEW] Philosophy of Science 19 (2):180-.
    Remove from this list | Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  34. Ricardo Caferra, Stéphane Demri & Michel Herment (1993). A Framework for the Transfer of Proofs, Lemmas and Strategies From Classical to Non Classical Logics. Studia Logica 52 (2):197 - 232.
    There exist valuable methods for theorem proving in non classical logics based on translation from these logics into first-order classical logic (abbreviated henceforth FOL). The key notion in these approaches istranslation from aSource Logic (henceforth abbreviated SL) to aTarget Logic (henceforth abbreviated TL). These methods are concerned with the problem offinding a proof in TL by translating a formula in SL, but they do not address the very important problem ofpresenting proofs in SL via a backward translation. We propose a (...)
    Remove from this list | Direct download (5 more)  
     
    My bibliography  
     
    Export citation  
  35. James D. Carney (1970). Introduction to Symbolic Logic. Englewood Cliffs, N.J.,Prentice-Hall.
    Remove from this list |
     
    My bibliography  
     
    Export citation  
  36. Leigh S. Cauman (1998). First-Order Logic: An Introduction. Walter De Gruyter.
    Introduction This is an elementary logic book designed for people who have no technical familiarity with modern logic but who have been reasoning, ...
    Remove from this list | Direct download  
     
    My bibliography  
     
    Export citation  
  37. Anthony Pike Cavendish (1953). Introduction to Symbolic Logic. University Tutorial Press.
    Remove from this list |
     
    My bibliography  
     
    Export citation  
  38. Douglas Cenzer & Jeffrey B. Remmel (2006). Complexity, Decidability and Completeness. Journal of Symbolic Logic 71 (2):399 - 424.
    We give resource bounded versions of the Completeness Theorem for propositional and predicate logic. For example, it is well known that every computable consistent propositional theory has a computable complete consistent extension. We show that, when length is measured relative to the binary representation of natural numbers and formulas, every polynomial time decidable propositional theory has an exponential time (EXPTIME) complete consistent extension whereas there is a nondeterministic polynomial time (NP) decidable theory which has no polynomial time complete consistent extension (...)
    Remove from this list | Direct download (4 more)  
     
    My bibliography  
     
    Export citation  
  39. Chin-Liang Chang (1973/1987). Symbolic Logic and Mechanical Theorem Proving. Academic Press.
    This book contains an introduction to symbolic logic and a thorough discussion of mechanical theorem proving and its applications. The book consists of three major parts. Chapters 2 and 3 constitute an introduction to symbolic logic. Chapters 4–9 introduce several techniques in mechanical theorem proving, and Chapters 10 an 11 show how theorem proving can be applied to various areas such as question answering, problem solving, program analysis, and program synthesis.
    Remove from this list |
     
    My bibliography  
     
    Export citation  
  40. Saloua Chatti & Fabien Schang (2013). The Cube, the Square and the Problem of Existential Import. History and Philosophy of Logic 34 (2):101 - 132.
    (2013). The Cube, the Square and the Problem of Existential Import. History and Philosophy of Logic: Vol. 34, No. 2, pp. 101-132. doi: 10.1080/01445340.2013.764962.
    Remove from this list | Direct download (4 more)  
     
    My bibliography  
     
    Export citation  
  41. D. S. Clarke (1973). Deductive Logic. Carbondale,Southern Illinois University Press.
    This introduction to the basic forms of deductive inference as evaluated by methods of modern symbolic logic is de­signed for sophomore-junior-level stu­dents ready to specialize in the study of deductive logic. It can be used also for an introductory logic course. The inde­pendence of many sections allows the instructor utmost flexibility. The text consists of eight chapters, the first six of which are designed to intro­duce the student to basic topics of sen­tence and predicate logic. The last two chapters extend (...)
    Remove from this list |
     
    My bibliography  
     
    Export citation  
  42. Brian Coffey (1948). Elements of Symbolic Logic. Modern Schoolman 25 (3):198-202.
    Remove from this list | Direct download (4 more)  
     
    My bibliography  
     
    Export citation  
  43. Irving M. Copi (1973/1968). Symbolic Logic. New York,Macmillan.
  44. John Corcoran & Hassan Masoud (forthcoming). Existential Import Today: New Metatheorems; Historical, Philosophical, and Pedagogical Misconceptions. History and Philosophy of Logic:1-23.
    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)  
     
    My bibliography  
     
    Export citation  
  45. Moritz Cordes & Friedrich Reinmuth, A Speech Act Calculus. A Pragmatised Natural Deduction Calculus and its Meta-Theory.
    Building on the work of Peter Hinst and Geo Siegwart, we develop a pragmatised natural deduction calculus, i.e. a natural deduction calculus that incorporates illocutionary operators at the formal level, and prove its adequacy. In contrast to other linear calculi of natural deduction, derivations in this calculus are sequences of object-language sentences which do not require graphical or other means of commentary in order to keep track of assumptions or to indicate subproofs. (Translation of our German paper "Ein Redehandlungskalkül. Ein (...)
    Remove from this list | Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  46. Moritz Cordes & Friedrich Reinmuth, Ein Redehandlungskalkül. Ein pragmatisierter Kalkül des natürlichen Schließens nebst Metatheorie.
    Building on the work of Peter Hinst and Geo Siegwart, we develop a pragmatised natural deduction calculus, i.e., a natural deduction calculus that incorporates illocutionary operators at the formal level, and prove its adequacy. In contrast to other linear calculi of natural deduction, derivations in this calculus are sequences of object-language sentences which do not require graphical or other means of commentary in order to keep track of assumptions or to indicate subproofs.
    Remove from this list |
    Translate to English
    | Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  47. Moritz Cordes & Friedrich Reinmuth, Ein Redehandlungskalkül: Folgern in einer Sprache. XXII. Deutscher Kongress für Philosophie.
    Remove from this list |
    Translate to English
    | Direct download  
     
    My bibliography  
     
    Export citation  
  48. René Cori (2000). Mathematical Logic: A Course with Exercises. Oxford University Press.
    Logic forms the basis of mathematics and is a fundamental part of any mathematics course. This book provides students with a clear and accessible introduction to this important subject, using the concept of model as the main focus and covering a wide area of logic. The chapters of the book cover propositional calculus, boolean algebras, predicate calculus and completelness theorems with answeres to all of the excercises and the end of the volume. This is an ideal introduction to mathematics and (...)
    Remove from this list |
     
    My bibliography  
     
    Export citation  
  49. William Craig (2008). The Road to Two Theorems of Logic. Synthese 164 (3):333 - 339.
    Work on how to axiomatize the subtheories of a first-order theory in which only a proper subset of their extra-logical vocabulary is being used led to a theorem on recursive axiomatizability and to an interpolation theorem for first-order logic. There were some fortuitous events and several logicians played a helpful role.
    Remove from this list | Direct download (5 more)  
     
    My bibliography  
     
    Export citation  
  50. J. D. (1963). Fundamentals of Symbolic Logic. Review of Metaphysics 16 (3):579-579.
1 — 50 / 169