Local First-Order Logic with Two Data Values - Archive ouverte HAL Access content directly
Conference Papers Year : 2021

Local First-Order Logic with Two Data Values

Abstract

We study first-order logic over unordered structures whose elements carry two data values from an infinite domain. Data values can be compared wrt. equality so that the formalism is suitable to specify the input-output behavior of various distributed algorithms. As the logic is undecidable in general, we introduce a family of local fragments that restrict quantification to neighborhoods of a given reference point. Our main result establishes decidability of the satisfiability problem for one of these non-trivial local fragments. On the other hand, already slightly more general local logics turn out to be undecidable. Altogether, we draw a landscape of formalisms that are suitable for the specification of systems with data and open up new avenues for future research.
Fichier principal
Vignette du fichier
fsttcs-2021.pdf (745.57 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-03353214 , version 1 (16-12-2021)

Identifiers

  • HAL Id : hal-03353214 , version 1

Cite

Benedikt Bollig, Arnaud Sangnier, Olivier Stietel. Local First-Order Logic with Two Data Values. 41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2021), Dec 2021, Goa, India. pp.39:1-39:15. ⟨hal-03353214⟩
157 View
61 Download

Share

Gmail Facebook X LinkedIn More