On the Lattices of Effectively Open Sets
From MaRDI portal
Publication:3188269
DOI10.1007/978-3-319-40189-8_31zbMath1476.03060OpenAlexW2494261924MaRDI QIDQ3188269
Oleg V. Kudinov, Victor L. Selivanov
Publication date: 17 August 2016
Published in: Pursuit of the Universal (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-40189-8_31
Undecidability and degrees of sets of sentences (03D35) Other degrees and reducibilities in computability and recursion theory (03D30) Theory of numerations, effectively presented structures (03D45)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Towards a descriptive set theory for domain-like structures
- Coding in the partial order of enumerable sets
- Computable functionals of finite types
- The Uniformity Principle for -definability
- Effectively dense Boolean algebras and their applications
- Undecidability of Some Topological Theories
This page was built for publication: On the Lattices of Effectively Open Sets