<?xml version="1.0"?>
<feed xmlns="http://www.w3.org/2005/Atom" xml:lang="en">
	<id>http://debianws.lexgopc.com/wiki143/index.php?action=history&amp;feed=atom&amp;title=Serial_relation</id>
	<title>Serial relation - Revision history</title>
	<link rel="self" type="application/atom+xml" href="http://debianws.lexgopc.com/wiki143/index.php?action=history&amp;feed=atom&amp;title=Serial_relation"/>
	<link rel="alternate" type="text/html" href="http://debianws.lexgopc.com/wiki143/index.php?title=Serial_relation&amp;action=history"/>
	<updated>2026-10-28T06:25:11Z</updated>
	<subtitle>Revision history for this page on the wiki</subtitle>
	<generator>MediaWiki 1.43.1</generator>
	<entry>
		<id>http://debianws.lexgopc.com/wiki143/index.php?title=Serial_relation&amp;diff=5345263&amp;oldid=prev</id>
		<title>imported&gt;Citation bot: Add: publisher, date. | Use this bot. Report bugs. | Suggested by Abductive | Category:Order theory | #UCB_Category 6/179</title>
		<link rel="alternate" type="text/html" href="http://debianws.lexgopc.com/wiki143/index.php?title=Serial_relation&amp;diff=5345263&amp;oldid=prev"/>
		<updated>2025-05-10T06:38:50Z</updated>

		<summary type="html">&lt;p&gt;Add: publisher, date. | &lt;a href=&quot;/wiki143/index.php?title=En:WP:UCB&amp;amp;action=edit&amp;amp;redlink=1&quot; class=&quot;new&quot; title=&quot;En:WP:UCB (page does not exist)&quot;&gt;Use this bot&lt;/a&gt;. &lt;a href=&quot;/wiki143/index.php?title=En:WP:DBUG&amp;amp;action=edit&amp;amp;redlink=1&quot; class=&quot;new&quot; title=&quot;En:WP:DBUG (page does not exist)&quot;&gt;Report bugs&lt;/a&gt;. | Suggested by Abductive | &lt;a href=&quot;/wiki143/index.php?title=Category:Order_theory&quot; title=&quot;Category:Order theory&quot;&gt;Category:Order theory&lt;/a&gt; | #UCB_Category 6/179&lt;/p&gt;
