A Hypersequent Calculus with Clusters for Data Logic over Ordinals - Archive ouverte HAL Accéder directement au contenu
Pré-Publication, Document De Travail Année : 2019

A Hypersequent Calculus with Clusters for Data Logic over Ordinals

Résumé

We study freeze tense logic over well-founded data streams. The logic features past-and future-navigating modalities along with freeze quantifiers, which store the datum of the current position and test data (in)equality later in the formula. We introduce a decidable fragment of that logic, and present a proof system that is sound for the whole logic, and complete for this fragment. Technically, this is a hy-persequent system enriched with an ordering, clusters, and annotations. The proof system is tailored for proof search, and yields an optimal coNP complexity for validity and a small model property for our fragment.
Fichier principal
Vignette du fichier
main.pdf (497.71 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-02165359 , version 1 (25-06-2019)

Identifiants

  • HAL Id : hal-02165359 , version 1

Citer

Anthony Lick. A Hypersequent Calculus with Clusters for Data Logic over Ordinals. 2019. ⟨hal-02165359⟩
60 Consultations
108 Téléchargements

Partager

Gmail Facebook X LinkedIn More