dc.creator | Areces, Carlos Eduardo | |
dc.creator | Blackburn, Patrick | |
dc.creator | Huertas, Antonia | |
dc.creator | Manzano, María | |
dc.date.accessioned | 2021-08-31T14:22:20Z | |
dc.date.accessioned | 2022-10-14T18:11:48Z | |
dc.date.available | 2021-08-31T14:22:20Z | |
dc.date.available | 2022-10-14T18:11:48Z | |
dc.date.created | 2021-08-31T14:22:20Z | |
dc.date.issued | 2014 | |
dc.identifier | Areces, C. E., Blackburn, P., Huertas, A. y Manzano, M. (2014). Completeness in hybrid type theory. Journal of Philosophical Logic, 43 (2-3), 209-238. https://doi.org/10.1007/s10992-012-9260-4 | |
dc.identifier | http://hdl.handle.net/11086/20021 | |
dc.identifier | https://doi.org/10.1007/s10992-012-9260-4 | |
dc.identifier.uri | https://repositorioslatinoamericanos.uchile.cl/handle/2250/4266102 | |
dc.description.abstract | We show that basic hybridization (adding nominals and @ operators) makes it possible to give straightforward Henkin-style completeness proofs even when the modal logic being hybridized is higher-order. The key ideas are to add nominals as expressions of type t, and to extend to arbitrary types the way we interpret @i in propositional and first-order hybrid logic. This means: interpret @iαa, where αa is an expression of any type a, as an expression of type a that rigidly returns the value that αa receives at the i-world. The axiomatization and completeness proofs are generalizations of those found in propositional and first-order hybrid logic, and (as is usual in hybrid logic) we automatically obtain a wide range of completeness results for stronger logics and languages. Our approach is deliberately low-tech. We don’t, for example, make use of Montague’s intensional type s, or Fitting-style intensional models; we build, as simply as we can, hybrid logic over Henkin’s logic. | |
dc.language | eng | |
dc.rights | http://creativecommons.org/licenses/by-nc-nd/4.0/ | |
dc.rights | Attribution-NonCommercial-NoDerivatives 4.0 International | |
dc.source | EISSN 1573-0433 | |
dc.subject | Hybrid logic | |
dc.subject | Type theory | |
dc.subject | Higher-order modal logic | |
dc.subject | Nominals | |
dc.subject | @ operators | |
dc.title | Completeness in hybrid type theory | |
dc.type | article | |