{"docId":3881,"paperId":3659,"url":"https:\/\/lmcs.episciences.org\/3659","doi":"10.23638\/LMCS-13(3:16)2017","journalName":"Logical Methods in Computer Science","issn":"","eissn":"1860-5974","volume":[{"vid":308,"name":"Volume 13, Issue 3"}],"section":[],"repositoryName":"arXiv","repositoryIdentifier":"1705.04564","repositoryVersion":3,"repositoryLink":"https:\/\/arxiv.org\/abs\/1705.04564v3","dateSubmitted":"2017-08-25 11:04:42","dateAccepted":"2017-08-25 11:07:21","datePublished":"2017-08-25 13:50:46","titles":["First Order Theories of Some Lattices of Open Sets"],"authors":["Kudinov, Oleg","Selivanov, Victor"],"abstracts":["We show that the first order theory of the lattice of open sets in some natural topological spaces is $m$-equivalent to second order arithmetic. We also show that for many natural computable metric spaces and computable domains the first order theory of the lattice of effectively open sets is undecidable. Moreover, for several important spaces (e.g., $\\mathbb{R}^n$, $n\\geq1$, and the domain $P\\omega$) this theory is $m$-equivalent to first order arithmetic."],"keywords":["Mathematics - Logic","Computer Science - Logic in Computer Science","03D78, 03D45, 03D55, 03D30"]}