### Resumé

Originalsprog | Engelsk |
---|---|

Titel | Logic, Language, Information, and Computation : 26th International Workshop, WoLLIC 2019, Utrecht, The Netherlands, July 2-5, 2019, Proceedings |

Redaktører | Rosalie Lemhoff, Michael Moortgat, Ruy de Queiroz |

Antal sider | 17 |

Udgivelses sted | Berlin |

Forlag | Springer |

Publikationsdato | 2 jul. 2019 |

Sider | 53-69 |

ISBN (Trykt) | 978-366-259-5329 |

Status | Udgivet - 2 jul. 2019 |

Navn | Lecture Notes in Computer Science |
---|---|

Vol/bind | 11541 |

ISSN | 0302-9743 |

### Citer dette

*Logic, Language, Information, and Computation: 26th International Workshop, WoLLIC 2019, Utrecht, The Netherlands, July 2-5, 2019, Proceedings*(s. 53-69). Berlin: Springer. Lecture Notes in Computer Science, Bind. 11541

}

*Logic, Language, Information, and Computation: 26th International Workshop, WoLLIC 2019, Utrecht, The Netherlands, July 2-5, 2019, Proceedings.*Springer, Berlin, Lecture Notes in Computer Science, bind 11541, s. 53-69.

**Rigid First-Order Hybrid Logic.** / Blackburn, Patrick Rowan; Martins, Manuel; Manzano, Maria ; Huertas, Antonia .

Publikation: Bidrag til bog/antologi/rapport › Konferencebidrag i proceedings › Forskning › peer review

TY - GEN

T1 - Rigid First-Order Hybrid Logic

AU - Blackburn, Patrick Rowan

AU - Martins, Manuel

AU - Manzano, Maria

AU - Huertas, Antonia

PY - 2019/7/2

Y1 - 2019/7/2

N2 - Hybrid logic is usually viewed as a variant of modal logicin which it is possible to refer to worlds. But when one moves beyondpropositional hybrid logic to first or higher-order hybrid logic, it becomesuseful to view it as a systematicmodal language of rigidification.Thekeypoint is this: @ can be used to rigidify not merely formulas, but othertypes of symbol as well. This idea was first explored in first-order hybridlogic (without function symbols) where @ was used to rigidify the first-order constants. It has since been used in hybrid type-theory: here oneonly has function symbols, but they are of every finite type, and @ canrigidify any of them. This paper fills the remaining gap: it introduces afirst-order hybrid language which handles function symbols, and allowspredicate symbols to be rigidified. The basic idea is straightforward, butthere is a slight complication: transferring information about rigiditybetween the level of terms and formulas. We develop a syntax to dealwith this, provide an axiomatization, and prove a strong completenessresult for a varying domain (actualist) semantics.

AB - Hybrid logic is usually viewed as a variant of modal logicin which it is possible to refer to worlds. But when one moves beyondpropositional hybrid logic to first or higher-order hybrid logic, it becomesuseful to view it as a systematicmodal language of rigidification.Thekeypoint is this: @ can be used to rigidify not merely formulas, but othertypes of symbol as well. This idea was first explored in first-order hybridlogic (without function symbols) where @ was used to rigidify the first-order constants. It has since been used in hybrid type-theory: here oneonly has function symbols, but they are of every finite type, and @ canrigidify any of them. This paper fills the remaining gap: it introduces afirst-order hybrid language which handles function symbols, and allowspredicate symbols to be rigidified. The basic idea is straightforward, butthere is a slight complication: transferring information about rigiditybetween the level of terms and formulas. We develop a syntax to dealwith this, provide an axiomatization, and prove a strong completenessresult for a varying domain (actualist) semantics.

KW - Hybrid logic

KW - Rigidty

KW - Actualist semantics

KW - First-order modal logic

KW - Rigid predicate symbols

KW - Function symbols

KW - Varying domains

KW - Henkin models

M3 - Article in proceedings

SN - 978-366-259-5329

SP - 53

EP - 69

BT - Logic, Language, Information, and Computation

A2 - Lemhoff, Rosalie

A2 - Moortgat, Michael

A2 - de Queiroz, Ruy

PB - Springer

CY - Berlin

ER -