AI Tutor
Library
›Library›Logic›forall x: Calgary›First-order logic›Sentences of FOL
Back to forall x: Calgary

Sentences of FOL

Distinguishing bound from free variable occurrences to decide which formulas qualify as sentences of FOL.

forall x: Calgary, Sentences of FOL

Status
FlagsLoading your progress…

1 exercise

Exercise A

Identify which variables are bound and which are free.

  1. ∃x L(x‾,y‾)∧∀y L(y‾,x‾)\exists x\,L(\underline{x},\overline{y})\wedge\forall y\,L(\underline{y},\overline{x})

  2. ∀x A(x‾)∧B(x‾)\forall x\,A(\underline{x})\wedge B(\overline{x})

  3. ∀x(A(x‾)∧B(x‾))∧∀y(C(x‾)∧D(y‾))\forall x(A(\underline{x})\wedge B(\underline{x}))\wedge\forall y(C(\overline{x})\wedge D(\underline{y}))

  4. ∀x∃y[R(x‾,y‾)→(J(z‾)∧K(x‾))]∨R(y‾,x‾)\forall x\exists y[R(\underline{x},\underline{y})\rightarrow(J(\overline{z})\wedge K(\underline{x}))]\vee R(\overline{y},\overline{x})

  5. ∀x1(M(x2‾)↔L(x2‾,x1‾))∧∃x2 L(x3‾,x2‾)\forall x_{1}(M(\overline{x_{2}})\leftrightarrow L(\overline{x_{2}},\underline{x_{1}}))\wedge\exists x_{2}\,L(\overline{x_{3}},\underline{x_{2}})

3.0
IdentityDefinite descriptions

Adapted from forall x: Calgary © 2025 P. D. Magnus, Tim Button, Robert Trueman, and Richard Zach. Licensed under CC BY 4.0. Source: forall x: Calgary. Imported at revision ec34df8.

AI Tutor

A study tool built on open educational resources. Content from OpenStax and other openly licensed textbooks — every book, section and exercise page carries its source’s license and attribution.

Product
  • About AI Tutor
  • Library
  • Premium
Legal
  • Terms of Service
  • Privacy Policy
© 2026 AI Tutor. Openly licensed content is attributed to its authors under their respective licenses.