arXiv subjects

Marco Abbadini

Publications and source records attributed to Marco Abbadini.

At least 19 recordsLinked to original sources

arXiv2026

SysComb: Fine-Grained Transparent System Call Filtering for Attack Surface Reduction

Restricting the system calls available to applications shrinks the kernel's attack surface and greatly mitigates the impact of compromised programs. Recent approaches showcase techniques to generate system call filters, however, all existing solutions require either kernel or application modifications to activate them at runtime. This is intrusive, error-prone, and often impractical, especially when the code is maintained by external parties. This paper presents SysComb, a novel eBPF-based solution to enforce temporally-specialized system call filters based on the application state, without requiring any modification to the application or the kernel code, and thus addressing the above limitations. Moreover, SysComb lets the developer choose between two distinct enforcement strategies: seccomp-like, ensuring no new privileges are gained after a state transition is performed, and least-privilege, which applies to each state the most restrictive filter. We evaluated SysComb using widely used software, showcasing accurate state-aware system call filtering and an overhead comparable to built-in kernel solutions, demonstrating the practicality of our approach.

cs.CR↗

arXiv2026

Formal squares over the unit square separate FS-domains from RB-domains

Every RB-domain is an FS-domain. Whether the converse holds was a long-standing open problem. We prove that the domain of closed axis-parallel squares in the plane whose centres lie in the unit square $[0,1]^2$, with the whole plane adjoined and ordered by reverse inclusion, is an FS-domain but not an RB-domain. The proof is quantitative. A finite-grid argument first shows that, on every finite slab $[0,1]^2\times[0,m]$, for every approximate identity and every $\varepsilon>0$, one member of the approximate identity has radius excess (i.e., the output radius minus the input radius) uniformly at most $\varepsilon$. By contrast, for every deflation and every $m>0$, the radius excess is at least $m/(4m+1)$ at some point of the slab $[0,1]^2\times[0,m]$. This solution was obtained independently of the recent work of Chen, Kou, and Lyu and uses a different method.

math.GN↗

arXiv2026

A topological proof that compact Hausdorff spaces are not finitely co-concrete

Lieberman, Rosick\'y, and Vasey proved that $\mathbf{CompHaus}^{\mathrm{op}}$ - the opposite of the category of compact Hausdorff spaces - is not finitely concrete by a route through Hilbert and Banach spaces, commutative unital $C^*$-algebras, and Gelfand duality. We give a short topological proof. Moreover, we strengthen the result by identifying a specific sequential colimit in $\mathbf{CompHaus}^{\mathrm{op}}$ that no faithful set-valued functor preserves.

math.CT↗

arXiv2026

The doctrinal G\"odel's completeness theorem and the type space functor

We give a self-contained proof of G\"odel's completeness theorem entirely within the formalism of first-order Boolean doctrines (an algebraic approach to classical many-sorted first-order logic). Moreover, we show that G\"odel's completeness theorem entails that the fiberwise Stone dual of a first-order Boolean doctrine is its type space functor; roughly speaking, this means that the Stone dual of the Boolean algebra of formulas in context $X$ is the Stone space of $X$-pointed models modulo elementary equivalence.

math.LO↗

arXiv2026

On the Beck--Chevalley condition

Boolean hyperdoctrines provide an algebraic semantics for classical first-order logic with equality. In the definition of a Boolean hyperdoctrine, the Beck--Chevalley condition captures the commutativity of substitutions with quantifiers and with equality. Often, a generalization of these conditions is considered, which requires the commutativity of an appropriate square for every pullback square in the base category. A Boolean hyperdoctrine satisfying this condition is called full. Our contribution is twofold. On the negative side, we exhibit a non-full Boolean hyperdoctrine. On the positive side, we show that every Boolean hyperdoctrine $\mathsf{FinSet} \to \mathsf{BA}$ over $\mathsf{FinSet}^{\mathrm{op}}$ is full.

math.CT↗

arXiv2026

A topos for \'etale-finite Heyting algebras

