Por favor, use este identificador para citar o enlazar este ítem:
http://hdl.handle.net/10609/99589
Registro completo de metadatos
Campo DC | Valor | Lengua/Idioma |
---|---|---|
dc.contributor.author | Manzano Arjona, María | - |
dc.contributor.author | Martins, Manuel A. | - |
dc.contributor.author | Huertas, M. Antonia | - |
dc.date.accessioned | 2019-07-22T09:01:14Z | - |
dc.date.available | 2019-07-22T09:01:14Z | - |
dc.date.issued | 2018-10-20 | - |
dc.identifier.citation | Manzano Arjona, M., Huertas, M.A. & Martins, M.A. (2018). Completeness in Equational Hybrid Propositional Type Theory. Studia Logica, (), 1-40. doi: 10.1007/s11225-018-9833-5 | - |
dc.identifier.issn | 0039-3215MIAR | - |
dc.identifier.issn | 1572-8730MIAR | - |
dc.identifier.uri | http://hdl.handle.net/10609/99589 | - |
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. | en |
dc.language.iso | eng | - |
dc.publisher | Studia Logica | - |
dc.relation.uri | https://link.springer.com/article/10.1007/s11225-018-9833-5 | - |
dc.rights | CC BY | - |
dc.rights.uri | https://creativecommons.org/licenses/by/4.0/ | - |
dc.subject | Propositional type theory | en |
dc.subject | Hybrid logic | en |
dc.subject | Equational logic | en |
dc.subject | Completeness | en |
dc.subject.lcsh | Algebra | en |
dc.title | Completeness in Equational Hybrid Propositional Type Theory | - |
dc.type | info:eu-repo/semantics/article | - |
dc.subject.lemac | Àlgebra | ca |
dc.subject.lcshes | Álgebra | es |
dc.rights.accessRights | info:eu-repo/semantics/openAccess | - |
dc.identifier.doi | 10.1007/s11225-018-9833-5 | - |
dc.gir.id | AR/0000006277 | - |
dc.relation.projectID | info:eu-repo/grantAgreement/MINECO/2013/FFI2013-47126-P | - |
dc.relation.projectID | info:eu-repo/grantAgreement/AEI/2017/FFI2017-82554 | - |
dc.relation.projectID | info:eu-repo/grantAgreement/FCT/5876/147206/PT | - |
dc.type.version | info:eu-repo/semantics/acceptedVersion | - |
Aparece en las colecciones: | Articles Articles cientÍfics |
Ficheros en este ítem:
Fichero | Descripción | Tamaño | Formato | |
---|---|---|---|---|
Manzano_StudiaLogica_Completeness.pdf | 699,95 kB | Adobe PDF | Visualizar/Abrir |
Comparte:
Los ítems del Repositorio están protegidos por copyright, con todos los derechos reservados, a menos que se indique lo contrario.