分次模态传递框架类.pdfVIP

  • 1
  • 0
  • 约1.47万字
  • 约 7页
  • 2017-11-27 发布于福建
  • 举报
StudiesinLogic,Vo1.3,No.2(2010):19—25 PII:1674--3202(2010)--02-0019--07 GradedM odalClassesofFiniteTransitiveFrames术 M inghuiM a DepartmentofPhilosophy,TsinghuaUniversity InstituteforLogic,LanguageandComputation,UniversiytofAmsterdam mmh.thu@gmail.com Abstract. W show theGoldblatt—Thomasontypetheorem forgradedmodallogicwithinfi— nitetransitiverfames.A classoffinitetransitiveflamesisdefinablebyasetofgradedmodal formulasiffitisclosedunderdi~ointunions,generatedsubframesandgradedboundedmot- phicimages.TheproofofitusesgradedJankov-Finefomr ulasforfinitertansitiverfameswith root. WeproveinthispaperthattheGoldblatt—Thomasontheorem forgradedmodal logicholdswithinfinitetransitiverfames,i.e.,withinthisclass,closureunderthree flameconstructionsofdisjointunion,generatedsubrfame,andgradedboundedmot- phicimageisanecessaryandSU伍cientconditionforaclassofrfamestobedefinable ingradedmodal1anguage.Theproofwillmakeuseofavariantofthefma ousJankov— Fineformulaofrgradedmodallogic.SeeK.Fine(【11】),RBlackburnet.a1.([3]), andA.ChagrovandM.Zakharyaschev([5]).Theproofstrategyistocharacterizethe boundedmorphism from anyrfma e0toaflame withrootWviathesatisfactionof afomr ula attherootofapointgeneratedsubfralIleof0.Thisformulaiscalled thegradedJankov—Finefomr ulaofr . Wefistintroducesomebasicnotionsofgradedmodallogic(GML).Thelan— guageofGMLconsistsofunaryoperators◇ ofrallnaturalnumberskandasetof propositionalletters .TheGML—fomr ulasraegivenbythefollowinginductiveur le: ≯::=PI一 l V l◇ wherek ∈ andP ∈西.Define口 := _1◇一1,◇! :: ◇ 八_]◇+1, De:=Dieand◇西:=◇1.GivenaKripkemodel93t= ( R,V)andW ∈W, definethenotionofaformula beingtrueatastateW inamodel9)I(notation: ,W }==)recursivelyasusualinbasicmodallogicexceptthefollowingclausefor gradedmodalities: ,W}==Ok~ifffn(w)n ()f k Received

您可能关注的文档

文档评论(0)

1亿VIP精品文档

相关文档