Hybrid logics with infinitary proof systems

Abstract

We provide a strongly complete infinitary proof system for hybrid logic. This proof system can be extended with countably many sequents. Thus, although these logics may be non-compact, strong completeness proofs are provided for infinitary hybrid versions of non-compact logics like ancestral logic and Segerberg’s modal logic with the bounded chain condition. This extends the completeness result for hybrid logics by Gargov, Passy, and Tinchev.

Other Versions

No versions found

Links

PhilArchive

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

  • Only published works are available at libraries.

Similar books and articles

Meeting strength in substructural logics.Yde Venema - 1995 - Studia Logica 54 (1):3 - 32.
Hybrid logics of separation axioms.Dmitry Sustretov - 2009 - Journal of Logic, Language and Information 18 (4):541-558.
Complete infinitary type logics.J. W. Degen - 1999 - Studia Logica 63 (1):85-119.
Branching-time logics repeatedly referring to states.Volker Weber - 2009 - Journal of Logic, Language and Information 18 (4):593-624.

Analytics

Added to PP
2010-07-26

Downloads
68 (#876,590)

6 months
15 (#771,617)

Historical graph of downloads
How can I increase my downloads?

Author Profiles

Barteld Kooi
University of Groningen

Citations of this work

Strong Completeness and Limited Canonicity for PDL.Gerard Renardel de Lavalette, Barteld Kooi & Rineke Verbrugge - 2009 - Journal of Logic, Language and Information 18 (2):291-292.

Add more citations

References found in this work

No references found.

Add more references