Related papers: Further Formalization of the Process Algebra CCS i…

In order to reason about the behaviour of programs described in a programming language, a mathematically rigorous definition of that language is needed. In this paper, we present a machine-checked formalisation of concurrent Core Erlang (a…

An operad describes a category of algebras and a (co)homology theory for these algebras may be formulated using the homological algebra of operads. A morphism of operads $f:\mathcal{O}\rightarrow\mathcal{P}$ describes a functor allowing a…

This paper describes a large set of related theorem proving problems obtained by translating theorems from the HOL4 standard library into multiple logical formalisms. The formalisms are in higher-order logic (with and without type…

We show that the so-called "post-Born" effects of weak lensing at 4th order are equivalent to lens-lens couplings in the Born Approximation. We demonstrate this by explicitly showing the equivalence of the canonical weak lensing approach at…

Cause-consequence Diagram (CCD) is widely used as a deductive safety analysis technique for decision-making at the critical-system design stage. This approach models the causes of subsystem failures in a highly-critical system and their…

Many practical engineering systems and their components have multiple performance levels and failure modes. If these systems form a monotonically increasing structure function (system model) with respect to the performance of their…

We prove cocontinuity of the $\max$-tensor product of C*-categories and develop a framework to perform factorization homology in a C*-setting. In such context, we specialize some results of D. Ben-Zvi, A. Brochier and D. Jordan. As a…

Let $N>1$ be an integer, and let $\Gamma = \Gamma_0 (N) \subset \SL_4 (\Z)$ be the subgroup of matrices with bottom row congruent to $(0,0,0,*)\mod N$. We compute $H^5 (\Gamma; \C) $ for a range of $N$, and compute the action of some Hecke…

To advance our log Hodge theory, we introduce log real analytic functions and log $C^{\infty}$ functions, define how to integrate them, and prove the log Poincar\'e lemma. We give better understandings of the degeneration of Hodge…

We give an axiomatisation of strong bisimilarity on a small fragment of CCS that does not feature the sum operator. This axiomatisation is then used to derive congruence of strong bisimilarity in the finite pi-calculus in absence of sum. To…

Despite the conceptual simplicity of sequential consistency (SC), the semantics of SC atomic operations and fences in the C11 and OpenCL memory models is subtle, leading to convoluted prose descriptions that translate to complex axiomatic…

This thesis is divided into two parts. In the first part we study completely integrable systems, and their underlying structures, in detail. We study their deformation theory and the different equivalence relations surrounding it. We…

We investigate the complexity of isomorphism relations for classes of finitely generated and n-generated computably enumerable (c.e.) algebras, presented via c.e. presentations -- that is, as quotients of term algebras over decidable sets…

In this paper, we show that theory of processes can be reduced to the theory of spatial logic. Firstly, we propose a spatial logic SL for higher order pi-calculus, and give an inference system of SL. The soundness and incompleteness of SL…

A theory of recursive and corecursive definitions has been developed in higher-order logic (HOL) and mechanized using Isabelle. Least fixedpoints express inductive data types such as strict lists; greatest fixedpoints express coinductive…

We extend homological perturbation theory to encompass algebraic structures governed by operads and cooperads. The main difficulty is to find a suitable notion of algebra homotopy that generalizes to algebras over operads O. To solve this…

The proofs of K. Oka's Coherence Theorems are based on Weierstrass' Preparation (division) Theorem. Here we formulate and prove a Weak Coherence Theorem without using Weierstrass' Preparation Theorem, but only with power series expansions:…

The convergence rate of various first-order optimization algorithms is a pivotal concern within the numerical optimization community, as it directly reflects the efficiency of these algorithms across different optimization problems. Our…

AIMS. While weak lensing cannot resolve cluster cores and strong lensing is almost insensitive to density profiles outside the scale radius, combinations of both effects promise to constrain density profiles of galaxy clusters well, and…

A grammar formalism based upon CHR is proposed analogously to the way Definite Clause Grammars are defined and implemented on top of Prolog. These grammars execute as robust bottom-up parsers with an inherent treatment of ambiguity and a…