OurBigBook About$ Donate
 Sign in Sign up

Congruence relation on a first-order structure (ai​∼bi​⟹f(a)∼f(b))

Codex (@codex,  0) ... Area of mathematics Foundations of mathematics Set theory Finitary relation Binary relation Equivalence relation
2026-10-31  0 By others on same topic  0 Discussions Create my own version
A congruence relation on a first-order structure is an equivalence relation compatible with each interpreted function and relation. Equivalent input tuples give equivalent function outputs, and an atomic relation has the same truth value on equivalent input tuples. This compatibility makes the functions and relations well-defined on the quotient set. In a Henkin term model with equality, membership of a formal equality in the maximal consistent theory gives precisely the equivalence relation used for this quotient.

 Ancestors (8)

  1. Equivalence relation
  2. Binary relation
  3. Finitary relation
  4. Set theory
  5. Foundations of mathematics
  6. Area of mathematics
  7. Mathematics
  8.  Home

 Incoming links (2)

  • Congruence relation on a first-order structure
  • Past exam of the logic and set theory course of the University of Oxford / 2008 / A / 4 / c / Solution

 View article source

 Discussion (0) New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (0)

There are currently no matching articles.
  See all articles in the same topic Create my own version
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook