On the satisfiability of local first-order logics with data

DOI10.46298/LMCS-20(3:1)2024MaRDI QIDQ6597951zbMATH OpenFDO

Authors Benedikt Bollig, Arnaud Sangnier

Publication date 4 September 2024

Published in Logical Methods in Computer Science (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.46298/LMCS-20(3:1)2024

zbMATH Keywords

first order logic with datasatisfiability problem

Mathematics Subject Classification ID

Logic in computer science (03B70) Computer science (68-XX)

Cites work

• A Note on C² Interpreted over Finite Data-Words
• An automata-theoretic approach to the verification of distributed algorithms
• An optimal construction of Hanf sentences
• Automata and Logics for Words and Trees over an Infinite Alphabet
• Computer Science Logic
• Decidability of parameterized verification
• Distributed algorithms. An intuitive approach
• Elements of finite model theory.
• Extending two-variable logic on data trees with order on data values and its automata
• First-order logic with two variables and unary temporal logic
• scientific article; zbMATH DE number 996442 (Why is no real title available?)
• scientific article; zbMATH DE number 3266604 (Why is no real title available?)
• scientific article; zbMATH DE number 965572 (Why is no real title available?)
• scientific article; zbMATH DE number 7799617 (Why is no real title available?)
• Hybrid logic and its proof-theory
• Identifiers in registers. Describing network algorithms with logic
• Keeping a crowd safe: on the complexity of parameterized verification (invited talk)
• Logical locality entails frugal distributed computation over graphs (extended abstract)
• On Reasoning About Rings
• On the existential fragments of local first-order logics with data
• Ordered navigation on multi-attributed data words
• Shuffle Expressions and Words with Nested Data
• Temporal logics on words with multiple data values
• The complexity of hybrid logics over equivalence relations
• Two variable first-order logic over ordered domains
• Two-variable first-order logic with equivalence closure
• Two-variable logic on 2-dimensional structures
• Two-variable logic on data trees and XML reasoning
• Two-variable logic on data words
• Undecidability of some simple formalized theories
• What you always wanted to know about model checking of fault-tolerant distributed algorithms

This page was built for publication: On the satisfiability of local first-order logics with data

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6597951)