Related papers: Order-Invariant Types and Their Applications
The axiomatic theory of ordinary differential equations, owing to its simplicity, can provide a useful framework to describe various generalizations of dynamical systems. In this study, we consider how dynamical properties can be…
Martin-L\"of's Intuitionistic Theory of Types is becoming popular for formal reasoning about computer programs. To handle recursion schemes other than primitive recursion, a theory of well-founded relations is presented. Using primitive…
The infinite random size-biased order with arbitrary positive size parameters is introduced in terms of independent exponential random variables. We collect basic properties and constructions of the order, some of which belong to the…
We introduce some notions of invariant elementary definability which extend the notions of first-order order-invariant definability, and, more generally, definability invariant with respect to arbitrary numerical relations. In particular,…
Considering a linearly ordered set, we introduce its symmetric version, and endow it with two operations extending supremum and infimum, so as to obtain an algebraic structure close to a commutative ring. We show that imposing symmetry…
Courcelle's celebrated theorem states that all MSO-expressible properties can be decided in linear time on graphs of bounded treewidth. Unfortunately, the hidden constant implied by this theorem is a tower of exponentials whose height…
Permutations can be viewed as pairs of linear orders, or more formally as models over a signature consisting of two binary relation symbols. This approach was adopted by Albert, Bouvel and F\'eray, who studied the expressibility of…
We introduce a homotopy-theoretic interpretation of intuitionistic first-order logic based on ideas from Homotopy Type Theory. We provide a categorical formulation of this interpretation using the framework of Grothendieck fibrations. We…
Sharing of notations and theories across an inheritance hierarchy of mathematical structures, e.g., groups and rings, is important for productivity when formalizing mathematics in proof assistants. The packed classes methodology is a…
The purpose of this article is to delve into the properties of invariants. The properties, explained in [2], reveal new ways to develop algorithms that allow us to test the primality of a number. In this article, some of these are shown,…
We define the continuous modeling property for first-order structures and show that a first-order structure has the continuous modelling property if and only if its age has the embedding Ramsey property. We use generalized indiscernible…
In a recent paper on exotic crossed products, we included a lemma concerning ideals of the Fourier-Stieltjes algebra. Buss, Echterhoff, and Willett have pointed out to us that our proof of this lemma contains an error. In fact, it remains…
Ordinal pattern dependence has been introduced in order to capture co-monotonic behavior between two time series. This concept has several features one would intuitively demand from a dependence measure. It was believed that ordinal pattern…
The first part of this work constructs positive-genus real Gromov-Witten invariants of real-orientable symplectic manifolds of odd "complex" dimensions; the present part focuses on their properties that are essential for actually working…
In this study, we define interaction components of different orders between two input variables based on game theory. We further prove that interaction components of different orders satisfy several desirable properties.
We interpret homogenousness as a second order property and base it on the same principle as nonmonotonic logic: there might be a small set of exceptions. We use this idea to analyse fundamental questions about defeasible inheritance…
We introduce MTT, a dependent type theory which supports multiple modalities. MTT is parametrized by a mode theory which specifies a collection of modes, modalities, and transformations between them. We show that different choices of mode…
We show that the model-checking problem for successor-invariant first-order logic is fixed-parameter tractable on graphs with excluded topological subgraphs when parameterised by both the size of the input formula and the size of the…
In this series of papers, we propose a theory of enumerative invariants counting self-dual objects in self-dual categories. Ordinary enumerative invariants in abelian categories can be seen as invariants for the structure group $\mathrm{GL}…
In this paper we study the right differentiability of a parametric infimum function over a parametric set defined by equality constraints. We present a new theorem with sufficient conditions for the right differentiability with respect to…