Intuitionistic propositional Logic with the Converse Ackermann Property”, Teorema vol XXII.pdfVIP

下载本文档

6
0
约2.93万字
约 12页
2017-07-03 发布于河南
举报
版权申诉

Intuitionistic propositional Logic with the Converse Ackermann Property”, Teorema vol XXII.pdf

1、原创力文档（book118）网站文档一经付费（服务费），不意味着购买了该文档的版权，仅供个人/单位学习、研究之用，不得用于商业用途，未经授权，严禁复制、发行、汇编、翻译或者网络传播等，侵权必究。。
2、本站所有内容均由合作方或网友上传，本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺！文档内容仅供研究参考，付费前请自行鉴别。如您付费，意味着您自己接受本站规则且自行承担风险，本站不退款、不进行额外附加服务；查看《如何避免下载的几个坑》。如果您已付费下载过本站文档，您可以点击这里二次下载。
3、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等，请点击“版权申诉”（推荐），也可以打举报电话：400-050-0827(电话支持时间：9:00-18:30)。
4、该文档为VIP文档，如果想要下载，成为VIP会员后，下载免费。
5、成为VIP后，下载本文档将扣除1次下载权益。下载后，不支持退款、换文档。如有疑问请联系我们。
6、成为VIP后，您将拥有八大权益，权益包括：VIP文档下载权益、阅读免打扰、文档格式转换、高级专利检索、专属身份标志、高级客服、多端互通、版权登记。
7、VIP文档为合作方或网友上传，每下载1次，网站将根据用户上传文档的质量评分、类型等，对文档贡献者给予高额补贴、流量扶持。如果你也想贡献VIP文档。上传文档

Intuitionistic propositional Logic with the Converse Ackermann Property”, Teorema vol XXII

teorema Vol. XXII/ 1-2, 2003, pp. 43-54 Intuitionistic Propositional Logic with the Converse Ackermann Property1,2 Gemma Robles, José M. Méndez, Francisco Salto, and Pedro Méndez R. RESUMEN En este artículo extendemos el espectro de las lógicas con la Conversa de la Propiedad Ackermann. Definimos y axiomatizamos lógicas proposicionales intuicio- nistas positivas, lógicas subintuicionistas y lógicas intuicionistas con la Conversa de la Propiedad Ackermann. Especialmente interesante es la versión de la negación in- tuicionista propia de algunos de estos sistemas. Presentamos semánticas de tipo rela- cional ternario para cada una de las lógicas que estudiamos en este trabajo. ABSTRACT The range of propositional logics with the Converse Ackermann Property is proved to be wider than currently assumed. Subintuitionistic, positive intuitionistic and intuitionistic propositional logics with the Converse Ackermann Property are de- fined and axiomatized. A particular version of intuitionistic negation is involved in some of these systems. Complete ternary relational semantics are offered for all logics studied in the paper. I. INTRODUCTION Consider any propositional logic L with an implication connective → and a propositional falsity constant F. L has the Converse Ackermann Property (C.A.P.) if all formulas of the form (A → B) → C are unprovable whenever C contains neither → nor F. The property is named after the “Ackermann Prop- erty”, which is prevalently considered to be a necessary property of any logic of entailment (L has the Ackermann Property if all the formulas of the form A → (B → C) are unprovable whenever A contains neither → nor F. The study of both Ackermann Property and its converse b