Serial relation

In set theory a serial relation is a homogeneous relation expressing the connection of an element of a sequence to the following element. The successor function used by Peano to define natural numbers is the prototype for a serial relation.

Bertrand Russell used serial relations in The Principles of Mathematics[1] (1903) as he explored the foundations of order theory and its applications. The term serial relation was also used by B. A. Bernstein for an article showing that particular common axioms in order theory are nearly incompatible: connectedness, irreflexivity, and transitivity.[2]

A serial relation R is an endorelation on a set U. As stated by Russell, where the universal and existential quantifiers refer to U. In contemporary language of relations, this property defines a total relation. But a total relation may be heterogeneous. Serial relations are of historic interest.

For a relation R, let {y: xRy} denote the "successor neighborhood" of x. A serial relation can be equivalently characterized as a relation for which every element has a non-empty successor neighborhood. Similarly, an inverse serial relation is a relation in which every element has non-empty "predecessor neighborhood".[3]

In normal modal logic, the extension of fundamental axiom set K by the serial property results in axiom set D.[4]

  1. ^ Russell, Bertrand. Principles of mathematics. ISBN 978-1-136-76573-5. OCLC 1203009858.
  2. ^ B. A. Bernstein (1926) "On the Serial Relations in Boolean Algebras", Bulletin of the American Mathematical Society 32(5): 523,524
  3. ^ Yao, Y. (2004). "Semantics of Fuzzy Sets in Rough Set Theory". Transactions on Rough Sets II. Lecture Notes in Computer Science. Vol. 3135. p. 309. doi:10.1007/978-3-540-27778-1_15. ISBN 978-3-540-23990-1.
  4. ^ James Garson (2013) Modal Logic for Philosophers, chapter 11: Relationships between modal logics, figure 11.1 page 220, Cambridge University Press doi:10.1017/CBO97811393421117.014