Related papers: Binary intersection formalized
In this paper, we develop the theory of Jacobian rings of open complete intersections, which mean a pair $(X,Z)$ where $X$ is a smooth complete intersection in the projective space and and $Z$ is a simple normal crossing divisor in $X$…
In previous works, we have introduced the blown-up intersection cohomology and used it to extend Sullivan's minimal models theory to the framework of pseudomanifolds, and to give a positive answer to a conjecture of M. Goresky and W. Pardon…
A paper on ordinal partitions by Erd\H{o}s and Milner (1972) has been formalised using the proof assistant Isabelle/HOL, augmented with a library for Zermelo-Fraenkel set theory. The work is part of a project on formalising the partition…
We propose a modal study of the notion of bisimulation. Our contribution is threefold. First, we extend the basic modal language with a new modality $\nbi$, whose intended meaning is universal quantification over all states that are…
In this paper, we revisit foundations of umbral calculus using a straightforward approach based on an explicit matrix realization of binomial convolution. We construct an umbral duality of Wronskian type for rational curves in echelon form,…
Applicative bisimilarity is a coinductive characterisation of observational equivalence in call-by-name lambda-calculus, introduced by Abramsky (1990). Howe (1996) gave a direct proof that it is a congruence, and generalised the result to…
We study cohomology of morphisms of Lie-Yamaguti algebras. As an application, we establish that this cohomology `controls' the formal deformations. Additionally, we demonstrate its connection to the abelian extension of morphisms of…
This paper deals with three tools to compare proof-theoretic strength of formal arithmetical theories: interpretability, $\Pi^0_1$-conservativity and proving restricted consistency. It is well known that under certain conditions these three…
We show that several classical bilateral summation and transformation formulas have semi-finite forms. We obtain these semi-finite forms from unilateral summation and transformation formulas. Our method can be applied to derive Ramanujan's…
Whilst cooking is a very important human activity, there has been little consideration given to how we can formalize recipes for use in a reasoning framework. We address this need by proposing a graphical formalization that captures the…
We compare two henselisations of a residually discrete valuation domain. Our constructive proof that a certain natural morphism is an isomorphism is also a proof in classical mathematics. Although this isomorphism is implicitly accepted as…
In a category with enough limits and colimits, one can form the universal automorphism on an endomorphism in two dual senses. Sometimes these dual constructions coincide, as in the categories of finite sets, finite-dimensional vector…
A relational structure R is ultrahomogeneous if every isomorphism of finite induced substructures of R extends to an automorphism of R. We classify the ultrahomogeneous finite binary relational structures with one asymmetric binary relation…
Let X be a smooth complex algebraic variety. Morgan [Mor78] showed that the rational homotopy type of X is a formal consequence of the differential graded algebra defined by the first term of its weight spectral sequence. In the present…
In a previous paper we built a modified Hamiltonian formalism to make possible explicit maps among manifolds. In this paper the modified formalism was generalized. As an application, we have built maps among spaces associated to spinors, as…
Let X and Y be finite nilpotent CW complexes with dimension of X less than the connectivity of Y. Generalizing results of Vigu\'e-Poirrier and Yamaguchi, we prove that the mapping space Map(X,Y) is rationally formal if and only if Y has the…
This paper describes an algorithm for the compilation of a two (or more) level orthographic or phonological rule notation into finite state transducers. The notation is an alternative to the standard one deriving from Koskenniemi's work: it…
We present a definition of intersection homology for real algebraic varieties that is analogous to Goresky and MacPherson's original definition of intersection homology for complex varieties.
Union and intersection types are a staple of gradually typed language such as TypeScript. While it's long been recognized that union and intersection types are difficult to verify statically, it may appear at first that the dynamic part of…
Two finite words $u$ and $v$ are called Abelian equivalent if each letter occurs equally many times in both $u$ and $v$. The abelian closure $\mathcal{A}(\mathbf{x})$ of (the shift orbit closure of) an infinite word $\mathbf{x}$ is the set…