加载中…
is a version of Church’s type theory with global quotation and evaluation operators that is engineered to reason about the interplay of syntax and semantics and to formalize syntax-based mathematical algorithms. is a variant of that admits undefined expressions, partial functions, and multiple base types of individuals. It is better suited than as a logic for building networks of theories connected by theory morphisms. This paper presents the syntax and semantics of , defines a notion of a theory morphism from one theory to another, and gives two simple examples that illustrate the use of theory morphisms in ${\rm CTT}_{\rm uqe}$.

生成讲解博客的中文版本

生成AI智能校验的中文版本