Utilize este identificador para referenciar este registo:
https://hdl.handle.net/1822/43244
Título: | Proof theory for hybrid(ised) logics |
Autor(es): | Neves, Renato Madeira, Alexandre Martins, Manuel A. Barbosa, L. S. |
Palavras-chave: | Hybrid logic Decidability Hilbert calculus Completeness Tableau systems |
Data: | 2016 |
Editora: | Elsevier 1 |
Revista: | Science of Computer Programming |
Citação: | Neves, R., Madeira, A., Martins, M. A., & Barbosa, L. S. (2016). Proof theory for hybrid(ised) logics. Science of Computer Programming, 126, 73-93. doi: 10.1016/j.scico.2016.03.001 |
Resumo(s): | 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 specification methodology for reconfigurable 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. |
Tipo: | Artigo |
URI: | https://hdl.handle.net/1822/43244 |
DOI: | 10.1016/j.scico.2016.03.001 |
ISSN: | 0167-6423 |
Versão da editora: | http://www.sciencedirect.com/science/article/pii/S0167642316000691 |
Arbitragem científica: | yes |
Acesso: | Acesso aberto |
Aparece nas coleções: | HASLab - Artigos em revistas internacionais |
Ficheiros deste registo:
Ficheiro | Descrição | Tamanho | Formato | |
---|---|---|---|---|
NMMB16.pdf | 626,8 kB | Adobe PDF | Ver/Abrir |