arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1712.09302cs.LOcs.PLmath.CTmath.LO
收藏

论内涵性与内涵递归的语义学

On the Semantics of Intensionality and Intensional Recursion

G. A. Kavvos

摘要:

意向性是一种发生在逻辑和计算中的现象。在最一般的意义上,一个函数是内涵的,如果它在一个比(外延)相等更精细的水平上操作。对于计算机科学家来说,这是一个熟悉的设置,他们经常研究不同的程序或过程,这些程序或过程是可互换的,即在外延上是相等的,即使它们不是以相同的方式实现的,因此在内涵上是不同的。与内涵性相伴的是内涵递归现象,它指的是程序访问自己代码的能力。在可计算性理论中,内涵递归由Kleene第二递归定理实现。本论文关注的是制作一个逻辑工具箱,通过它可以研究这些现象。我们的主要贡献是一个框架,在这个框架中,数学和计算结构可以被认为是外延的,即作为抽象值,或内涵的,即作为其结构的细粒度描述。一旦实现了这一点,它就可以用来分析内涵递归。

英文摘要:

Intensionality is a phenomenon that occurs in logic and computation. In the most general sense, a function is intensional if it operates at a level finer than (extensional) equality. This is a familiar setting for computer scientists, who often study different programs or processes that are interchangeable, i.e. extensionally equal, even though they are not implemented in the same way, so intensionally distinct. Concomitant with intensionality is the phenomenon of intensional recursion, which refers to the ability of a program to have access to its own code. In computability theory, intensional recursion is enabled by Kleene's Second Recursion Theorem. This thesis is concerned with the crafting of a logical toolkit through which these phenomena can be studied. Our main contribution is a framework in which mathematical and computational constructions can be considered either extensionally, i.e. as abstract values, or intensionally, i.e. as fine-grained descriptions of their construction. Once this is achieved, it may be used to analyse intensional recursion.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