&lt;p&gt;&lt;b&gt;New page&lt;/b&gt;&lt;/p&gt;&lt;div&gt;In [[set theory]] a &amp;#039;&amp;#039;&amp;#039;serial relation&amp;#039;&amp;#039;&amp;#039; is a [[homogeneous relation]] expressing the connection of an element of a [[sequence]] to the following element. The [[successor function]] used by [[Giuseppe Peano|Peano]] to define [[natural number]]s is the prototype for a serial relation.&lt;br /&gt;
&lt;br /&gt;
[[Bertrand Russell]] used serial relations in &amp;#039;&amp;#039;[[The Principles of Mathematics]]&amp;#039;&amp;#039;&amp;lt;ref name=&amp;quot;:0&amp;quot;&amp;gt;{{Cite book |author=Russell, Bertrand |url=http://worldcat.org/oclc/1203009858 |title=Principles of mathematics |date=25 February 2020 |publisher=Routledge |isbn=978-1-136-76573-5 |oclc=1203009858}}&amp;lt;/ref&amp;gt; (1903) as he explored the foundations of [[order theory]] and its applications. The term &amp;#039;&amp;#039;serial relation&amp;#039;&amp;#039; was also used by [[B. A. Bernstein]] for an article showing that particular common axioms in order theory are nearly incompatible: [[connected relation|connectedness]], irreflexivity, and [[transitive relation|transitivity]].&amp;lt;ref&amp;gt;[[B. A. Bernstein]] (1926) [https://www.ams.org/journals/bull/1926-32-05/S0002-9904-1926-04256-7/S0002-9904-1926-04256-7.pdf &amp;quot;On the Serial Relations in Boolean Algebras&amp;quot;], [[Bulletin of the American Mathematical Society]] 32(5): 523,524&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
A serial relation &amp;#039;&amp;#039;R&amp;#039;&amp;#039; is an [[endorelation]] on a set &amp;#039;&amp;#039;U&amp;#039;&amp;#039;. As stated by Russell, &amp;lt;math&amp;gt;\forall x \exists  y \ xRy ,&amp;lt;/math&amp;gt; where the universal and existential quantifiers refer to &amp;#039;&amp;#039;U&amp;#039;&amp;#039;. In contemporary language of [[relation (mathematics)|relation]]s, this property defines a [[total relation]]. But a total relation may be heterogeneous. Serial relations are of historic interest.&lt;br /&gt;
&lt;br /&gt;
For a relation &amp;#039;&amp;#039;R&amp;#039;&amp;#039;, let {{mset|&amp;#039;&amp;#039;y&amp;#039;&amp;#039;: &amp;#039;&amp;#039;xRy&amp;#039;&amp;#039;}} denote the &amp;quot;successor neighborhood&amp;quot; of &amp;#039;&amp;#039;x&amp;#039;&amp;#039;. A serial relation can be equivalently characterized as a relation for which every element has a non-empty successor neighborhood. Similarly, an &amp;#039;&amp;#039;&amp;#039;inverse serial&amp;#039;&amp;#039;&amp;#039; relation is a relation in which every element has non-empty &amp;quot;predecessor neighborhood&amp;quot;.&amp;lt;ref name=&amp;quot;Yao2005&amp;quot;&amp;gt;{{Cite book | doi = 10.1007/978-3-540-27778-1_15| chapter = Semantics of Fuzzy Sets in Rough Set Theory| title = Transactions on Rough Sets II| volume = 3135| pages = 309| series = [[Lecture Notes in Computer Science]]| year = 2004| last1 = Yao | first1 = Y. | isbn = 978-3-540-23990-1}}&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
In [[normal modal logic]], the extension of fundamental axiom set &amp;#039;&amp;#039;&amp;#039;K&amp;#039;&amp;#039;&amp;#039; by the serial property results in axiom set &amp;#039;&amp;#039;&amp;#039;D&amp;#039;&amp;#039;&amp;#039;.&amp;lt;ref&amp;gt;[[James Garson]] (2013) &amp;#039;&amp;#039;Modal Logic for Philosophers&amp;#039;&amp;#039;, chapter 11: Relationships between modal logics, figure 11.1 page 220, [[Cambridge University Press]] {{doi|10.1017/CBO97811393421117.014}}&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
== Russell&amp;#039;s series ==&lt;br /&gt;
Relations are used to develop series in &amp;#039;&amp;#039;The Principles of Mathematics&amp;#039;&amp;#039;. The  prototype is Peano&amp;#039;s [[successor function]] as a one-one relation on the [[natural number]]s. Russell&amp;#039;s series may be finite or generated by a relation giving [[cyclic order]]. In that case, the [[point-pair separation]] relation is used for description. To define a progression, he requires the generating relation to be a [[connected relation]]. Then [[ordinal number]]s are derived from progressions, the finite ones are finite ordinals.&amp;lt;ref name=&amp;quot;:0&amp;quot; /&amp;gt;{{Rp|location=Chapter 28: Progressions and ordinal numbers}} Distinguishing open and closed series&amp;lt;ref name=&amp;quot;:0&amp;quot; /&amp;gt;{{Rp|page=234}} results in four total orders: finite, one end, no end and open, and no end and closed.&amp;lt;ref name=&amp;quot;:0&amp;quot; /&amp;gt;{{Rp|page=202}}&lt;br /&gt;
&lt;br /&gt;
Contrary to other writers, Russell admits negative ordinals. For motivation, consider the scales of [[measurement]] using [[scientific notation]], where a power of ten represents a [[decade (log scale)|decade]] of measure. Informally, this parameter corresponds to [[orders of magnitude]] used to quantify physical units. The parameter takes on negative as well as positive values.&lt;br /&gt;
&lt;br /&gt;
=== Stretch ===&lt;br /&gt;
Russell adopted the term &amp;#039;&amp;#039;stretch&amp;#039;&amp;#039; from [[Alexius Meinong|Meinong]], who had contributed to the theory of distance.&amp;lt;ref&amp;gt;[[Alexius Meinong]] (1896) &amp;#039;&amp;#039;Uber die Bedeutung der Weberische Gesetze&amp;#039;&amp;#039;&amp;lt;/ref&amp;gt; Stretch refers to the intermediate terms between two points in a series, and the &amp;quot;number of terms measures the distance and divisibility of the  whole.&amp;quot;&amp;lt;ref name=&amp;quot;:0&amp;quot; /&amp;gt;{{Rp|page=181}} To explain Meinong, Russell refers to the [[Cayley–Klein metric]], which uses stretch coordinates in [[cross ratio|anharmonic ratios]] which determine distance by  using logarithm.&amp;lt;ref name=&amp;quot;:0&amp;quot; /&amp;gt;{{rp|page=255}}&amp;lt;ref&amp;gt;Russell (1897) &amp;#039;&amp;#039;An Essay on the Foundations of Geometry&amp;#039;&amp;#039;&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
== References ==&lt;br /&gt;
{{Reflist}}&lt;br /&gt;
&lt;br /&gt;
== External links ==&lt;br /&gt;
* {{cite book | chapter-url=https://books.google.com/books?id=gLS4CQAAQBAJ&amp;amp;pg=PA416 | author=Jing Tao Yao and Davide Ciucci and Yan Zhang | contribution=Generalized Rough Sets | pages=413–424 | isbn=9783662435052 | editor=Janusz Kacprzyk and Witold Pedrycz | title=Handbook of Computational Intelligence | publisher=Springer | year=2015 }} Here: page 416.&lt;br /&gt;
* {{cite journal|last = Yao|first = Y.Y.|author2=Wong, S.K.M.|title = Generalization of rough sets using relationships between attribute values|journal = Proceedings of the 2nd Annual Joint Conference on Information Sciences|year = 1995|pages = 30–33|url = http://www2.cs.uregina.ca/~yyao/PAPERS/relation.pdf}}.&lt;br /&gt;
&lt;br /&gt;
[[Category:Properties of binary relations]]&lt;br /&gt;
[[Category:Order theory]]&lt;/div&gt;</summary>
		<author><name>imported&gt;Citation bot</name></author>
	</entry>
</feed>