可计算函子与有效可解释性
Computable functors and effective interpretability
摘要:
我们的主要结果是等价的两个概念之间的结构约简。一个是句法概念,它是模型论中可解释性的有效版本,另一个是计算概念,它是著名的梅德韦杰夫约简的加强。我们将我们的结果扩展到有效的双可解释性,也有效减少类结构之间。
英文摘要:
Our main result is the equivalence of two notions of reducibility between structures. One is a syntactical notion which is an effective version of interpretability as in model theory, and the other one is a computational notion which is a strengthening of the well-known Medvedev reducibility. We extend our result to effective bi-interpretability and also to effective reductions between classes of structures.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。