可知性作为连续性：信息依赖的拓扑学解释
Knowability as continuity: a topological account of informational dependence
AI总结：
本文用拓扑学中的连续函数依赖刻画经验问题间的可知信息依赖，证明认知独立性与非连续函数依赖相容，并给出结合一般、连续与一致连续依赖语言的完全逻辑。
摘要：
我们研究经验问题之间可知的信息依赖，将其建模为拓扑环境中变量之间的连续函数依赖。我们还在拓扑术语下考察认知独立性，并证明它与函数（但非连续）依赖是相容的。随后，我们进一步研究基于一致连续依赖的更强的可知性概念。在技术逻辑方面，我们确定了结合一般函数依赖、连续依赖和一致连续依赖的语言的完全逻辑。
英文摘要：
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.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
