We study knowable informational dependence between empirical questions, modeled as continuous functional dependence between variables in a topological setting. We also investigate epistemic independence in topological terms and show that it is compatible with functional (but non-continuous) dependence. We then proceed to study a stronger notion of knowability based on uniformly continuous dependence. On the technical logical side, we determine the complete logics of languages that combine general functional dependence, continuous dependence, and uniformly continuous dependence.

翻译：我们研究经验问题之间可知的信息依赖关系，将其建模为拓扑框架中变量间的连续函数依赖。我们还从拓扑角度探讨认识论独立性，并证明它与函数（而非连续）依赖是兼容的。随后，我们基于一致连续依赖研究了一种更强的可知性概念。在技术逻辑层面，我们确定了结合一般函数依赖、连续依赖与一致连续依赖的语言的完备逻辑。