First order theories of some lattices of open sets
From MaRDI portal
(Redirected from First order theories of some lattices of open sets)
Abstract: We show that the first order theory of the lattice of open sets in some natural topological spaces is -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., , , and the domain ) this theory is -equivalent to first order arithmetic.
Recommendations
Cited in
(12)- Effective topological spaces. I: A definability theory
- The undecidability of the lattice of r. e. closed subsets of an effective topological space
- Descriptive complexity of \(\mathsf{qc} \mathsf{b}_0\)-spaces
- More undecidable lattices of Steinitz exchange systems
- On the lattices of effectively open sets
- On the strength of some topological lattices
- First order properties on nowhere dense structures
- Enumeration reducibility in closure spaces with applications to logic and algebra
- A first-order version of Pfaffian closure
- Separating notions in effective topology
- On the main scientific achievements of Victor Selivanov
- COMPUTABLY COMPACT METRIC SPACES
This page was built for publication: First order theories of some lattices of open sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5367055)