Satisfiability Calculus: The Semantic Counterpart of a Proof Calculus in General Logics - Recent Trends in Algebraic DevelopmentTechniques Access content directly
Conference Papers Year : 2013

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.
Fichier principal
Vignette du fichier
978-3-642-37635-1_12_Chapter.pdf (418.73 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01485970 , version 1 (09-03-2017)

Licence

Attribution

Identifiers

Cite

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⟩
223 View
165 Download

Altmetric

Share

Gmail Facebook X LinkedIn More