Arboreal categories and equi-resource homomorphism preservation theorems

arXiv (Cornell University)(2024)

引用 0|浏览1
暂无评分
摘要
The classical homomorphism preservation theorem, due to Łoś, Lyndon and Tarski, states that a first-order sentence φ is preserved under homomorphisms between structures if, and only if, it is equivalent to an existential positive sentence ψ. Given a notion of (syntactic) complexity of sentences, an “equi-resource” homomorphism preservation theorem improves on the classical result by ensuring that ψ can be chosen so that its complexity does not exceed that of φ.We describe an axiomatic approach to equi-resource homomorphism preservation theorems based on the notion of arboreal category. This framework is then employed to establish novel homomorphism preservation results, and improve on known ones, for various logic fragments, including first-order, guarded and modal logics.
更多
查看译文
关键词
Homomorphism preservation theorems,Logical resources,Game comonads,First-order logic,Modal logic,Guarded logics
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要