Search arXivSearch

arXiv · 2606.24909

Closure Atlases and Local-to-Global Obstructions in Finite Closure Systems

Abstract

This paper studies finite closure operators on overlapping finite universes and gives an exact local-to-global obstruction criterion for conservative globalization. Given a finite family of local closure systems, its atlas-generated closure is obtained by repeatedly applying the local closure operators to the parts visible in each chart. This closure is the least global closure operator extending all chart closures. A chart-visible obstruction is a consequence produced by this global propagation that lies inside a chart but is not validated by that chart's own closure operator. The main theorem proves that a finite closure atlas has a global conservative realization exactly when no such obstruction occurs; in that case the atlas-generated closure itself is the conservative realization. The obstruction condition is finite and directly computable. The paper also records the indexed representation layer motivating the terminology. For a finite closure system, an indexed truth space selects closed theories as contexts and represents each element by the region of selected closed theories containing it. Closure consequence is always sound for region inclusion, and the full indexed space of all closed theories recovers the original closure consequence exactly; reduced indexed spaces can therefore create spurious region consequences by deleting separating closed theories. A formal opposite gives a four-region membership decomposition - only one, only the other, both, and neither - unless additional separation assumptions are imposed. Finally, overlap-compatible local closed theories glue by canonical union under the atlas-generated closure. The framework is finite, structural, and closure-theoretic; the logical terminology is used only as an interpretation of the underlying closure data.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Jaehwan Kim. 2026-06-19. Closure Atlases and Local-to-Global Obstructions in Finite Closure Systems. https://arxiv.org/abs/2606.24909

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

A Probabilistic Choreography Language for PRISM

We present a choreographic framework for modelling and analysing concurrent probabilistic systems based on the PRISM model-checker. This is achieved through the development of a choreography language, which is a specification language that allows to describe the desired interactions within a concurrent system from a global viewpoint. Using choreographies gives a clear and complete view of system interactions, making it easier to understand the process flow and identify potential errors, which helps ensure correct execution and improves system reliability. We equip our language with a probabilistic semantics and then define a formal encoding into the PRISM language and discuss its correctness. Properties of programs written in our choreographic language can be model-checked by the PRISM model-checker via their translation into the PRISM language. Finally, we implement a compiler for our language and demonstrate its practical applicability via examples drawn from the use cases featured in the PRISM website.

cs.LO

Monotone weak distributive laws over the lifted powerset monad in categories of algebras

Noticing the similarity between the monotone weak distributive laws combining two layers of nondeterminism in sets and in compact Hausdorff spaces, we study whether the latter law can be obtained automatically as a weak lifting of the former. This holds partially, but does not generalize to other categories of algebras: we then characterize when exactly monotone weak distributive laws over powerset monads in categories of algebras exist, exhibiting a law combining probabilities and non-determinism in compact Hausdorff spaces and showing on the other hand that such laws do not exist in a lot of other cases.

cs.LO

Identifying and Explaining (Non-)Equivalence of First-Order Logic Formulas

First-order logic is the basis for many knowledge representation formalisms and methods. Providing technological support for learning to write first-order formulas for natural language specifications requires methods to test formulas for (non-)equivalence and to provide explanations for non-equivalence. We propose such methods based on both theoretical insights and existing tools, implement them, and report on experiments testing their effectiveness on a large educational data set with > 100,000 pairs of first-order formulas.

cs.LO