A longstanding open problem is whether every Heyting algebra is the lattice of truth values (i.e., of subterminal objects) of some elementary topos. A positive answer is known for complete Heyting algebras (i.e., locales) via sheaves, and for Boolean algebras via a construction due to Peter Freyd. We extend Freyd's construction to all \'etale-finite Heyting algebras, in the sense of Evgeny Kuznetsov. These are the Heyting algebras satisfying a generalisation of the law of excluded middle relative to some finite Heyting subalgebra. For every \'etale-finite Heyting algebra $H$, we use Esakia duality to construct an elementary topos whose lattice of truth values is isomorphic to $H$, thereby extending the class of Heyting algebras for which a positive answer to the Heyting-to-topos problem is known. The toposes we construct are categories of certain compact \'etale spaces. As a consequence, they are finitely propositional: every object has a finite cover by subterminal objects. We show that a Heyting algebra occurs as the lattice of truth values of some finitely propositional topos if and only if it is \'etale-finite. This exhibits an obstruction to extending the use of compact \'etale spaces beyond the \'etale-finite case.

math.LO↗

arXiv2025

Freely adding one layer of quantifiers to a Boolean doctrine

We describe the layer of quantifier alternation depth at most one of the quantifier completion of a Boolean doctrine over a small category. This amounts to a doctrinal version of Herbrand's theorem for formulas with quantifier alternation depth at most one modulo a universal theory. The resulting construction satisfies a universal property that makes it the free QA-one-step Boolean doctrine. To achieve this version of Herbrand's theorem, we characterize, within the doctrinal setting, the classes $A$ of quantifier-free formulas for which there is a model $M$ such that $A$ is precisely the class of formulas whose universal closure is valid in $M$.

math.LO↗

arXiv2025

Unital Specker $\ell$-groups and boolean multispaces

As a topological generalization of the notion of a multiset, a boolean multispace is a boolean space $X$ with a continuous function $u\colon X\to \mathbb Z_{>0}$, where $\mathbb Z_{>0}=\{1,2,\dots\}$ has the discrete topology. In this paper the category of boolean multispaces and continuous multiplicity-decreasing morphisms with respect to the divisibility order is shown to be dually equivalent to the category of unital Specker $\ell$-groups and unital $\ell$-homomorphisms. This result extends Stone duality, because unital Specker $\ell$-groups whose distinguished unit is singular are equivalent to boolean algebras. Boolean multispaces, in turn, are categorically equivalent to the Priestley duals of the MV-algebras corresponding to unital Specker $\ell$-groups via the $\Gamma$ functor. Via duality, we show that the category of unital Specker $\ell$-groups has finite colimits and finite products, but lacks some countable copowers and equalizers.

math.LO↗

arXiv2025

On the symmetry behind duality

Dualities such as Stone duality and the duality between sober spaces and spatial frames hinge on an interaction between open sets and compact saturated sets. In several important classes of spaces-Stone spaces, spectral spaces, and stably compact spaces-this interaction forms a perfect symmetry, reflected dually as order self-duality. But the class of sober spaces, despite being central to Stone-like dualities, exhibits only a partial symmetry between openness and compactness. This raises a central question: can we enlarge the setting enough to recover a perfect symmetry, while still retaining sober spaces and preserving the conditions that make the sober-spatial-frame duality work? We answer this question affirmatively. We introduce ko-spaces, whose families of open and compact saturated sets satisfy the compatibility needed for duality, and bi-dcpos, a pointfree companion generalizing both spatial frames and continuous domains. We prove that the categories of ko-spaces and distributive bi-dcpos are equivalent (and dually equivalent, too), and that each category carries a symmetry in the form of a self-duality. On spaces, this extends de Groot duality; on domains, it extends Lawson duality. Classical results fall out as special cases: the sober-spatial-frame duality reappears inside our symmetric framework, and continuous domains acquire a presentation akin to that of d-frames. Our work suggests that an appropriate home for Stone-like duality is a fully symmetric two-sorted world in which openness and compactness play on equal footing.

math.LO↗

arXiv2025

The unification type of Lukasiewicz logic with a bounded number of variables

Building on the correspondence between finitely axiomatised theories in Łukasieiwcz logic and rational polyhedra, we prove that the unification type of the fragment of Łukasiewicz logic with $n\geq 2$ variables is nullary. This solves a problem left open in [V. Marra and L. Spada. Ann. Pure Appl. Logic 164 2013, p. 192-210]. Furthermore, we refine the study of unification with bounds on the number of variables. Our proposal distinguishes the number $m$ of variables allowed in the problem and the number $n$ in the solution. We prove that the unification type of Łukasiewicz logic for all $m,n \geq 2$ is nullary.

math.LO↗

arXiv2025

On the lack of colimits in various categories arising in pointfree topology and algebraic logic

