Please use this identifier to cite or link to this item: http://hdl.handle.net/10773/26443
Full metadata record
DC FieldValueLanguage
dc.contributor.authorBlackburn, Patrickpt_PT
dc.contributor.authorMartins, Manuelpt_PT
dc.contributor.authorManzano, Maríapt_PT
dc.contributor.authorHuertas, Antoniapt_PT
dc.date.accessioned2019-08-27T16:36:10Z-
dc.date.available2019-08-27T16:36:10Z-
dc.date.issued2019-06-
dc.identifier.isbn978-3-662-59532-9pt_PT
dc.identifier.issn0302-9743pt_PT
dc.identifier.urihttp://hdl.handle.net/10773/26443-
dc.description.abstractHybrid 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.isoengpt_PT
dc.publisherSpringer Verlagpt_PT
dc.relationFFI2017-82554pt_PT
dc.relationPOCI-01-0145-FEDER-016692pt_PT
dc.relationUID/MAT/04106/2019pt_PT
dc.rightsopenAccesspt_PT
dc.rights.urihttps://creativecommons.org/licenses/by/4.0/pt_PT
dc.subjectHybrid logicpt_PT
dc.subjectFirst-order modal logicpt_PT
dc.subjectRigiditypt_PT
dc.subjectRigid predicate symbolspt_PT
dc.subjectFunction symbolspt_PT
dc.subjectVarying domainspt_PT
dc.subjectActualist semanticspt_PT
dc.subjectHenkin modelspt_PT
dc.titleRigid first-order hybrid logicpt_PT
dc.typebookPartpt_PT
dc.description.versionpublishedpt_PT
dc.peerreviewedyespt_PT
degois.publication.firstPage53pt_PT
degois.publication.lastPage69pt_PT
degois.publication.titleLogic, Language, Information, and Computation. WoLLIC 2019. Lecture Notes in Computer Sciencept_PT
degois.publication.volume11541pt_PT
dc.identifier.doi10.1007/978-3-662-59533-6_4pt_PT
dc.identifier.esbn978-3-662-59533-6pt_PT
Appears in Collections:CIDMA - Capítulo de livro
AGG - Capítulo de livro

Files in This Item:
File Description SizeFormat 
FO_HL_rigid.pdf355.82 kBAdobe PDFView/Open


FacebookTwitterLinkedIn
Formato BibTex MendeleyEndnote Degois 

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.