Please use this identifier to cite or link to this item: http://hdl.handle.net/10773/27104
Title: Completeness in Equational Hybrid Propositional Type Theory
Author: Manzano, Maria
Martins, Manuel
Huertas, Antonia
Keywords: Propositional type theory
Hybrid logic
Equational logic
Completeness
Issue Date: Dec-2019
Publisher: Springer Verlag
Abstract: Equational Hybrid Propositional Type Theory (EHPTT) is a combination of propositional type theory, equational logic and hybrid modal logic. The structures used to interpret the language contain a hierarchy of propositional types, an algebra (a nonempty set with functions) and a Kripke frame. The main result in this paper is the proof of completeness of a calculus specifically defined for this logic. The completeness proof is based on the three proofs Henkin published last century: (i) Completeness in type theory (ii) The completeness of the first-order functional calculus and (iii) Completeness in propositional type theory. More precisely, from (i) and (ii) we take the idea of building the model described by the maximal consistent set; in our case the maximal consistent set has to be named, ♦- saturated and extensionally algebraic-saturated due to the hybrid and equational nature of EHPTT. From (iii), we use the result that any element in the hierarchy has a name. The challenge was to deal with all the heterogeneous components in an integrated system.
Peer review: yes
URI: http://hdl.handle.net/10773/27104
DOI: 10.1007/s11225-018-9833-5
ISSN: 0039-3215
Appears in Collections:CIDMA - Artigos
AGG - Artigos
DMat - Artigos

Files in This Item:
File Description SizeFormat 
Ria_version2019-02.pdf532.63 kBAdobe PDFembargoedAccess


FacebookTwitterLinkedIn
Formato BibTex MendeleyEndnote Degois 

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