Skip to Main content Skip to Navigation
New interface
Conference papers

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

Abstract : Since its introduction by Goguen and Burstall in 1984, the theory of institutions has been one of the most widely accepted formalizations of abstract model theory. This work was extended by a number of researchers, José 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.
Document type :
Conference papers
Complete list of metadata

Cited literature [36 references]  Display  Hide  Download
Contributor : Hal Ifip Connect in order to contact the contributor
Submitted on : Thursday, March 9, 2017 - 3:33:25 PM
Last modification on : Thursday, September 2, 2021 - 9:08:01 AM
Long-term archiving on: : Saturday, June 10, 2017 - 2:34:14 PM


Files produced by the author(s)


Distributed under a Creative Commons Attribution 4.0 International License



Carlos Gustavo López Pombo, Pablo F. Castro, Nazareno M. Aguirre, Thomas E. Maibaum. Satisfiability Calculus: The Semantic Counterpart of a Proof Calculus in General Logics. 21th InternationalWorkshop on Algebraic Development Techniques (WADT), Jun 2012, Salamanca, Spain. pp.195-211, ⟨10.1007/978-3-642-37635-1_12⟩. ⟨hal-01485970⟩



Record views


Files downloads