首页> 外文会议>International workshop on algebraic development techniques >Satisfiability Calculus: The Semantic Counterpart of a Proof Calculus in General Logics
【24h】

Satisfiability Calculus: The Semantic Counterpart of a Proof Calculus in General Logics

机译:可满足性演算:通用逻辑中证明演算的语义对应

获取原文
获取外文期刊封面目录资料

摘要

Since its introduction by Goguen and Burstall in 1984, the theory of institutions has been one of the most widely accepted formal-izations of abstract model theory. This work was extended by a number of researchers, Jose Meseguer among them, who presented General Logics, an abstract framework that complements the model theoretical view of institutions by defining the categorical structures that provide a proof theory for any given logic. In this paper we intend to complete this picture by providing the notion of Satisfiability Calculus, which might be thought of as the semantical counterpart of the notion of proof calculus, that provides the formal foundations for those proof systems that use model construction techniques to prove or disprove a given formula, thus "implementing" the satisfiability relation of an institution.
机译:自1984年Goguen和Burstall提出制度理论以来,制度理论一直是抽象模型理论最广泛接受的形式化形式之一。这项工作由许多研究人员(其中包括Jose Meseguer)进行了扩展,他们提出了通用逻辑,该通用框架是一个抽象框架,它通过定义为任何给定逻辑提供证明理论的分类结构来补充制度模型理论的观点。在本文中,我们打算通过提供“可满足性演算”的概念来完善这张图,“可满足性演算”可以被视为证明演算概念的语义对应,它为那些使用模型构造技术来证明或证明的证明系统提供了正式的基础。证明给定的公式,从而“实现”机构的可满足性关系。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号