找回密碼
 To register

QQ登錄

只需一步,快速開始

掃一掃,訪問微社區(qū)

打印 上一主題 下一主題

Titlebook: Methods of Cut-Elimination; Alexander Leitsch,Matthias Baaz Book 2011 Springer Science+Business Media B.V. 2011 CERES.Goedel logic.cut-eli

[復(fù)制鏈接]
查看: 51458|回復(fù): 43
樓主
發(fā)表于 2025-3-21 16:18:35 | 只看該作者 |倒序瀏覽 |閱讀模式
書目名稱Methods of Cut-Elimination
編輯Alexander Leitsch,Matthias Baaz
視頻videohttp://file.papertrans.cn/633/632370/632370.mp4
概述First book on methods of cut-elimination.Combines techniques and results from proof theory and automated deduction.Thereby the book provides a completely new view on proof theoretic methods and their
叢書名稱Trends in Logic
圖書封面Titlebook: Methods of Cut-Elimination;  Alexander Leitsch,Matthias Baaz Book 2011 Springer Science+Business Media B.V. 2011 CERES.Goedel logic.cut-eli
描述.This is the first book on cut-elimination in first-order predicate logic from an algorithmic point of view. Instead of just proving the existence of cut-free proofs, it focuses on the algorithmic methods transforming proofs with arbitrary cuts to proofs with only atomic cuts (atomic cut normal forms, so-called ACNFs). The first part investigates traditional reductive methods from the point of view of proof rewriting. Within this general framework, generalizations of Gentzen‘s and Sch”utte-Tait‘s cut-elimination methods are defined and shown terminating with ACNFs of the original proof. Moreover, a complexity theoretic comparison of Gentzen‘s and Tait‘s methods is given..The core of the book centers around the cut-elimination method CERES (cut elimination by resolution) developed by the authors. CERES is based on the resolution calculus and radically differs from the reductive cut-elimination methods. The book shows that CERES asymptotically outperforms all reductive methods based on Gentzen‘s cut-reduction rules. It obtains this result by heavy use of subsumption theorems in clause logic. Moreover, several applications of CERES are given (to interpolation, complexity analysis of c
出版日期Book 2011
關(guān)鍵詞CERES; Goedel logic; cut-elimination; proof analysis; resolution
版次1
doihttps://doi.org/10.1007/978-94-007-0320-9
isbn_softcover978-94-007-3497-5
isbn_ebook978-94-007-0320-9Series ISSN 1572-6126 Series E-ISSN 2212-7313
issn_series 1572-6126
copyrightSpringer Science+Business Media B.V. 2011
The information of publication is updating

書目名稱Methods of Cut-Elimination影響因子(影響力)




書目名稱Methods of Cut-Elimination影響因子(影響力)學(xué)科排名




書目名稱Methods of Cut-Elimination網(wǎng)絡(luò)公開度




書目名稱Methods of Cut-Elimination網(wǎng)絡(luò)公開度學(xué)科排名




書目名稱Methods of Cut-Elimination被引頻次




書目名稱Methods of Cut-Elimination被引頻次學(xué)科排名




書目名稱Methods of Cut-Elimination年度引用




書目名稱Methods of Cut-Elimination年度引用學(xué)科排名




書目名稱Methods of Cut-Elimination讀者反饋




書目名稱Methods of Cut-Elimination讀者反饋學(xué)科排名




單選投票, 共有 1 人參與投票
 

0票 0.00%

Perfect with Aesthetics

 

0票 0.00%

Better Implies Difficulty

 

0票 0.00%

Good and Satisfactory

 

0票 0.00%

Adverse Performance

 

1票 100.00%

Disdainful Garbage

您所在的用戶組沒有投票權(quán)限
沙發(fā)
發(fā)表于 2025-3-21 22:26:19 | 只看該作者
板凳
發(fā)表于 2025-3-22 00:57:42 | 只看該作者
地板
發(fā)表于 2025-3-22 08:06:43 | 只看該作者
Reduction and Elimination,s the existence of a mid-sequent and the decidability of propositional intuitionistic logic. The idea of the Hauptsatz is connected to the elimination of ideal objects in mathematical proofs according to Hilbert’s program. In this sense . (with the standard axiom set) is consistent because the empty
5#
發(fā)表于 2025-3-22 12:26:20 | 只看該作者
Cut-Elimination by Resolution,rator in the cut-formula and either eliminate it directly (grade reduction) or indirectly (rank reduction). Here it is typical that, during grade reduction, the cut formulas are “peeled” from outside. These methods are local in the sense that only a small part of the whole proof is analyzed, namely
6#
發(fā)表于 2025-3-22 13:11:30 | 只看該作者
Extensions of CERES, a wide range of first-order cacluli. First of all . is a semantic method, in the sense that it works for all sound sequent calculi with a definable ancestor relation and a semantically complete clausal calculus. In this chapter we first show that a . method can be defined for virtually any sound se
7#
發(fā)表于 2025-3-22 20:54:33 | 只看該作者
8#
發(fā)表于 2025-3-23 00:32:42 | 只看該作者
9#
發(fā)表于 2025-3-23 05:21:35 | 只看該作者
10#
發(fā)表于 2025-3-23 09:11:16 | 只看該作者
 關(guān)于派博傳思  派博傳思旗下網(wǎng)站  友情鏈接
派博傳思介紹 公司地理位置 論文服務(wù)流程 影響因子官網(wǎng) 吾愛論文網(wǎng) 大講堂 北京大學(xué) Oxford Uni. Harvard Uni.
發(fā)展歷史沿革 期刊點評 投稿經(jīng)驗總結(jié) SCIENCEGARD IMPACTFACTOR 派博系數(shù) 清華大學(xué) Yale Uni. Stanford Uni.
QQ|Archiver|手機(jī)版|小黑屋| 派博傳思國際 ( 京公網(wǎng)安備110108008328) GMT+8, 2025-10-19 05:50
Copyright © 2001-2015 派博傳思   京公網(wǎng)安備110108008328 版權(quán)所有 All rights reserved
快速回復(fù) 返回頂部 返回列表
四川省| 清新县| 乡宁县| 广州市| 额济纳旗| 舟山市| 济南市| 临汾市| 曲阜市| 灵台县| 阳朔县| 秭归县| 淮南市| 松溪县| 绥中县| 高邑县| 武山县| 台州市| 台湾省| 芒康县| 新乡市| 怀仁县| 安宁市| 郎溪县| 静海县| 曲松县| 垦利县| 读书| 湖北省| 晋城| 凤阳县| 贵德县| 宁阳县| 黄龙县| 辉南县| 博兴县| 嘉禾县| 茂名市| 宜州市| 景洪市| 江安县|