A nonstandard proof for Szpilrajn's theorem
Abdelmadjid Boudaoud (LMPA)

TL;DR
This paper provides a more constructive proof of Szpilrajn's theorem within the IST framework and explores additional related results using the same tools.
Contribution
It introduces a new constructive proof of Szpilrajn's theorem in the IST theory context, expanding the theorem's applications.
Findings
Constructive proof of Szpilrajn's theorem within IST
Extension of partial orders to total orders using new methods
Additional related results derived from the proof tools
Abstract
Recall that Szpilrajn (1930) ([4], [5]) states that on a given set, any partial order can be extended to a total order on the same set. In this work we give, in the context of the IST theory ([2],[3],[6]), a more constructive proof for this theorem. In addition, we benefit of the tools used to give some other results.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsMathematical and Theoretical Analysis · Computability, Logic, AI Algorithms · Advanced Topology and Set Theory
