The Logic of Provability

The Logic of Provability

ID:39223758

大小:667.08 KB

页数:74页

时间:2019-06-28

The Logic of Provability_第1页
The Logic of Provability_第2页
The Logic of Provability_第3页
The Logic of Provability_第4页
The Logic of Provability_第5页
资源描述:

《The Logic of Provability》由会员上传分享,免费在线阅读,更多相关内容在学术论文-天天文库

1、CHAPTERVIITheLogicofProvabilityGiorgiJaparidzeDepartmentofComputerandInformationScience,UniversityofPennsylvaniaPhiladelphia,Pennsylvania19104-6389,USADickdeJonghInstituteforLogic,LanguageandComputation,UniversityofAmsterdamNL-1018TVAmsterdam,TheNetherlandsThischapterisdedic

2、atedtothememoryofGeorgeBoolos.Fromthestartofthesubjectuntilhisdeathon27May1996hewastheprimeinspireroftheworkinthelogicofprovability.Contents1.Introduction,Solovay'stheorems..........................3602.Modallogicpreliminaries..............................3613.ProofofSolovay

3、'stheorems.............................3654.Fixedpointtheorems................................3675.PropositionaltheoriesandMagari-algebras.....................3686.TheextentofSolovay'stheorems..........................3697.Classi cationofprovabilitylogics....................

4、......3718.Bimodalandpolymodalprovabilitylogics.....................3749.Rosserorderings...................................37810.Logicofproofs....................................38011.Notionsofinterpretability..............................38312.Interpretabilityandpartialcons

5、ervativity......................38613.Axiomatization,semantics,modalcompletenessofILM..............39714.ArithmeticcompletenessofILM..........................40315.Tolerancelogicandotherinterpretabilitylogics..................41016.Predicateprovabilitylogics.................

6、............41317.Acknowledgements..................................422References........................................422HANDBOOKOFPROOFTHEORYEditedbyS.R.Bussc1995.ElsevierScienceB.V.Allrightsreserved.PreliminaryDraft-April17,1997360GiorgiJaparidzeandDickdeJongh1.Introduc

7、tion,Solovay'stheoremsGodel'sincompletenesstheoremsandChurch'sundecidabilitytheoremforarith-meticshowedthatreasonablystrongformalsystemscannotbecompleteanddecidable,andcannotprovetheirownconsistency.Evenatthetimethoughthesenegativetheoremswereaccompaniedbypositiveresults.Fir

8、stly,formalsystemsfarebetterinreasoninginrestrictedareas,andthisreasoningca

当前文档最多预览五页,下载文档查看全文

此文档下载收益归作者所有

当前文档最多预览五页,下载文档查看全文
温馨提示:
1. 部分包含数学公式或PPT动画的文件,查看预览时可能会显示错乱或异常,文件下载后无此问题,请放心下载。
2. 本文档由用户上传,版权归属用户,天天文库负责整理代发布。如果您对本文档版权有争议请及时联系客服。
3. 下载前请仔细阅读文档内容,确认文档内容符合您的需求后进行下载,若出现内容与标题不符可向本站投诉处理。
4. 下载文档时可能由于网络波动等原因无法下载或下载错误,付费完成后未能成功下载的用户请联系客服处理。