|
|
|
|
polyadic algebra with equality
|
(Definition)
|
|
|
Let
be a polyadic algebra. An equality predicate on is a function
such that
-
for any and any 
for every , and
-
, where , and denotes the function that maps to , and constant everywhere else.
Heuristically, we can interpret the conditions above as follows:
- if
and if we replace by, say , and by , then .
for every variable 
- if we have a propositional function
that is true, and , then the proposition obtained from by replacing all occurrences of by is also true.
The second condition is also known as the reflexive property of the equality predicate , and the third is known as the substitutive property of
A polyadic algebra with equality is a pair where is a polyadic algebra and is an equality predicate on . Paul Halmos introduced this concept and called this simply an equality algebra.
Below are some basic properties of the equality predicate in an equality algebra :
- (symmetric property)

- (transitive property)

-
, where in the is the transposition on that swaps and and leaves everything else fixed.
- if a variable
is not in the support of , then
.
-
for all and all whenever .
-
for all
where
.
Remarks
- The degree and local finiteness of a polyadic algebra
are defined as the degree and the local finiteness and degree of its underlying polyadic algebra .
- It can be shown that every locally finite polyadic algebra of infinite degree can be embedded (as a polyadic subalgebra) in a locally finite polyadic algebra with equality of infinite degree.
- Like cylindric algebras, polyadic algebras with equality is an attempt at “converting” a first order logic (with equality) into algebraic form, so that the logic can be studied using algebraic means.
- 1
- P. Halmos, Algebraic Logic, Chelsea Publishing Co. New York (1962).
- 2
- B. Plotkin, Universal Algebra, Algebraic Logic, and Databases, Kluwer Academic Publishers (1994).
|
"polyadic algebra with equality" is owned by CWoo.
|
|
(view preamble | get metadata)
See Also: cylindric algebra
| Other names: |
equality algebra |
| Also defines: |
equality predicate, substitutive, reflexive, symmetric, transitive |
This object's parent.
|
|
Cross-references: logic, algebraic, first order logic, equality, cylindric algebras, subalgebra, polyadic, infinite, locally finite, degree, support, fixed, transposition, Reflexive, occurrences, proposition, propositional function, variable, function, polyadic algebra
There are 25 references to this entry.
This is version 7 of polyadic algebra with equality, born on 2008-02-26, modified 2008-03-18.
Object id is 10337, canonical name is PolyadicAlgebraWithEquality.
Accessed 1557 times total.
Classification:
| AMS MSC: | 03G15 (Mathematical logic and foundations :: Algebraic logic :: Cylindric and polyadic algebras; relation algebras) |
|
|
|
|
|
|
Pending Errata and Addenda
|
|
|
|
|
|
|
|
|
|
|