Fast cut-elimination by projection

被引：0

作者：

Baaz, M ^{[1
]}

Leitsch, A ^{[1
]}

机构：

[1] Vienna Tech Univ, A-1040 Vienna, Austria

来源：

COMPUTER SCIENCE LOGIC | 1997年 / 1258卷

关键词：

D O I：

暂无

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

引用

页码：18 / 33

页数：16

共 50 条

[31] A cut-elimination proof in intuitionistic predicate logic
Borisavljevic, M
ANNALS OF PURE AND APPLIED LOGIC, 1999, 99 (1-3) : 105 - 136
[32] An intensional type theory: Motivation and cut-elimination
Gilmore, PC
JOURNAL OF SYMBOLIC LOGIC, 2001, 66 (01) : 383 - 400
[33] A note on cut-elimination for classical propositional logic
Pulcini, Gabriele
ARCHIVE FOR MATHEMATICAL LOGIC, 2022, 61 (3-4) : 555 - 565
[34] CUT-ELIMINATION THEOREM FOR THE LOGIC OF CONSTANT DOMAINS
KASHIMA, R
SHIMURA, T
MATHEMATICAL LOGIC QUARTERLY, 1994, 40 (02) : 153 - 172
[35] Strong normalisation of cut-elimination that simulates β-reduction
Kikuchi, Kentaro
Lengrand, Stephane
FOUNDATIONS OF SOFTWARE SCIENCE AND COMPUTATIONAL STRUCTURES, PROCEEDINGS, 2008, 4962 : 380 - +
[36] Strong normalisation of cut-elimination in classical logic
Urban, C
Bierman, GM
TYPED LAMBDA CALCULI AND APPLICATIONS, 1999, 1581 : 365 - 380
[37] Reducing redundancy in cut-elimination by resolution Preface
Baaz, Matthias
Ciabattoni, Agata
Gabbay, Dov M.
Hetzl, Stefan
Weller, Daniel
JOURNAL OF LOGIC AND COMPUTATION, 2017, 27 (02)
[38] Strong normalisation of cut-elimination in classical logic
Urban, C
Bierman, GM
FUNDAMENTA INFORMATICAE, 2001, 45 (1-2) : 123 - 155
[39] Towards an algorithmic construction of cut-elimination procedures
Ciabattoni, Agata
Leitsch, Alexander
MATHEMATICAL STRUCTURES IN COMPUTER SCIENCE, 2008, 18 (01) : 81 - 105
[40] COMPLETENESS AND CUT-ELIMINATION IN INTUITIONISTIC TYPE LOGIC
OSSWALD, H
MANUSCRIPTA MATHEMATICA, 1972, 6 (01) : 17 - &

← 1 2 3 4 5 →