Please use this identifier to cite or link to this item:
http://hdl.handle.net/10773/27104
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Manzano, Maria | pt_PT |
dc.contributor.author | Martins, Manuel A. | pt_PT |
dc.contributor.author | Huertas, Antonia | pt_PT |
dc.date.accessioned | 2019-12-06T11:03:30Z | - |
dc.date.issued | 2019-12 | - |
dc.identifier.issn | 0039-3215 | pt_PT |
dc.identifier.uri | http://hdl.handle.net/10773/27104 | - |
dc.description.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. | pt_PT |
dc.language.iso | eng | pt_PT |
dc.publisher | Springer Verlag | pt_PT |
dc.relation | MINECO - FFI2013-47126-P | pt_PT |
dc.relation | MINECO - FFI2017-82554 | pt_PT |
dc.relation | info:eu-repo/grantAgreement/FCT/5876/147206/PT | pt_PT |
dc.relation | Dalí - POCI-01-0145-FEDER-016692 | pt_PT |
dc.rights | openAccess | pt_PT |
dc.rights.uri | https://creativecommons.org/licenses/by/4.0/ | pt_PT |
dc.subject | Propositional type theory | pt_PT |
dc.subject | Hybrid logic | pt_PT |
dc.subject | Equational logic | pt_PT |
dc.subject | Completeness | pt_PT |
dc.title | Completeness in Equational Hybrid Propositional Type Theory | pt_PT |
dc.type | article | pt_PT |
dc.description.version | published | pt_PT |
dc.peerreviewed | yes | pt_PT |
degois.publication.firstPage | 1159 | pt_PT |
degois.publication.issue | 6 | pt_PT |
degois.publication.lastPage | 1198 | pt_PT |
degois.publication.title | Studia Logica | pt_PT |
degois.publication.volume | 107 | pt_PT |
dc.date.embargo | 2020-12-01 | - |
dc.identifier.doi | 10.1007/s11225-018-9833-5 | pt_PT |
dc.identifier.essn | 1572-8730 | pt_PT |
Appears in Collections: | CIDMA - Artigos AGG - Artigos DMat - Artigos |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
Ria_version2019-02.pdf | 532.63 kB | Adobe PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.