Search

• < Previous
• 1
• Next >

On the Satisfiability of Local First-Order Logics with Data

We study first-order logic over unordered structures whose elements carry a finite number of data values from an infinite domain. Data values can be compared wrt.\ equality. As the satisfiability problem for this logic is undecidable in general, we introduce a family of local fragments. They&nbsp;[&hellip;]