相关论文: Further Formalization of the Process Algebra CCS i…

Recently Blecher and Kashyap have generalized the notion of W* modules over von Neumann algebras to the setting where the operator algebras are \sigma- weakly closed algebras of operators on a Hilbert space. They call these modules weak*…

Formalising the pi-calculus is an illuminating test of the expressiveness of logical frameworks and mechanised metatheory systems, because of the presence of name binding, labelled transitions with name extrusion, bisimulation, and…

Canonical relativized cylindric set algebras are used to sharpen the relative representation theorem for weakly associative relation algebras, that every complete atomic weakly associative relation algebra is isomorphic with the…

This paper presents a formalisation of pGCL in Isabelle/HOL. Using a shallow embedding, we demonstrate close integration with existing automation support. We demonstrate the facility with which the model can be extended to incorporate…

We show that first-order logic can be translated into a very simple and weak logic, and thus set theory can be formalized in this weak logic. This weak logical system is equivalent to the equational theory of Boolean algebras with three…

The weak operator topology closed operator algebra on $L^2(R)$ generated by the one-parameter semigroups for translation, dilation and multiplication by $exp(i\lambda x), \lambda \geq 0$, is shown to be a reflexive operator algebra, in the…

This paper studies the formal deformations of differential algebra morphisms. As a consequence, we develop a cohomology theory of differential algebra morphisms to interpret the lower degree cohomology groups as formal deformations. Then,…

The well-known process algebras, such as CCS, ACP and $\pi$-calculus, capture the interleaving concurrency based on bisimilarity semantics. We did some work on truly concurrent process algebras, such as CTC, APTC and $\pi_{tc}$, capture the…

The Higgs low-energy theorem gives a simple and elegant way to estimate the couplings of the Higgs boson to massless gluons and photons induced by loops of heavy particles. We extend this theorem to take into account possible nonlinear…

Higher-order processes with parameterization are capable of abstraction and application (migrated from the lambda-calculus), and thus are computationally more expressive. For the minimal higher-order concurrency, it is well-known that the…

Building on the functional-analytic framework of operator-valued kernels and un-truncated signature kernels, we propose a scalable, provably convergent signature-based algorithm for a broad class of high-dimensional, path-dependent hedging…

Topological cylindric algebras of dimension \alpha, \alpha any ordinal are cylindric algebras with dimension \alpha expanded with \alpha S4 modalities. The S4 modalities in representable algebras are induced by a topology on the base of the…

A fundamental fact for the algebraic theory of constraint satisfaction problems (CSPs) over a fixed template is that pp-interpretations between at most countable \omega-categorical relational structures have two algebraic counterparts for…

Large formal mathematical libraries consist of millions of atomic inference steps that give rise to a corresponding number of proved statements (lemmas). Analogously to the informal mathematical practice, only a tiny fraction of such…

In the literature on Kleene algebra (KA), a number of variants have been proposed such as Kleene algebra with tests, commutative KA, bi-KA, and concurrent KA. The equational theories of some of these structures have then been studied in the…

We design a reversible version of truly concurrent process algebra CTC which is called RCTC. It has good properties modulo several kinds of strongly forward-reverse truly concurrent bisimulations and weakly forward-reverse truly concurrent…

Reversible concurrent calculi are abstract models for concurrent systems in which any action can potentially be undone. Over the last few decades, different formalisms have been developed and their mathematical properties have been…

We develop a theory of weights for a quantum analogue of the symmetric pair (gl4,gl2 x gl2) realised as a quantum symmetric pair subalgebra. Based on Letzter's triangular decomposition we define Verma modules. Using magical operators that…

Using Isabelle/HOL, we verify a union-find data structure with an explain operation due to Nieuwenhuis and Oliveras. We devise a simpler, more naive version of the explain operation whose soundness and completeness is easy to verify. Then,…

The continuous functional calculus is perhaps the most fundamental construction in the theory of operator algebras, especially $C^{*}$-algebras. Here we document our formalization of the continuous functional calculus in Lean, which…