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 条
  • [41] Infinitary Cut-Elimination via Finite Approximations
    Acclavio, Matteo
    Curzi, Gianluca
    Guerrieri, Giulio
    32ND EACSL ANNUAL CONFERENCE ON COMPUTER SCIENCE LOGIC, CSL 2024, 2024, 288
  • [42] Modular cut-elimination: Finding proofs or counterexamples
    Ciabattoni, Agata
    Terui, Kazushige
    LOGIC FOR PROGRAMMING, ARTIFICIAL INTELLIGENCE, AND REASONING, PROCEEDINGS, 2006, 4246 : 135 - 149
  • [43] COMPLETENESS AND CUT-ELIMINATION IN CONSTRUCTIVE INFINITARY ARITHMETICS
    SATINDER, PK
    NOTICES OF THE AMERICAN MATHEMATICAL SOCIETY, 1971, 18 (07): : 1108 - &
  • [44] Cut-elimination for Weak Grzegorczyk Logic Go
    Rajeev Goré
    Revantha Ramanayake
    Studia Logica, 2014, 102 : 1 - 27
  • [45] A note on cut-elimination for classical propositional logic
    Gabriele Pulcini
    Archive for Mathematical Logic, 2022, 61 : 555 - 565
  • [46] Completeness and cut-elimination in the intuitionistic theory of types
    DeMarco, M
    Lipton, J
    JOURNAL OF LOGIC AND COMPUTATION, 2005, 15 (06) : 821 - 854
  • [47] On Cut-Elimination Arguments for Axiomatic Theories of Truth
    Daichi Hayashi
    Studia Logica, 2022, 110 : 785 - 818
  • [48] Cut-elimination for Weak Grzegorczyk Logic Go
    Gore, Rajeev
    Ramanayake, Revantha
    STUDIA LOGICA, 2014, 102 (01) : 1 - 27
  • [49] Completeness and cut-elimination theorems for trilattice logics
    Kamide, Norihiro
    Wansing, Heinrich
    ANNALS OF PURE AND APPLIED LOGIC, 2011, 162 (10) : 816 - 835
  • [50] A Cut-Elimination Proof in Positive Relevant Logic with Necessity
    Mirjana Ilić
    Studia Logica, 2021, 109 : 607 - 638
12345