dc.contributor.author | Fait, Michal | |
dc.contributor.author | Primiero, Giuseppe | |
dc.date.accessioned | 2021-03-31T10:47:43Z | |
dc.date.available | 2021-03-31T10:47:43Z | |
dc.date.issued | 2021 | |
dc.identifier.citation | Journal of Applied Logics - IfCoLoG Journal of Logics and their Applications. 2021, vol. 8, issue 2, p. 469-495. | cs |
dc.identifier.issn | 2055-3706 | |
dc.identifier.issn | 2055-3714 | |
dc.identifier.uri | http://hdl.handle.net/10084/143002 | |
dc.description.abstract | In this paper we introduce the logic HTLC, for Hyperintensional Typed Lambda Calculus. The system extends the typed lambda-calculus with hyperintensions and related rules. The polymorphic nature of the system allows to reason with expressions for extensional, intensional and hyperintentsional entities. We inspect meta-theoretical properties and show that HTLC is complete in Henkin's sense under a weakening of the cardinality constraint for the domain of hyperintensions. | cs |
dc.language.iso | en | cs |
dc.publisher | College Publications | cs |
dc.relation.ispartofseries | Journal of Applied Logics - IfCoLoG Journal of Logics and their Applications | cs |
dc.relation.uri | http://www.collegepublications.co.uk/downloads/ifcolog00044.pdf | cs |
dc.rights | © Individual authors and College Publications 2021. All rights reserved. | cs |
dc.rights.uri | http://creativecommons.org/licenses/by-nc-nd/4.0/ | cs |
dc.title | HTLC: Hyperintensional typed lambda calculus | cs |
dc.type | article | cs |
dc.rights.access | openAccess | cs |
dc.type.version | publishedVersion | cs |
dc.type.status | Peer-reviewed | cs |
dc.description.source | Web of Science | cs |
dc.description.volume | 8 | cs |
dc.description.issue | 2 | cs |
dc.description.lastpage | 495 | cs |
dc.description.firstpage | 469 | cs |
dc.identifier.wos | 000620168700008 | |