- Also called:
- Logic Of Quantifiers
Predicate calculus
-
What is predicate calculus in logic?
Predicate calculus is a branch of symbolic logic that uses symbols for quantifiers, such as "all" and "some," along with arguments and predicates of propositions. It systematically examines the logical relationships between sentences based on how predicates are distributed through subjects, distinguishing itself from propositional calculus, which deals with unanalyzed propositions connected by logical connectives. The predicate calculus often builds upon propositional calculus and classifies sentences based on predicate distribution, identifying tautologous, inconsistent, and contingent sentences. Quantification, a key aspect of predicate calculus, involves attaching signs of quantity to propositions to express universality or existence.
3 Britannica SourcesCreated from Britannica articles using AI. AI can make mistakes, so verify using Britannica articles. -
How is predicate calculus different from propositional logic?
Predicate calculus differs from propositional logic by using symbols for quantifiers and predicates, in addition to propositions and logical connectives. Propositional calculus, on the other hand, treats simple, unanalyzed propositions as its basic units and does not include variables. While propositional calculus focuses on the logical relationships between whole propositions, predicate calculus delves into the internal structure of propositions, analyzing how predicates are distributed among subjects. The predicate calculus typically builds upon the propositional calculus.
3 Britannica SourcesCreated from Britannica articles using AI. AI can make mistakes, so verify using Britannica articles. -
What are predicates and variables in predicate calculus?
In predicate calculus, predicates are symbols that represent properties or relations. They are combined with arguments (subjects) to form propositions, such as "Wd" meaning "This dish is warm". Variables, often represented by letters like 'x', are used when the subject is indefinite, creating a propositional function like "x is warm". These variables can be quantified using symbols like '∀' (for all) or '∃' (there exists) to form general or particular propositions. A predicate variable is a variable to which a predicate can be substituted. Predicate calculus is a branch of symbolic logic that uses these symbols to analyze logical relationships between sentences based on how predicates are distributed by quantifiers.
4 Britannica SourcesCreated from Britannica articles using AI. AI can make mistakes, so verify using Britannica articles. -
What are quantifiers and how are they used in predicate calculus?
In predicate calculus, quantifiers are symbols that attach to variables to specify the quantity of objects to which a predicate applies. The two primary quantifiers are:
- Universal Quantifier (symbolized as \u2200 or (x)): This asserts that a formula holds true for all values of a variable. For example, (\u2200x)\u03d5x means "For all x, x has property \u03d5."
- Existential Quantifier (symbolized as \u2203): This asserts that a formula holds true for at least one value of a variable. For example, (\u2203x)\u03d5x means "For some x, x has property \u03d5."
These quantifiers are crucial for building complex statements and expressing relationships beyond simple propositions, forming the foundation of predicate logic.
4 Britannica SourcesCreated from Britannica articles using AI. AI can make mistakes, so verify using Britannica articles. -
How can you write simple statements using predicate calculus symbols?
In predicate calculus, simple statements are constructed using symbols to represent individuals, properties, and relationships. An individual is represented by a variable (like x or y), and a property or characteristic is represented by a predicate (like \u03d5 or \u03c8) followed by the individual variable, forming an atomic formula such as \u03d5x. For example, if \u03d5 represents "is wise" and x represents "Socrates," then \u03d5x signifies "Socrates is wise".
Relationships between individuals are shown with predicates that have multiple arguments, like \u03d5xy for a two-place predicate. Quantifiers are used to express quantity: the universal quantifier (\u2200) means "for all," and the existential quantifier (\u2203) means "for some" or "there exists at least one". For instance, (\u2200x)\u03d5x means "Everything is \u03d5," and (\u2203x)\u03d5x means "Something is \u03d5". These elements can be combined with logical connectives to form more complex statements.
4 Britannica SourcesCreated from Britannica articles using AI. AI can make mistakes, so verify using Britannica articles. -
How does predicate calculus help solve more complex logical problems than propositional logic?
Predicate calculus extends propositional logic by introducing quantifiers (like "all" and "some") and variables, allowing it to analyze the internal structure of propositions. Propositional logic treats propositions as unanalyzed units, whereas predicate calculus can break them down into predicates and arguments. This enables predicate calculus to represent more complex logical relationships, such as those found in syllogisms, and to handle statements about properties and relations that propositional logic cannot. This greater expressive power allows predicate calculus to solve more complex logical problems.
6 Britannica SourcesCreated from Britannica articles using AI. AI can make mistakes, so verify using Britannica articles.
Predicate calculus, that part of modern formal or symbolic logic which systematically exhibits the logical relations between sentences that hold purely in virtue of the manner in which predicates or noun expressions are distributed through ranges of subjects by means of quantifiers such as “all” and “some” without regard to the meanings or conceptual contents of any predicates in particular. Such predicates can include both qualities and relations; and, in a higher-order form called the functional calculus, it also includes functions, which are “framework” expressions with one or with several variables that acquire definite truth-values only when the variables are replaced by specific terms. The predicate calculus is to be distinguished from the propositional calculus, which deals with unanalyzed whole propositions related by connectives (such as “and,” “if . . . then,” and “or”).
The traditional syllogism is the most well-known sample of predicate logic, though it does not exhaust the subject. In such arguments as “All C are B and no B are A, so no C are A,” the truth of the two premises requires the truth of the conclusion in virtue of the manner in which the predicates B and A are distributed with reference to the classes specified by C and B, respectively. If, for example, the predicate A belonged to only one of the B’s, the conclusion then could possibly be false—some C could be an A.
Modern symbolic logic, of which the predicate calculus is a part, does not restrict itself, however, to the traditional syllogistic forms or to their symbolisms, a very large number of which have been devised. The predicate calculus usually builds upon some form of the propositional calculus. It then proceeds to give a classification of the sentence types that it contains or deals with, by reference to the different manners in which predicates may be distributed within sentences. It distinguishes, for example, the following two types of sentences: “All F’s are either G’s or H’s,” and “Some F’s are both G’s and H’s.” The conditions of truth and falsity in the basic sentence types are determined, and then a cross-classification is made that groups the sentences formulable within the calculus into three mutually exclusive classes—(1) those sentences that are true on every possible specification of the meaning of their predicate signs, as with “Everything is F or is not F”; (2) those false on every such specification, as with “Something is F and not F”; and (3) those true on some specifications and false on others, as with “Something is F and is G.” These are, respectively, the tautologous, inconsistent, and contingent sentences of the predicate calculus. Certain tautologous sentence types may be selected as axioms or as the basis for rules for transforming the symbols of the various sentence types; and rather routine and mechanical procedures may then be laid down for deciding whether given sentences are tautologous, inconsistent, or contingent—or whether and how given sentences are logically related to each other. Such procedures can be devised to decide the logical properties and relations of every sentence in any predicate calculus that does not contain predicates (functions) that range over predicates themselves—i.e., in any first-order, or lower, predicate calculus.
" height="20" alt="HEW Logo">
Calculi that do contain predicates ranging freely over predicates, on the other hand—called higher-order calculi—do not permit the classification of all their sentences by such routine procedures. As was proved by Kurt Gödel, a 20th-century Moravian-born American mathematical logician, these calculi, if consistent, always contain well-formed formulas such that neither they nor their negations can be derived (shown tautologous) by the rules of the calculus. Such calculi are, in the precise sense, incomplete. Various restricted forms of the higher-order calculi have been shown, however, to be susceptible to routine decision procedures for all of their formulae. See also propositional calculus.