Please use this identifier to cite or link to this item:
http://hdl.handle.net/10773/26443
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Blackburn, Patrick | pt_PT |
dc.contributor.author | Martins, Manuel A. | pt_PT |
dc.contributor.author | Manzano, María | pt_PT |
dc.contributor.author | Huertas, Antonia | pt_PT |
dc.date.accessioned | 2019-08-27T16:36:10Z | - |
dc.date.available | 2019-08-27T16:36:10Z | - |
dc.date.issued | 2019-06 | - |
dc.identifier.isbn | 978-3-662-59532-9 | pt_PT |
dc.identifier.issn | 0302-9743 | pt_PT |
dc.identifier.uri | http://hdl.handle.net/10773/26443 | - |
dc.description.abstract | Hybrid logic is usually viewed as a variant of modal logic in which it is possible to refer to worlds. But when one moves beyond propositional hybrid logic to first- or higher-order hybrid logic, it becomes useful to view it as a systematic modal language of rigidification. The key point is this: @ can be used to rigidify not merely formulas, but other types of symbol as well. This idea was first explored in first-order hybrid logic (without function symbols) where @ was used to rigidify the firstorder constants. It has since been used in hybrid type-theory: here one only has function symbols, but they are of every finite type, and @ can rigidify any of them. This paper fills the remaining gap: it introduces a first-order hybrid language which handles function symbols, and allows predicate symbols to be rigidified. The basic idea is straightforward, but there is a slight complication: transferring information about rigidity between the level of terms and formulas. We develop a syntax to deal with this, provide an axiomatization, and prove a strong completeness result for a varying domain (actualist) semantics. | pt_PT |
dc.language.iso | eng | pt_PT |
dc.publisher | Springer Verlag | pt_PT |
dc.relation | FFI2017-82554 | pt_PT |
dc.relation | POCI-01-0145-FEDER-016692 | pt_PT |
dc.relation | UID/MAT/04106/2019 | pt_PT |
dc.rights | openAccess | pt_PT |
dc.rights.uri | https://creativecommons.org/licenses/by/4.0/ | pt_PT |
dc.subject | Hybrid logic | pt_PT |
dc.subject | First-order modal logic | pt_PT |
dc.subject | Rigidity | pt_PT |
dc.subject | Rigid predicate symbols | pt_PT |
dc.subject | Function symbols | pt_PT |
dc.subject | Varying domains | pt_PT |
dc.subject | Actualist semantics | pt_PT |
dc.subject | Henkin models | pt_PT |
dc.title | Rigid first-order hybrid logic | pt_PT |
dc.type | bookPart | pt_PT |
dc.description.version | published | pt_PT |
dc.peerreviewed | yes | pt_PT |
degois.publication.firstPage | 53 | pt_PT |
degois.publication.lastPage | 69 | pt_PT |
degois.publication.title | Logic, Language, Information, and Computation. WoLLIC 2019. Lecture Notes in Computer Science | pt_PT |
degois.publication.volume | 11541 | pt_PT |
dc.identifier.doi | 10.1007/978-3-662-59533-6_4 | pt_PT |
dc.identifier.esbn | 978-3-662-59533-6 | pt_PT |
Appears in Collections: | CIDMA - Capítulo de livro AGG - Capítulo de livro |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
FO_HL_rigid.pdf | 355.82 kB | Adobe PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.