Definability lattice for addition of rationals
A.L. Semenov, S.F. Soprunov

TL;DR
This paper explores the structure of all possible reducts of the rational numbers with addition, analyzing their relationships within a lattice framework to understand their definability properties.
Contribution
It introduces a detailed lattice structure for the reducts of (Q, +), providing new insights into their definability and classification.
Findings
Identifies the lattice of reducts of (Q, +)
Classifies the definability relations among reducts
Provides a comprehensive structure for understanding reducts of rational addition
Abstract
In the present paper we discuss the lattice of reducts of +
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
TopicsLogic, programming, and type systems · Formal Methods in Verification
