Leibnizian, Robinsonian, and Boolean Valued Monads
S. S. Kutateladze
TL;DR
This paper reviews modern monadology concepts, focusing on Leibnizian, Robinsonian, and Boolean valued monads, and explores their applications in vector lattices and linear inequalities.
Contribution
It provides an overview of current monadology approaches and highlights their applications in vector lattices and linear inequalities.
Findings
Connections between monadology and vector lattices
Applications to linear inequalities
Comparison of Leibnizian, Robinsonian, and Boolean valued monads
Abstract
This is an overview of the present-day versions of monadology with some applications to vector lattices and linear inequalities.
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.