Helmut Schwichtenberg - 2004 - Mathematical Logic

Helmut Schwichtenberg - 2004 - Mathematical Logic

ID:39402526

大小:1.06 MB

页数:165页

时间:2019-07-02

Helmut Schwichtenberg - 2004 - Mathematical Logic_第1页
Helmut Schwichtenberg - 2004 - Mathematical Logic_第2页
Helmut Schwichtenberg - 2004 - Mathematical Logic_第3页
Helmut Schwichtenberg - 2004 - Mathematical Logic_第4页
Helmut Schwichtenberg - 2004 - Mathematical Logic_第5页
资源描述:

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

1、MathematicalLogicHelmutSchwichtenbergMathematischesInstitutderUniversit¨atM¨unchenWintersemester2003/2004ContentsChapter1.Logic11.FormalLanguages22.NaturalDeduction43.Normalization114.NormalizationincludingPermutativeConversions205.Notes31Chapter2.Models331.StructuresforCla

2、ssicalLogic332.Beth-StructuresforMinimalLogic353.CompletenessofMinimalandIntuitionisticLogic394.CompletenessofClassicalLogic425.UncountableLanguages446.BasicsofModelTheory487.Notes54Chapter3.Computability551.RegisterMachines552.ElementaryFunctions583.TheNormalFormTheorem644

3、.RecursiveDefinitions69Chapter4.G¨odel’sTheorems731.G¨odelNumbers732.UndefinabilityoftheNotionofTruth773.TheNotionofTruthinFormalTheories794.UndecidabilityandIncompleteness815.Representability836.UnprovabilityofConsistency877.Notes90Chapter5.SetTheory911.CumulativeTypeStructu

4、res912.AxiomaticSetTheory923.Recursion,Induction,Ordinals964.Cardinals1165.TheAxiomofChoice1206.OrdinalArithmetic1267.NormalFunctions1338.Notes138Chapter6.ProofTheory139iiiCONTENTS1.OrdinalsBelowε01392.ProvabilityofInitialCasesofTI1413.NormalizationwiththeOmegaRule1454.Unpr

5、ovableInitialCasesofTransfiniteInduction149Bibliography157Index159CHAPTER1LogicThemainsubjectofMathematicalLogicismathematicalproof.Inthisintroductorychapterwedealwiththebasicsofformalizingsuchproofs.ThesystemwepickfortherepresentationofproofsisGentzen’snaturaldeduc-tion,fro

6、m[8].Ourreasonsforthischoicearetwofold.First,asthenamesaysthisisanaturalnotionofformalproof,whichmeansthatthewayproofsarerepresentedcorrespondsverymuchtothewayacarefulmathematicianwritingoutalldetailsofanargumentwouldgoanyway.Second,formalproofsinnaturaldeductionarecloselyr

7、elated(viatheso-calledCurry-Howardcorrespondence)totermsintypedlambdacalculus.Thisprovidesusnotonlywithacompactnotationforlogicalderivations(whichother-wisetendtobecomesomewhatunmanagabletree-likestructures),butalsoopensuparoutetoapplyingthecomputationaltechniqueswhichunder

8、pinlambdacalculus.Apartfromclassicallogicwewillalsodealwithmoreconstructivelogics:

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

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

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