A nesting-free normal form for nested conditions in finite lattices of subgraphs
Category Theory
2026-03-26 v2 Logic in Computer Science
Abstract
We present a nesting-free normal form for the formalism of nested conditions and constraints in the context of finite lattices of subgraphs.
Cite
@article{arxiv.2601.18376,
title = {A nesting-free normal form for nested conditions in finite lattices of subgraphs},
author = {Jens Kosiol and Steffen Zschaler},
journal= {arXiv preprint arXiv:2601.18376},
year = {2026}
}
Comments
22 pages, includes proofs, improved presentation compared to v. 1