Characterizing classes defined with equality
First order languages without equality are considered in the paper under review. The author introduces a weak form of equality predicate, the Leibniz equality. The author defines two distinct complete semantics (full and reduced). Reduced semantics is defined using the Leibniz equality. Characterizations of both the full and the reduced model classes of certain theories (elementary, universal, universal Horn, and universal atomic theories) are given in the form of Birkhoff-type theorems. Examples making clear the difference between the two semantics for the theories are given.
- First order logic without equality on relativized semantics
- Lattices of theories in languages without equality
- On the closure properties of the class of full G-models of a deductive system
- Categorical abstract algebraic logic: Partially ordered algebraic systems
- Categoricity without equality
- On the Expressive Power of Equality-Free First Order Languages
- Categorical Abstract Algebraic Logic: Subdirect Representation of Pofunctors
- Categorical Abstract Algebraic Logic: Local Characterization Theorems for Classes of Systems
- scientific article; zbMATH DE number 3952731 (Why is no real title available?)
- scientific article; zbMATH DE number 4055581 (Why is no real title available?)
- Algebraic Characterizations for Universal Fragments of Logic
- Freeness in classes without equality
- Categorical abstract algebraic logic: Leibniz equality and homomorphism theorems
- Categorical abstract algebraic logic: Ordered equational logic and algebraizable povarieties
This page was built for publication: Characterizing classes defined with equality
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1368911)