Andreu Ballus Santacana

2papers

2 Papers

14.4CTApr 26
From Copying to Corelations via Ancestry Partitions

Andreu Ballus Santacana

We study the free PROP $\mathrm{Syn}(δ)$ on a single binary generator $δ:1\to 2$. The ancestry functor $Π:\mathrm{Syn}(δ)\to \mathrm{FinCorel}$, defined by connected components of the underlying undirected string diagram, has image the sub-PROP $\mathrm{FinCorel}^{\circ}$ of finite corelations whose equivalence classes contain exactly one input and at least one output. The induced quotient [ \mathrm{AncQ}:=\mathrm{Syn}(δ)/\ker(Π) ] is equivalent as a PROP to $\mathrm{Cocom}$, the PROP for non-counital cocommutative comonoids. We then locate this primitive construction inside the standard cospan/corelation framework: $\mathrm{Cospan}(\mathcal B)$ realizes pushout-style gluing as a free hypergraph category; $\mathrm{Cospan}(\mathrm{FinSet})$ collapses under jointly epic corestriction to $\mathrm{FinCorel}$, the PROP for extraspecial commutative Frobenius monoids; and the Yoneda envelope [ \mathcal W=\mathrm{Fun}(\mathrm{FinCorel}^{op},\mathrm{Spc}) ] is a presheaf $\infty$-topos carrying the standard subobject, modality, and monotone fixed-point apparatus. The PROP-level identification $\mathrm{AncQ}\simeq \mathrm{Cocom}$ is the only result claimed as new; the remaining material is organizational and reduces explicitly to cited classical results.

LOMay 31, 2025
An Incremental Framework for Topological Dialogue Semantics: Efficient Reasoning in Discrete Spaces

Andreu Ballus Santacana

We present a tractable, incremental framework for topological dialogue semantics based on finite, discrete semantic spaces. Building on the intuition that utterances correspond to open sets and their combinatorial relations form a simplicial complex (the dialogue nerve), we give a rigorous foundation, a provably correct incremental algorithm for nerve updates, and a reference implementation in the Wolfram Language. The framework supports negative nerve computation (inconsistency tracking), consequence extraction, and a transparent, set-theoretic ranking of entailments. We clarify which combinatorial properties hold in the discrete case, provide motivating examples, and outline limitations and prospects for richer logical and categorical extensions.