Related papers: Predicate Transformers, (co)Monads and Resolutions
Motivated by questions like: which spatial structures may be characterized by means of modal logic, what is the logic of space, how to encode in modal logic different geometric relations, topological logic provides a framework for studying…
Earlier an arbitrary poset $P$ was proved to be isomorphic to the collection of subsets of a space $M$ with two closures which are closed in the first closure and open in the other. As a space $M$ for this representation an algebraic dual…
We analyse the complexity of the satisfiability problem, or similarly feasibility problem, (trSAT) for transformer encoders (TE), which naturally occurs in formal verification or interpretation, collectively referred to as formal reasoning.…
As part of the author's studies on equational reasoning for monadic programs, this report focus on non-determinism monad. We discuss what properties this monad should satisfy, what additional operators and notations can be introduced to…
We study word structures of the form $(D,<,P)$ where $D$ is either $\mathbb{N}$ or $\mathbb{Z}$, $<$ is the natural linear ordering on $D$ and $P\subseteq D$ is a predicate on $D$. In particular we show: (a) The set of recursive…
In this paper we prove a few propositions concerning factorizations of morphisms in pro categories, the most important of which solves an open problem of Isaksen concerning the existence of certain types of functorial factorizations. On our…
Selective rationalization has become a common mechanism to ensure that predictive models reveal how they use any available features. The selection may be soft or hard, and identifies a subset of input features relevant for prediction. The…
In this paper we address the problem of generating all elements obtained by the saturation of an initial set by some operations. More precisely, we prove that we can generate the closure by polymorphisms of a boolean relation with a…
The algebraic theory of third-order tensors under the $t$-product is naturally formulated over the complex field via Fourier block diagonalization. However, many applications require real-valued representations. In this paper, we…
We define a notion of colimit for diagrams in a motivic category indexed by a presheaf of spaces (e.g. an \'etale classifying space), and we study basic properties of this construction. As a case study, we construct the motivic analogs of…
These are notes from an informal mini-course on factorization homology, infinity-categories, and topological field theories. The target audience was imagined to be graduate students who are not homotopy theorists.
It is proved recently by Benamara-Nikolski that a contraction having finite defects and spectrum not filling in the closed unit disc, is similar to a normal operator if and only if it has the so-called linear resolvent growth property. We…
A sharp bound is obtained for the number of ways to express the monomial $X^n$ as a product of linear factors over $\mathbb{Z}/p^{\alpha}\mathbb{Z}$. The proof relies on an induction-on-scale procedure which is used to estimate the number…
We introduce basic notions and results about relation liftings on categories enriched in a commutative quantale. We derive two necessary and sufficient conditions for a 2-functor T to admit a functorial relation lifting: one is the…
Polynomial functors are a categorical generalization of the usual notion of polynomial, which has found many applications in higher categories and type theory: those are generated by polynomials consisting a set of monomials built from sets…
In this paper, we give precise mathematical form to the idea of a structure whose data and axioms are faithfully represented by a graphical calculus; some prominent examples are operads, polycategories, properads, and PROPs. Building on the…
We define a notion of general uniform interpolant, generalizing the notions of cover and of uniform interpolant and identify situations in which symbol elimination can be used for computing general uniform interpolants. We investigate the…
We show that algebraic formulas and constant-depth circuits are closed under taking factors. In other words, we show that if a multivariate polynomial over a field of characteristic zero has a small constant-depth circuit or formula, then…
We generalise the termination method of higher-order polynomial interpretations to a setting with impredicative polymorphism. Instead of using weakly monotonic functionals, we interpret terms in a suitable extension of System F-omega. This…
None of the first-order modal logics between $\mathsf{K}$ and $\mathsf{S5}$ under the constant domain semantics enjoys Craig interpolation or projective Beth definability, even in the language restricted to a single individual variable. It…