We prove that the category of McKinsey-Tarski algebras is not equivalent to a variety of algebras, thus answering a question of Peter Jipsen in the negative. More generally, we show that various categories of BAOs (boolean algebras with an operator), Heyting algebras, and frames with appropriate morphisms between them are not cocomplete. As a consequence, none of these categories is equivalent to a prevariety, let alone a variety.

math.LO↗

arXiv2025

Duality for finitely valued algebras

The theory of natural dualities provides a well-developed framework for studying Stone-like dualities induced by an algebra $\mathbf{L}$ which acts as a dualizing object when equipped with suitable topological and relational structure. The development of this theory has, however, largely remained restricted to the case where $\mathbf{L}$ is finite. Motivated by the desire to provide a universal algebraic formulation of the existing duality of Cignoli and Marra or locally weakly finite MV-algebras and to extend it to a corresponding class of positive MV-algebras, in this paper we investigate Stone-like dualities where the algebra $\mathbf{L}$ is allowed to be infinite. This requires restricting our attention from the whole prevariety generated by $\mathbf{L}$ to the subclass of algebras representable as algebras of $\mathbf{L}$-valued functions of finite range, a distinction that does not arise in the case of finite $\mathbf{L}$. Provided some requirements on $\mathbf{L}$ are met, our main result establishes a categorical duality for this class of algebras, which covers the above cases of MV-algebras and positive MV-algebras.

math.LO↗

arXiv2025

Varieties of MV-monoids and positive MV-algebras

MV-monoids are algebras $\langle A,\vee,\wedge, \oplus,\odot, 0,1\rangle$ where $\langle A, \vee, \wedge, 0, 1\rangle$ is a bounded distributive lattice, both $\langle A, \oplus, 0 \rangle$ and $\langle A, \odot, 1\rangle$ are commutative monoids, and some further connecting axioms are satisfied. Every MV-algebra in the signature $\{\oplus,\neg,0\}$ is term equivalent to an algebra that has an MV-monoid as a reduct, by defining, as standard, $1:= \neg 0$, $x \odot y := \neg(\neg x \oplus\neg y)$, $x \vee y := (x \odot \neg y) \oplus y$ and $x \wedge y := \neg(\neg x \vee \neg y)$. Particular examples of MV-monoids are positive MV-algebras, i.e. the $\{\vee, \wedge, \oplus, \odot, 0, 1\}$-subreducts of MV-algebras. Positive MV-algebras form a peculiar quasivariety in the sense that, albeit having a logical motivation (being the quasivariety of subreducts of MV-algebras), it is not the equivalent quasivariety semantics of any logic. In this paper, we study the lattices of subvarieties of MV-monoids and of positive MV-algebras. In particular, we characterize and axiomatize all almost minimal varieties of MV-monoids, we characterize the finite subdirectly irreducible positive MV-algebras, and we characterize and axiomatize all varieties of positive MV-algebras.

math.RA↗

arXiv2025

Quantifier-free formulas and quantifier alternation depth in doctrines

This paper aims to incorporate the notion of quantifier-free formulas modulo a first-order theory and the stratification of formulas by quantifier alternation depth modulo a first-order theory into the algebraic treatment of classical first-order logic. The set of quantifier-free formulas modulo a theory is axiomatized by what we call a quantifier-free fragment of a Boolean doctrine with quantifiers. Rather than being an intrinsic notion, a quantifier-free fragment is an additional structure on a Boolean doctrine with quantifiers. Under a smallness assumption, the structures occurring as quantifier-free fragments of some Boolean doctrine with quantifiers are precisely the Boolean doctrines (without quantifiers). In particular, every Boolean doctrine over a small category is a quantifier-free fragment of its quantifier completion. Furthermore, the sequences obtained by stratifying an algebra of formulas by quantifier alternation depth modulo a theory are axiomatized by what we call QA-stratified Boolean doctrines. While quantifier-free fragments are defined in relation to an "ambient" Boolean doctrine with quantifiers, a QA-stratified Boolean doctrine requires no such ambient doctrine, and it consists of a sequence of Boolean doctrines (without quantifiers) with connecting axioms. QA-stratified Boolean doctrines are in one-to-one correspondence with pairs consisting of a Boolean doctrine with quantifiers and a quantifier-free fragment of it.

math.LO↗

arXiv2025

A generalization of de Vries duality to closed relations between compact Hausdorff spaces

