• Let and model in , and a function

    • We say that preserves the relations if for every -ary predicate symbol in , and for all elements of the domain, we have:
    • We say that reflects the relations if for every -ary predicate symbol in , and for all elements of the domain, we have:
    • is a homomorphism of into if:
      • ( preserves constants) For every term in , we have
        • (todo in other book this goes on constants only)
      • ( preserves functions) For every -ary function symbol and for all elements of the domain we have:
      •  preserves relations
    •  is a strong homomorphism if:
      •  is a homomorphism
      •  reflects relations
    •  is an embedding if:
      •  is a homomorphism
      •  is injective (one-to-one)
      •  reflects relations
    •  is an isomorphism if:
      •  is a homomorphism
      •  is injective (one-to-one)
      • is surjective (onto)
      •  reflects relations
    • and are isomorphic if an isomorphism exists between them
    • is called an epimorphism if:
      •  is a homomorphism
      • is surjective (onto)
      •  reflects relations (possibly excluding the equality relation)
    • is called an automorphism if:
      •  is an isomorphism
    • is called an endomorphism if:
      •  is a homomorphism
    • is called a monomorphism if:
      •  is a homomorphism
      •  is injective (one-to-one)
  • The model is a (strong) homomorphic image of the model if there exists a (strong) homomorphism from onto

  • If is an epimorphism that reflects also the equality relation, then is calledtodo

In algebra, when dealing with groups, rings, and linear spaces, the focus is on functions (operations) and not on relations, therefore the condition reflects relations is not relevant, therefore, for example, a surjective homomorphism is an epimorphism

If one of the relation in is the equality relation, (and it is the real equality in and ), then by the property ” reflects relations” we have that is injective. Therefore, in this case, an epimorphism is an isomorphism.

  • (6.7) (assume with equality) Let be an isomorphism, and a formula (i.e. a formula with free variables ), and let elements of the domain of . Then

draft

https://people.math.sc.edu/mcnulty/762/modeltheory.pdf

Congruence Relation

  • A binary relation on a model in is called a congruence (relation) on if

    • is an equivalence relation
    • if is n-ary function in , and , then
    • if is n-ary relation in , and , then
  • Let be a model in .

    • We define a model as follow:
      • is the quotient set of induced by
      • The function , is called (ההתאמה הטבעית)
      • For every constant in , we define
      • Let be n-ary function symbol in , and the equivalence classes in , we choose where , and we define to be the equivalence class in which is contained. (i.e. )
      • For every n-ary relation in , we define the relation in as follow:
    • Then is well-defined (i.e. the definition of does not depend on the choice of the representatives of the equivalence classes), and called the quotient structure defined by and denote by , and is epimorphism
  • (6.21) let be an epimorphism, and be a binary realtion in where , then is congruence relation, and the quotient structure and are isomorphic