Related papers: Formalizing equivalences without tears
Several large classes of homogeneous spaces are known to be formal---in the sense of Rational Homotopy Theory. However, it seems that far fewer examples of non-formal homogeneous spaces are known. In this article we provide several…
First-order logic is the basis for many knowledge representation formalisms and methods. Providing technological support for learning to write first-order formulas for natural language specifications requires methods to test formulas for…
Compositional minimisation can be an effective technique to reduce the state space explosion problem. This technique considers a parallel composition of several processes. In its simplest form, each sequential process is replaced by an…
These are classified by the direction of approximation (from above or below), the set family types (partition or covering) of simple functions, the coefficient signature (non-negative or signed), and cardinal number of terms of simple…
We develop a homotopical variant of the classic notion of an algebraic theory as a tool for producing deformations of homotopy theories. From this, we extract a framework for constructing and reasoning with obstruction theories and spectral…
In various provers and deductive verification tools, logical transformations are used extensively in order to reduce a proof task into a number of simpler tasks. Logical transformations are often part of the trusted base of such tools. In…
We verify a confluence result for the rewriting calculus of the linear category introduced in our previous paper. Together with the termination result proved therein, the generalized coherence theorem for linear category is established.…
Justification theory is a unifying framework for semantics of non-monotonic logics. It is built on the notion of a justification, which intuitively is a graph that explains the truth value of certain facts in a structure. Knowledge…
The visualization of argumentation frameworks (AFs) is crucial for enabling a wide applicability of argumentative tools. However, their visualization is often considered only as an accompanying part of tools for computing semantics and…
This document reports on the use of an algebraic, visual, formal approach to the specification of patterns for the formalization of the GoF design patterns. The approach is based on graphs, morphisms and operations from category theory and…
In the foundational logical framework of homotopy-type theory we discuss a natural formalization of secondary integral transforms in stable geometric homotopy theory. We observe that this yields a process of non-perturbative cohomological…
In this paper, we settle the homotopy properties of the infinity-morphisms of homotopy (bial)-gebras over properads, i.e. algebraic structures made up of operations with several inputs and outputs. We start by providing the literature with…
Many automatic theorem provers are restricted to untyped logics, and existing translations from typed logics are bulky or unsound. Recent research proposes monotonicity as a means to remove some clutter when translating monomorphic to…
To address the problem of 3D point matching where the poses of two point sets are unknown, we adapt a recently proposed path following based method to use similarity transformation instead of the original affine transformation. The reduced…
Our main theoretical result is that, if a simple polytope has a pair of complementary vertices (i.e., two vertices with no facets in common), then it has at least two such pairs, which can be chosen to be disjoint. Using this result, we…
In this paper we prove a general homogenization result for monotone parabolic problems with an arbitrary number of microscopic scales in space as well as in time, where the scale functions are not necessarily powers of epsilon. The main…
Word-representable graphs, which are the same as semi-transitively orientable graphs, generalize several fundamental classes of graphs. In this paper we propose a novel approach to study word-representability of graphs using a technique of…
We combine Homotopy Type Theory with axiomatic cohesion, expressing the latter internally with a version of "adjoint logic" in which the discretization and codiscretization modalities are characterized using a judgmental formalism of "crisp…
Matching Logic is a framework for specifying programming language semantics and reasoning about programs. Its formulas are called patterns and are built with variables, symbols, connectives and quantifiers. A pattern is a combination of…
We show that if a complex has free finitely generated reduced homology groups for two consecutive dimensions and trivial homology for all other dimensions, then it must have the homotopy type of a wedge of spheres of two consecutive…