A binary predicate is a two-place relation in Formal Logic I, written with two arguments such as P(x, y). It says something about how one object stands in relation to another, like loves, taller than, or between.
A binary predicate in Formal Logic I is a predicate that takes two arguments and states a relation between them. If you see something like P(x, y), the symbol P stands for a relation, and x and y are the two things being related.
That is the big difference from a unary predicate, which talks about just one thing. A unary predicate might say someone is tall or a book is red. A binary predicate says something about the pair, such as x is taller than y, x loves y, or x is next to y.
This matters because formal logic is not just about labeling objects, it is about showing structure. Binary predicates let you break a sentence into its relational parts so you can see who or what is connected to whom. In symbolic logic, that kind of structure is what makes translation from ordinary language possible.
A lot of the time, a binary predicate shows up in sentences that seem simple in everyday language but get tricky once you try to symbolize them. For example, “Alice admires Bob” is not just two separate facts about Alice and Bob. It is one relation between them. If you symbolized it as just A and B, you would lose the meaning that the admiration goes from one person to the other.
You will also run into binary predicates when a course starts combining relations with quantifiers. A sentence like “Everyone respects someone” needs a relation with two slots, because the meaning changes depending on which object fills each slot. That is why binary predicates are one of the basic building blocks for topic 8.4 style symbolization, where order, scope, and argument structure all start to matter.
A helpful way to think about them is this: unary predicates sort things into categories, while binary predicates describe how two things fit together. Once you can spot that difference, you can translate more accurately and avoid flattening a relationship into something too vague.
Binary predicates matter in Formal Logic I because they are one of the first places where symbolization becomes about relationships, not just labels. A lot of ordinary sentences in logic are not simple property claims. They compare, connect, rank, or pair objects, and binary predicates are how you capture that structure cleanly.
This becomes especially useful when you analyze validity. If you misread a relational sentence, you can symbolize it in the wrong way and end up with a bad argument form. For example, “x is larger than y” is not the same structure as “x is large” and “y is large.” The first is relational, the second are separate property claims.
Binary predicates also set up the rest of predicate logic. Once you understand how two-place relations work, quantifiers make more sense, because now you can ask whether the relation holds for all pairs, some pairs, or a specific pair. That is the kind of move that shows up when you compare translations or explain why one sentence has a different meaning from another.
In class, this concept often shows up in symbolization exercises, especially when the sentence includes verbs like loves, owns, beats, is taller than, is next to, or is between. Those are the moments where you have to decide whether the sentence is describing one subject, two subjects, or a full relation between them.
Keep studying Formal Logic I Unit 8
Visual cheatsheet
view galleryunary predicate
A unary predicate describes one subject at a time, so it is the best comparison for seeing what makes a binary predicate different. If you can tell whether a sentence is about a property of one thing or a relation between two things, your symbolization gets much cleaner. That distinction shows up constantly in translation problems.
relation
A binary predicate is a formal way of writing a relation. In logic, relations can be spatial, social, comparative, or mathematical, and the predicate symbol keeps the structure explicit. Thinking in terms of relations helps you avoid treating a sentence like “x is taller than y” as if it were just two unrelated descriptions.
quantifier
Quantifiers often wrap around binary predicates, especially when a sentence talks about everyone, someone, or no one in relation to someone else. The order of the quantifiers changes the meaning, so you need the predicate structure first before you can get the scope right. That is where many symbolization errors start.
multiple predicates
Some sentences combine more than one predicate, and one of them may be binary while another is unary. That mix is common in longer translations, because a sentence can say what something is like and how it relates to something else. Being able to separate the predicates keeps the sentence from turning into a messy symbol string.
A quiz or problem-set question will usually give you an English sentence and ask you to identify whether the core predicate is unary or binary, then symbolize it correctly. The move you are making is not just naming the relation, but matching the number of arguments to the sentence structure.
For example, if the sentence says, “Mia trusts Leo,” you need a two-place predicate, not two one-place claims. If the sentence says, “Mia is trustworthy,” that is unary. When you explain your answer, it helps to point out which words create the relation, since verbs and comparison phrases often signal a binary predicate.
Later questions may combine the predicate with quantifiers, so you may need to say whether the sentence means “for every x there is some y such that...,” or the reverse. That is where binary predicates stop being a vocabulary term and become part of the logic you are evaluating.
These are easy to mix up because both are predicates, but they do different jobs. A unary predicate says something about one object, while a binary predicate says something about the relation between two objects. If a sentence can be translated without comparing or linking two things, it is probably unary. If the meaning depends on how two terms connect, it is binary.
A binary predicate is a two-place relation, written with two arguments like P(x, y).
It does not just label objects, it shows how one object stands in relation to another.
Sentences with verbs or comparisons like loves, owns, taller than, or next to often use binary predicates.
Binary predicates are a core part of symbolizing complex sentences in Formal Logic I.
If you confuse a relation with two separate properties, you can change the meaning of the argument.
A binary predicate in Formal Logic I is a predicate that takes two arguments and expresses a relation between them. It is usually written in the form P(x, y). You use it when the sentence is about how one thing relates to another, not just about one thing by itself.
A unary predicate has one argument and describes a property of one object, like being tall or being red. A binary predicate has two arguments and describes a relation between two objects, like being taller than, loving, or being next to. The difference changes how you symbolize the sentence.
Yes. “Alice admires Bob” can be symbolized with a binary predicate because admiration connects two people. Another example is “x is taller than y,” which clearly depends on both x and y. In each case, the relation disappears if you remove one of the terms.
Because the structure tells you how many places the predicate needs and how the sentence should be read. If you turn a relation into two unrelated facts, you lose the meaning of the original claim. That mistake can also affect quantifier scope when a sentence includes words like every or some.