Please use this identifier to cite or link to this item: http://hdl.handle.net/10773/15853
Title: Proof theory for hybrid(ised) logics
Author: Neves, Renato
Madeira, Alexandre
Martins, Manuel A.
Barbosa, Luis S.
Keywords: Hybrid logic
Decidability
Completeness
Tableau systems
Hilbert calculus
Issue Date: 14-Mar-2016
Publisher: Elsevier
Abstract: Hybridisation is a systematic process along which the characteristic features of hybrid logic, both at the syntactic and the semantic levels, are developed on top of an arbitrary logic framed as an institution. In a series of papers this process has been detailed and taken as a basis for a speci cation methodology for recon gurable systems. The present paper extends this work by showing how a proof calculus (in both a Hilbert and a tableau based format) for the hybridised version of a logic can be systematically generated from a proof calculus for the latter. Such developments provide the basis for a complete proof theory for hybrid(ised) logics, and thus pave the way to the development of (dedicated) proof support.
Peer review: yes
URI: http://hdl.handle.net/10773/15853
DOI: 10.1016/j.scico.2016.03.001
ISSN: 0167-6423
Appears in Collections:CIDMA - Artigos
AGG - Artigos

Files in This Item:
File Description SizeFormat 
Repositorio_versionjul16.pdfDocumento principal520.38 kBAdobe PDFView/Open


FacebookTwitterDeliciousLinkedInDiggGoogle BookmarksMySpace
Formato BibTex MendeleyEndnote Degois 

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.