%0 Conference Proceedings
%T Satisfiability Calculus: The Semantic Counterpart of a Proof Calculus in General Logics
%+ Universidad de Buenos Aires [Buenos Aires] (UBA)
%+ Consejo Nacional de Investigaciones Científicas y Técnicas [Buenos Aires] (CONICET)
%+ National University of Río Cuarto = Universidad Nacional de Río Cuarto (UNRC)
%+ McMaster University [Hamilton, Ontario]
%A López Pombo, Carlos, Gustavo
%A Castro, Pablo, F.
%A Aguirre, Nazareno, M.
%A Maibaum, Thomas, E.
%< avec comité de lecture
%( Lecture Notes in Computer Science
%B 21th InternationalWorkshop on Algebraic Development Techniques (WADT)
%C Salamanca, Spain
%Y Narciso Martí-Oliet
%Y Miguel Palomino
%I Springer
%3 Recent Trends in Algebraic Development Techniques
%V LNCS-7841
%P 195-211
%8 2012-06-07
%D 2012
%R 10.1007/978-3-642-37635-1_12
%Z Computer Science [cs]Conference papers
%X 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.
%G English
%Z TC 1
%Z WG 1.3
%2 https://inria.hal.science/hal-01485970/document
%2 https://inria.hal.science/hal-01485970/file/978-3-642-37635-1_12_Chapter.pdf
%L hal-01485970
%U https://inria.hal.science/hal-01485970
%~ IFIP-LNCS
%~ IFIP
%~ IFIP-TC
%~ IFIP-TC1
%~ IFIP-WG1-3
%~ IFIP-LNCS-7841
%~ IFIP-WADT