Definability Over the Class of all Partitions

Definability Over the Class of all Partitions

This study is devoted to exploring modal definability of first-order sentences and first-order definability of modal formulas. It investigates the decidability and the complexity of these problems within the class of all partitions.

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Journal of logic and computation 2006-10, Vol.16 (5), p.541-557
Hauptverfasser: Balbiani, Philippe, Tinchev, Tinko
Format: Artikel
Sprache:eng
Schlagworte:
Computer Science
Logic in Computer Science
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:This study is devoted to exploring modal definability of first-order sentences and first-order definability of modal formulas. It investigates the decidability and the complexity of these problems within the class of all partitions.
ISSN:0955-792X
1465-363X
DOI:10.1093/logcom/exl024