Stone duality generalizes to an equivalence between the categories $\mathsf{Stone}^{\mathsf{R}}$ of Stone spaces and closed relations and $\mathsf{BA}^\mathsf{S}$ of boolean algebras and subordination relations. Splitting equivalences in $\mathsf{Stone}^{\mathsf{R}}$ yields a category that is equivalent to the category $\mathsf{KHaus}^\mathsf{R}$ of compact Hausdorff spaces and closed relations. Similarly, splitting equivalences in $\mathsf{BA}^\mathsf{S}$ yields a category that is equivalent to the category $\mathsf{DeV^S}$ of de Vries algebras and compatible subordination relations. Applying the machinery of allegories then yields that $\mathsf{KHaus}^\mathsf{R}$ is equivalent to $\mathsf{DeV^S}$, thus resolving a problem recently raised in the literature. The equivalence between $\mathsf{KHaus}^\mathsf{R}$ and $\mathsf{DeV^S}$ further restricts to an equivalence between the category ${\mathsf{KHaus}}$ of compact Hausdorff spaces and continuous functions and the wide subcategory $\mathsf{DeV^F}$ of $\mathsf{DeV^S}$ whose morphisms satisfy additional conditions. This yields an alternative to de Vries duality. One advantage of this approach is that composition of morphisms is usual relation composition.

math.GN↗

arXiv2025

Barr-coexactness for metric compact Hausdorff spaces

Compact metric spaces form an important class of metric spaces, but the category that they define lacks many important properties such as completeness and cocompleteness. In recent studies of "metric domain theory" and Stone-type dualities, the more general notion of a (separated) metric compact Hausdorff space emerged as a metric counterpart of Nachbin's compact ordered spaces. Roughly speaking, a metric compact Hausdorff space is a metric space equipped with a \emph{compatible} compact Hausdorff topology (which does not need to be the induced topology). These spaces maintain many important features of compact metric spaces, and, notably, the resulting category is much better behaved. Moreover, one can use inspiration from the theory of Nachbin's compact ordered spaces to solve problems for metric structures. In this paper we continue this line of research: in the category of separated metric compact Hausdorff spaces we characterise the regular monomorphisms as the embeddings and the epimorphisms as the surjective morphisms. Moreover, we show that epimorphisms out of an object $X$ can be encoded internally on $X$ by their kernel metrics, which are characterised as the continuous metrics below the metric on $X$; this gives a convenient way to represent quotient objects. Finally, as the main result, we prove that its dual category has an algebraic flavour: it is Barr-exact. While we show that it cannot be a variety of finitary algebras, it remains open whether it is an infinitary variety.

math.CT↗

arXiv2025

On the axiomatisability of the dual of compact ordered spaces

We prove that the category of Nachbin's compact ordered spaces and order-preserving continuous maps between them is dually equivalent to a variety of algebras, with operations of at most countable arity. Furthermore, we show that the countable bound on the arity is the best possible: the category of compact ordered spaces is not dually equivalent to any variety of finitary algebras. Indeed, the following stronger results hold: the category of compact ordered spaces is not dually equivalent to (i) any finitely accessible category, (ii) any first-order definable class of structures, (iii) any class of finitary algebras closed under products and subalgebras. An explicit equational axiomatisation of the dual of the category of compact ordered spaces is obtained; in fact, we provide a finite one, meaning that our description uses only finitely many function symbols and finitely many equational axioms. In preparation for the latter result, we establish a generalisation of a celebrated theorem by D. Mundici: our result asserts that the category of unital commutative distributive lattice-ordered monoids is equivalent to the category of what we call MV-monoidal algebras. Our proof is independent of Mundici's theorem.

math.CT↗

arXiv2024

Stone-Gelfand duality for metrically complete lattice-ordered groups

We extend Yosida's 1941 version of Stone-Gelfand duality to metrically complete unital lattice-ordered groups that are no longer required to be real vector spaces. This calls for a generalised notion of compact Hausdorff space whose points carry an arithmetic character to be preserved by continuous maps. The arithmetic character of a point is (the complete isomorphism invariant of) a metrically complete additive subgroup of the real numbers containing $1$, namely, either $\frac{1}{n}\mathbb{Z}$ for an integer $n = 1, 2, \dots$, or the whole of $\mathbb{R}$. The main result needed to establish the extended duality theorem is a substantial generalisation of Urysohn's Lemma to such "arithmetic" compact Hausdorff spaces. The original duality is obtained by considering the full subcategory of spaces whose each point is assigned the entire group of real numbers. In the introduction we indicate motivations from and connections with the theory of dimension groups.

math.FA↗