Coursify

First-Order Predicate Logic (FOPL): Meaning, Syntax, and Translating a Knowledge-Representation Story

First-Order Predicate Logic (FOPL): Meaning, Syntax, and Translating a Knowledge-Representation Story

Verified Sources
Nov 4, 2026

First-Order Predicate Logic (FOPL), also called first-order logic (FOL), is a formal language used to represent statements about objects (via constants and variables) and properties/relations (via predicates). It extends propositional logic by adding quantifiers (“for all” ∀\forall and “there exists” ∃\exists) to express generality over objects. Key semantic questions are answered using interpretations (also called models) that assign meanings to symbols so we can determine whether a formula is true in a structure. 2

Below is the core idea and then a careful translation of your facts into FOPL using standard quantifier patterns and implication chains.

Mermaid view of how FOL builds statements:

Footnotes

  1. First-order logic (FOL) overview — https://en.wikipedia.org/wiki/First-order_logic - Defines syntax and semantics context for FOL. ↩

  2. First-order logic syntax and quantifiers — https://en.wikipedia.org/wiki/First-order_logic#Syntax - Discusses predicates, variables, constants, functions, and quantifiers. ↩

First-Order Logic (FOL) - Introduction to Syntax and Semantics

Core components of FOPL

  • keyword predicates represent properties/relations (e.g., Happy(x)\textsf{Happy}(x)).
  • keyword universal quantifier ∀x\forall x expresses “for all xx”.
  • keyword existential quantifier ∃x\exists x expresses “there exists xx”.
  • keyword interpretation/model tells which formulas are true.

Syntactically, FOL uses terms (variables/constants; possibly function terms) to build atomic formulas like P(t1,…,tn)P(t_1,\dots,t_n), then combines them with logical connectives and quantifiers to form well-formed formulas.

Footnotes

  1. First-order logic syntax and quantifiers — https://en.wikipedia.org/wiki/First-order_logic#Syntax - Discusses predicates, variables, constants, functions, and quantifiers. ↩

Translating the story into FOPL

We translate each English sentence into a precise formula using a consistent vocabulary.

Step 1: Choose a domain and predicate symbols

Assume the domain is people.

Introduce predicates:

  • keyword PassAI(x)\textsf{PassAI}(x)
  • keyword Happy(x)\textsf{Happy}(x)
  • keyword SincereStudy(x)\textsf{SincereStudy}(x)
  • keyword Lucky(x)\textsf{Lucky}(x)
  • keyword PassAllExams(x)\textsf{PassAllExams}(x)
  • keyword LiveProject(x)\textsf{LiveProject}(x)

Also use a constant:

  • keyword rr (meaning Ramu)

Facts like “Anyone …” typically correspond to universal quantification over all people.

FOPL encoding of the given facts

  1. 1
    Step 1

    “Anyone passing his AI paper and getting an opportunity to work on live project is Happy.” Encode as: ∀x ((PassAI(x)∧LiveProject(x))→Happy(x)).\forall x\,\big((\textsf{PassAI}(x) \wedge \textsf{LiveProject}(x)) \to \textsf{Happy}(x)\big).

  2. 2
    Step 2

    “But anyone who studies sincerely or is Lucky can pass all his exams.” Encode as: ∀x ((SincereStudy(x)∨Lucky(x))→PassAllExams(x)).\forall x\,\big((\textsf{SincereStudy}(x) \vee \textsf{Lucky}(x)) \to \textsf{PassAllExams}(x)\big).

  3. 3
    Step 3

    Interpret “Ramu did not study” as “Ramu is not a sincere student,” then add luck:  egSincereStudy(r)∧Lucky(r).\ eg \textsf{SincereStudy}(r) \wedge \textsf{Lucky}(r).

  4. 4
    Step 4

    “Anyone who is Lucky gets a live project to work.” Encode as: ∀x (Lucky(x)→LiveProject(x)).\forall x\,\big(\textsf{Lucky}(x) \to \textsf{LiveProject}(x)\big).

Final FOPL knowledge base (conjunction of all formulas)

Let rr be the constant for Ramu. The English story corresponds to the following set of FOL sentences:

  1. ∀x,big((textsfPassAI(x)wedgetextsfLiveProject(x))totextsfHappy(x)big).\forall x\\,\\big((\\textsf{PassAI}(x) \\wedge \\textsf{LiveProject}(x)) \\to \\textsf{Happy}(x)\\big).
  2. ∀x,big((textsfSincereStudy(x)veetextsfLucky(x))totextsfPassAllExams(x)big).\forall x\\,\\big((\\textsf{SincereStudy}(x) \\vee \\textsf{Lucky}(x)) \\to \\textsf{PassAllExams}(x)\\big).
  3. negtextsfSincereStudy(r)wedgetextsfLucky(r).\\neg \\textsf{SincereStudy}(r) \\wedge \\textsf{Lucky}(r).
  4. ∀x,big(textsfLucky(x)totextsfLiveProject(x)big).\forall x\\,\\big(\\textsf{Lucky}(x) \\to \\textsf{LiveProject}(x)\\big).

So the overall knowledge base is: KB=(1)wedge(2)wedge(3)wedge(4).KB = (1) \\wedge (2) \\wedge (3) \\wedge (4).

A compact Mermaid flow of the logical consequences:

Note: From (2) and (4) and textsfLucky(r)\\textsf{Lucky}(r), we can infer textsfPassAllExams(r)\\textsf{PassAllExams}(r). From (4) we also infer textsfLiveProject(r)\\textsf{LiveProject}(r). But we cannot infer textsfHappy(r)\\textsf{Happy}(r) unless we also have textsfPassAI(r)\\textsf{PassAI}(r) (or an additional rule that gives it). This is a typical reasoning pattern in FOL.

Footnotes

  1. Interpretation/model and satisfaction in first-order logic — https://en.wikipedia.org/wiki/First-order_logic#Semantics - Explains models/interpretations used to determine truth of formulas. ↩

Tip: how to translate “anyone”

In FOL, “anyone who …” almost always becomes ∀x (condition(x)→consequence(x))\forall x\,(\text{condition}(x) \to \text{consequence}(x)). "Anyone who is Lucky ..." becomes ∀x (Lucky(x)→… ).\forall x\,(\textsf{Lucky}(x) \to \dots).

Warning: translating “did not study”

English “Ramu did not study” is ambiguous: it might mean “did not study sincerely” or “did not study at all.” The translation above uses  egSincereStudy(r)\ eg \textsf{SincereStudy}(r) to match your later rule about “studies sincerely.” If your course treats it differently, adjust the predicate and re-encode.

From English to FOPL (translation workflow)

People vs events

1. Identify domain

Choose the objects quantified over (here: people)."

Map English verbs/adjectives to predicates

2. Pick predicates

Create symbols like Lucky(x), Happy(x), LiveProject(x)."

“Anyone” → ∀

3. Convert quantifiers

Turn universal statements into implications under ∀."

Ramu → constant r

4. Handle negation & constants

Translate specific facts like “Ramu …” as sentences with constant r."

Mapping of English clauses to FOL forms

Each row shows the quantifier pattern used for that sentence.

Common edge cases in FOPL translation

Knowledge Check

Question 1 of 4
Q1Single choice

Which FOL pattern best matches the sentence “Anyone who is Lucky gets a live project to work.”?

Explore Related Topics

1

FIRST, FOLLOW, and LL(1) Parsing Table for the Given Expression Grammar

2

Programmable Logic Controller (PLC): Definition and Working

3

Partial-Order Planning (POP): Planning Without a Strict Linear Action Order

Browse all research articles