Undecidable problems for modal definability (Workshop 2017) - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2017

Undecidable problems for modal definability (Workshop 2017)

Résumé

The core of our talk is the computability of the problem of deciding the modal definability of first-order sentences with respect to classes of frames. It gives a new proof of Chagrova's Theorem telling that, with respect to the class of all frames, the problem of deciding the modal definability of first-order sentences is undecidable. It also gives the proofs of new variants of Chagrova's Theorem
Fichier non déposé

Dates et versions

hal-03120266 , version 1 (25-01-2021)

Identifiants

  • HAL Id : hal-03120266 , version 1

Citer

Philippe Balbiani. Undecidable problems for modal definability (Workshop 2017). Workshop on Topological Approaches in Epistemic Logic 2017, Oct 2017, Amsterdam, Netherlands. ⟨hal-03120266⟩
20 Consultations
0 Téléchargements

Partager

Gmail Facebook X LinkedIn More