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

# Predicate Logic

 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 categories

184 found
Order:
 1 — 50 / 184
1. Symbolic Logic. [REVIEW]E. J. A. - 1966 - Review of Metaphysics 19 (4):808-808.
2. First-Order Logic.Jonathan E. Adler - 2000 - Journal of Philosophy 97 (10):577-580.
3. Classical Logic, Intuitionistic Logic, and the Peirce Rule.Henry Africk - 1992 - 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.
4. 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.
5. A Predicate Logic Based on Indefinite Description and Two Notions of Identity.Robert A. Alps & Robert C. Neveln - 1981 - Notre Dame Journal of Formal Logic 22 (3):251-263.
6. Fundamentals of Symbolic Logic.Alice Ambrose - 1948 - New York: Holt, Rinehart and Winston.
7. First Order Logic with Empty Structures.Mohamed A. Amer - 1989 - 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.
8. Establishing Connections Between Aristotle's Natural Deduction and First-Order Logic.Edgar Jose Andrade & Edward Samuel Becerra - 2008 - 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 (...)
9. Truth-Functional Conditionals and Modern Vs. Traditional Syllogistic.R. B. Angell - 1986 - Mind 95 (378):210-223.
10. A Translation of Intuitionistic Predicate Logic Into Basic Predicate Logic.Mohammad Ardeshir - 1999 - 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.
11. What Does '&' Mean?Axel Arturo Barceló Aspeitia - 2007 - 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 (...)
12. 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.
13. The Epsilon Calculus.Jeremy Avigad & Richard Zach - 2008 - 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..
14. First-Order Logic Based on Inclusion and Abstraction.John Bacon - 1982 - Journal of Symbolic Logic 47 (4):793-808.
15. Elementary Symbolic Logic.John Bacon - 1975 - Teaching Philosophy 1 (2):220-221.
16. Classical Logical Relations.A. J. Baker - 1977 - Notre Dame Journal of Formal Logic 18 (1):164-168.
17. Forms of Thought, by E. J. Lowe.Brian Ball - 2014 - Mind 123 (492):1205-1208.
18. Relevance Logic, Classical Logic, and Disjunctive Syllogism.John A. Barker - 1975 - Philosophical Studies 27 (6):361 - 376.
19. Material Implication and General Indicative Conditionals.Stephen Barker - 1997 - 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 (...)
20. A Technique for Determing Closure in Semantic Tableaux.Steven James Bartlett - 1983 - Methodology and Science: Interdisciplinary Journal for the Empirical Study of the Foundations of Science and Their Methodology 16 (1):1-16.
The author considers the model-theoretic character of proofs and disproofs by means of attempted counterexample constructions, distinguishes this proof format from formal derivations, then contrasts two approaches to semantic tableaux proposed by Beth and Lambert-van Fraassen. It is noted that Beth's original approach has not as yet been provided with a precisely formulated rule of closure for detecting tableau sequences terminating in contradiction. To remedy this deficiency, a technique is proposed to clarify tableau operations.
21. Adequate Formalization.Michael Baumgartner & Timm Lampert - 2008 - 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.
22. Peirce's Development of Quantifiers and of Predicate Logic.Richard Beatty - 1969 - Notre Dame Journal of Formal Logic 10 (1):64-76.
23. Fallacies in Predicate Logic?David Bell - 1971 - Mind 80 (317):145-147.
24. Symbolic Logic (a Reply).Alfred W. Benn - 1907 - Mind 16 (63):470-473.
25. Schönfinkel-Type Operators for Classical Logic.Katalin Bimbó - 2010 - 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 (...)
26. Combinatory Logic.Katalin Bimbó - 2009 - Stanford Encyclopedia of Philosophy.
27. Subject-Predicate Calculus Free From Existential Import.V. A. Bocharov - 1983 - 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 =.
28. Symbolic Logic.Ivan Boh - 1962 - Modern Schoolman 39 (3):277-281.
29. Systems of the Propositional and of the Functional Calculus Based on One Primitive Term.Ludwik Borkowski - 1957 - Studia Logica 6 (1):7 - 55.
30. Cut Elimination Inside a Deep Inference System for Classical Predicate Logic.Kai Brünnler - 2006 - 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 (...)
31. An Elementary Definability Theorem for First Order Logic.C. Butz & I. Moerdijk - 1999 - Journal of Symbolic Logic 64 (3):1028-1036.
32. Peirce's First-Order Logic of 1885.John Byrnes - 1998 - Transactions of the Charles S. Peirce Society 34 (4):949 - 976.
33. Lewis Carroll's Symbolic Logic.F. K. C. - 1978 - Review of Metaphysics 31 (3):472-473.
34. Book Review:Symbolic Logic C. I. Lewis, C. H. Langford. [REVIEW]W. C. C. - 1952 - Philosophy of Science 19 (2):180-.
35. A Framework for the Transfer of Proofs, Lemmas and Strategies From Classical to Non Classical Logics.Ricardo Caferra, Stéphane Demri & Michel Herment - 1993 - 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 (...)
36. Reference variables and the empty universe.H. G. Callaway - 1979 - Logique Et Analyse 22 (85):85.
In this early paper I set out an argument in favor of the standard semantics of first-order logic, to the effect that (Vx)(Ey)x=y. Though my arguments from the paper have since been revised in details, The conclusion of the paper seems still viable and acceptable.
37. Introduction to Symbolic Logic.James D. Carney - 1970 - Englewood Cliffs, N.J., Prentice-Hall.
38. First-Order Logic: An Introduction.Leigh S. Cauman - 1998 - 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, ...
39. Introduction to Symbolic Logic.Anthony Pike Cavendish - 1953 - University Tutorial Press.
40. Complexity, Decidability and Completeness.Douglas Cenzer & Jeffrey B. Remmel - 2006 - 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 (...)
41. Symbolic Logic and Mechanical Theorem Proving.Chin-Liang Chang - 1973 - 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.
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.
(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.
43. Deductive Logic.D. S. Clarke - 1973 - 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 (...)
44. Elements of Symbolic Logic.Brian Coffey - 1948 - Modern Schoolman 25 (3):198-202.
45. An Alternative Approach for Quasi-Truth.Marcelo E. Coniglio & Luiz H. Da Cruz Silvestrini - 2013 - 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 (...)
46. Symbolic Logic.Irving M. Copi - 1954 - New York: Macmillan.
47. Aristotle's Many-Sorted Logic.J. Corcoran - 2008 - Bulletin of Symbolic Logic 14:155-156.
As noted in 1962 by Timothy Smiley, if Aristotle’s logic is faithfully translated into modern symbolic logic, the fit is exact. If categorical sentences are translated into many-sorted logic MSL according to Smiley’s method or the two other methods presented here, an argument with arbitrarily many premises is valid according to Aristotle’s system if and only if its translation is valid according to modern standard many-sorted logic. As William Parry observed in 1973, this result can be proved using my 1972 (...)
48. “Truth-Preserving and Consequence-Preserving Deduction Rules”,.John Corcoran - 2014 - Bulletin of Symbolic Logic 20: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 (...)
49. Complete Enumerative Inductions.John Corcoran - 2006 - Bulletin of Symbolic Logic 12:465-6.
Consider the following. The first is a one-premise argument; the second has two premises. The question sign marks the conclusions as such. -/- Matthew, Mark, Luke, and John wrote Greek. ? Every evangelist wrote Greek. -/- Matthew, Mark, Luke, and John wrote Greek. Every evangelist is Matthew, Mark, Luke, or John. ? Every evangelist wrote Greek. -/- The above pair of premise-conclusion arguments is of a sort familiar to logicians and philosophers of science. In each case the first premise is (...)
 1 — 50 / 184