Completeness in hybrid type theory

Mostrar todas las versiones(2)

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 w...

Descripción completa

Guardado en:
Detalles Bibliográficos
Autores principales: Areces, Carlos Eduardo, Blackburn, Patrick, Huertas, Antonia, Manzano, María
Formato: article
Lenguaje:Inglés
Publicado: 2021
Materias:
Hybrid logic
Type theory
Higher-order modal logic
Nominals
@ operators
Acceso en línea:http://hdl.handle.net/11086/20021
https://doi.org/10.1007/s10992-012-9260-4
Aporte de:
Repositorio Digital Universitario (UNC) de Universidad Nacional de Córdoba

Ejemplares similares

Ejemplares similares