Deep inference and its normal form of derivations

被引：12

作者：

Bruennler, Kai ^{[1
]}

机构：

[1] Inst Angew Math & Informat, CH-3012 Bern, Switzerland

来源：

LOGICAL APPROACHES TO COMPTATIONAL BARRIERS, PROCEEDINGS | 2006年 / 3988卷

关键词：

D O I：

10.1007/11780342_7

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

We see a notion of normal derivation for the calculus of structures, which is based on a factorisation of derivations and which is more general than the traditional notion of cut-free proof in this formalism.

引用

页码：65 / 74

页数：10

共 25 条

[1]

[Anonymous], 1977, PROOF THEORY

[2]

[Anonymous], LECT NOTES COMPUTER

[3]

[Anonymous], ADV MODAL LOGIC

[4]

[Anonymous], 2003, THESIS TU DRESDEN

[5] Cut elimination inside a deep inference system for classical predicate logic [J].

Brünnler K. .

Studia Logica, 2006, 82 (1) :51-71

[6]

Brünnler K, 2003, LECT NOTES COMPUT SC, V2803, P86

[7]

BRUNNLER K, 2005, STRUCTURES DEDUCTION, P69

[8]

Brunnler Kai, 2001, Lecture Notes in Computer Science, V2250, P347, DOI DOI 10.1007/3-540-45653-8_24

[9]

BRUSCOLI P, 2006, IN PRES PROOF COMPLE

[10]

Di Gianantonio P, 2004, LECT NOTES COMPUT SC, V3210, P130

← 1 2 3 →