A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is `application/pdf`

.

##
###
Satisfiability Calculus: The Semantic Counterpart of a Proof Calculus in General Logics
[chapter]

2013
*
Lecture Notes in Computer Science
*

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

doi:10.1007/978-3-642-37635-1_12
fatcat:c367lec4pbglzlf7dji2o6edyq