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

We expose different methods of regularizations of subsolutions in the context of discrete weak KAM theory. They allow to prove the existence and the density of $C^{1,1}$ subsolutions. Moreover, these subsolutions can be made strict and…

Given a graph of C*-algebras, we prove a long exact sequence in KK-theory for both the maximal and the vertex-reduced fundamental C*-algebras in the presence of possibly non GNS-faithful conditional expectations. We deduce from it the…

Logic is the science of correct inferences and a logical system is a tool to prove assertions in a certain logic in a correct way. There are many logical systems, and many ways of formalizing them, e.g., using natural deduction or sequent…

We contribute to a recent research program which aims at revisiting the study of the complexity of word problems, a major area of research in combinatorial algebra, through the lens of the theory of computably enumerable equivalence…

Deductive verification of hybrid systems (HSs) increasingly attracts more attention in recent years because of its power and scalability, where a powerful specification logic for HSs is the cornerstone. Often, HSs are naturally modelled by…

The aim of this paper is to develop the theory of Hom-coalgebras and related structures. After reviewing some key constructions and examples of quasi-deformations of Lie algebras involving twisted derivations and giving rise to the class of…

We present weak approximations schemes of any order for the Heston model that are obtained by using the method developed by Alfonsi and Bally (2021). This method consists in combining approximation schemes calculated on different random…

In previous work "Betweenness algebras" we introduced and examined the class of betweenness algebras. In the current paper we study a larger class of algebras with binary operators of possibility and sufficiency, the weak mixed algebras.…

We present an abstract machine and a reduction semantics for the lambda-calculus extended with control operators that give access to delimited continuations in the CPS hierarchy. The abstract machine is derived from an evaluator in…

We develop a (co)algebraic framework to study a family of process calculi with monadic branching structures and recursion operators. Our framework features a uniform semantics of process terms and a complete axiomatisation of semantic…

In the context of spatial logics and spatial model checking for polyhedral models -- mathematical basis for visualisations in continuous space -- we propose a weakening of simplicial bisimilarity. We additionally propose a corresponding…

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…

This paper introduces a model theory for resolution on Higher Order Hereditarily Harrop formulae (HOHH), the logic underlying the Lambda-Prolog programming language, and proves soundness and completeness of resolution. The semantics and the…

This paper proposes a novel higher-order multi-scale (HOMS) computational method, which is highly targeted for efficient, high-accuracy and low-computational-cost simulation of hygro-thermo-mechanical (H-T-M) coupling problems in…

We complete the analysis of the effective field theory at the electroweak scale for minimal models of fundamental partial compositeness. Specifically, we consider fermions in the complex and real representation of the gauge group underlying…

We give a simpler proof of a result of Hodkinson in the context of a blow and blur up construction argueing that the idea at heart is similar to that adopted by Andr\'eka et all \cite{sayed}. The idea is to blow up a finite structure,…

In this paper we study Weihrauch reducibility for multi-valued functions on represented spaces. We call the corresponding equivalence classes Weihrauch degrees and we show that the corresponding partial order induces a lower semi-lattice…

In this paper we examine the reverse mathematical strength of a variation of Hindman's Theorem HT constructed by essentially combining HT with the Thin Set Theorem TS to obtain a principle which we call thin-HT. thin-HT says that every…

Computer Algebra systems are widely spread because of some of their remarkable features such as their ease of use and performance. Nonetheless, this focus on performance sometimes leads to unwanted consequences: algorithms and computations…

We study the celestial CFT dual to theories with bulk supersymmetry. The boundary theory realizes supersymmetry in the spirit of the Green-Schwarz superstring: there is manifest 4d super-Poincar\'e symmetry, but no 2d superconformal…