arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 0812.4727cs.LO
收藏

序列演算中的归纳与共归纳

Induction and Co-induction in Sequent Calculus

Alwen Tiu, Alberto Momigliano

摘要:

证明搜索已被用于指定广泛的计算系统。为了建立一个框架,这样的规范推理,我们使用了一个微积分,涉及感应和共感应。这些证明原则是基于定义的证明理论(而不是集合论)概念。定义类似于(分层的)逻辑程序,其中定义原子的左规则和右规则允许人们将理论视为“封闭的”或定义不动点。定义的使用使得对句法进行内涵推理成为可能,特别是通过统一来强制自由平等。我们以一致的方式添加规则前和后固定点,从而允许用户的原因归纳和共归纳的计算系统的属性,充分利用高阶抽象语法。一致性是保证通过削减消除,在那里,我们给第一,据我们所知,削减消除程序存在的一般归纳和共归纳的定义。

英文摘要:

Proof search has been used to specify a wide range of computation systems. In order to build a framework for reasoning about such specifications, we make use of a sequent calculus involving induction and co-induction. These proof principles are based on a proof theoretic (rather than set-theoretic) notion of definition. Definitions are akin to (stratified) logic programs, where the left and right rules for defined atoms allow one to view theories as "closed" or defining fixed points. The use of definitions makes it possible to reason intensionally about syntax, in particular enforcing free equality via unification. We add in a consistent way rules for pre and post fixed points, thus allowing the user to reason inductively and co-inductively about properties of computational system making full use of higher-order abstract syntax. Consistency is guaranteed via cut-elimination, where we give the first, to our knowledge, cut-elimination procedure in the presence of general inductive and co-inductive definitions.

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

↑