关于APAL完全性的一个简要证明.pdfVIP

StudiesinLogic,Vol.8, No. 1 (2015): 65–78 PII:1674-3202(2015)-01-0065-14 ASimpleProofof the Completeness of * PhilippeBalbiani Institutderechercheen informatique de Toulouse(IRIT) – CNRS, University of Toulouse philippe.balbiani@irit.fr Hansvan Ditmarsch LORIA–CNRS, University of Lorraine hans.van-ditmarsch@loria.fr Abstract. We provide a simple proof of the completeness of arbitrary public announcement logic . The proof is an improvement overtheprooffoundin[2]. 1 Introduction In [2] Arbitrary Public Announcement Logic ( ) is presented. This is an extensionofthewell-knownpublicannouncementlogic([7])withquantificationover announcements. Thelogicisaxiomatized,butthecompletenessproofmaybeconsid- ered rather complex. The completeness is shown by employing an infinitary axiom- atization, that is then shown to be equivalent (it produces the same set of theorems) to a finitary axiomatization. The completeness proof in [2] contained an error in the TruthLemma,involvingacomplexitymeasure. Thiserrorhas beencorrectedin [1], byexpandingthatcomplexitymeasure.1 Another source of confusion in [2], although there was no error involved, con- cerned the employment of maximal consistent theories (instead of maximal consis- tentsets,amorecommonterminmodallogic),andanumberofpropertiesshownfor Received 2014-10-15 RevisionReceived 2015-03-03 * We acknowledge useful discussions on the completeness of with Jie Fan, Wiebe van der Hoek,andBarteldKooi. SpecialthanksgotoJieFanforcarefulreadingofthemanuscriptandcorrect- inganerrorinthedefinitionofthe measure. Wethankthereviewersofthejournalfortheirinsightful comments and corrections. Hans van Ditmarsch is also affiliated to IMSc, Chennai, as research asso- ciate. He acknowledges support from ERC project EPS 313360