{"title":"Theories of real addition with and without a predicate for integers","authors":"A. Bès, C. Choffrut","doi":"10.23638/LMCS-17(2:18)2021","DOIUrl":null,"url":null,"abstract":"We show that it is decidable whether or not a relation on the reals definable in the structure $\\langle \\mathbb{R}, +,<, \\mathbb{Z} \\rangle$ can be defined in the structure $\\langle \\mathbb{R}, +,<, 1 \\rangle$. This result is achieved by obtaining a topological characterization of $\\langle \\mathbb{R}, +,<, 1 \\rangle$-definable relations in the family of $\\langle \\mathbb{R}, +,<, \\mathbb{Z} \\rangle$-definable relations and then by following Muchnik's approach of showing that the characterization of the relation $X$ can be expressed in the logic of $\\langle \\mathbb{R}, +,<,1, X \\rangle$. The above characterization allows us to prove that there is no intermediate structure between $\\langle \\mathbb{R}, +,<, \\mathbb{Z} \\rangle$ and $\\langle \\mathbb{R}, +,<, 1 \\rangle$. We also show that a $\\langle \\mathbb{R}, +,<, \\mathbb{Z} \\rangle$-definable relation is $\\langle \\mathbb{R}, +,<, 1 \\rangle$-definable if and only if its intersection with every $\\langle \\mathbb{R}, +,<, 1 \\rangle$-definable line is $\\langle \\mathbb{R}, +,<, 1 \\rangle$-definable. This gives a noneffective but simple characterization of $\\langle \\mathbb{R}, +,<, 1 \\rangle$-definable relations.","PeriodicalId":314387,"journal":{"name":"Log. Methods Comput. Sci.","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-02-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"8","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Log. Methods Comput. Sci.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.23638/LMCS-17(2:18)2021","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 8
Abstract
We show that it is decidable whether or not a relation on the reals definable in the structure $\langle \mathbb{R}, +,<, \mathbb{Z} \rangle$ can be defined in the structure $\langle \mathbb{R}, +,<, 1 \rangle$. This result is achieved by obtaining a topological characterization of $\langle \mathbb{R}, +,<, 1 \rangle$-definable relations in the family of $\langle \mathbb{R}, +,<, \mathbb{Z} \rangle$-definable relations and then by following Muchnik's approach of showing that the characterization of the relation $X$ can be expressed in the logic of $\langle \mathbb{R}, +,<,1, X \rangle$. The above characterization allows us to prove that there is no intermediate structure between $\langle \mathbb{R}, +,<, \mathbb{Z} \rangle$ and $\langle \mathbb{R}, +,<, 1 \rangle$. We also show that a $\langle \mathbb{R}, +,<, \mathbb{Z} \rangle$-definable relation is $\langle \mathbb{R}, +,<, 1 \rangle$-definable if and only if its intersection with every $\langle \mathbb{R}, +,<, 1 \rangle$-definable line is $\langle \mathbb{R}, +,<, 1 \rangle$-definable. This gives a noneffective but simple characterization of $\langle \mathbb{R}, +,<, 1 \rangle$-definable relations.