Preservation theorems hold for all lattice semirings but fail for tropical, Viterbi, Łukasiewicz, and natural semirings, while existential preservation holds on finite interpretations for lattices unlike the Boolean case.
Elements of Finite Model Theory
4 Pith papers cite this work, alongside 442 external citations. Polarity classification is still indexing.
4
Pith papers citing it
442
external citations · Crossref
citation-role summary
background 1
citation-polarity summary
verdicts
UNVERDICTED 4roles
background 1polarities
background 1representative citing papers
Parameterized concurrent program safety over topologies reduces to complete local compositional proofs via universally quantified inductive invariants.
Model checking for low-monodimensionality fragments of CMSO with disjoint-paths predicate is FPT on topological-minor-free graph classes.
Monadic fixed-point logic with counting is proposed as a natural specification language for properties on improvement graphs in social choice and games, with an efficient model checking algorithm whose complexity depends on graph size.
citing papers explorer
-
Preservation Theorems in Semiring Semantics
Preservation theorems hold for all lattice semirings but fail for tropical, Viterbi, Łukasiewicz, and natural semirings, while existential preservation holds on finite interpretations for lattices unlike the Boolean case.
-
Complete Local Reasoning About Parameterized Programs Over Topologies
Parameterized concurrent program safety over topologies reduces to complete local compositional proofs via universally quantified inductive invariants.
-
Model Checking for Low Monodimensionality Fragments of CMSO on Topological-Minor-Free Graph Classes
Model checking for low-monodimensionality fragments of CMSO with disjoint-paths predicate is FPT on topological-minor-free graph classes.
-
Reasoning about Social Choice and Games in Monadic Fixed-Point Logic
Monadic fixed-point logic with counting is proposed as a natural specification language for properties on improvement graphs in social choice and games, with an efficient model checking algorithm whose complexity depends on graph size.