Related papers: Further Formalization of the Process Algebra CCS i…
In this article, we study the passage of limits from discrete to continuous condensing aggregation equation which comprises of Oort-Hulst-Safronov (OHS) equation together with inverse aggregation process. We establish the relation between…
Let $C^*(\cls)$ be the $C^*$ algebra generated by an operator system $\cls$ i.e. a unital $*$-closed subspace of a unital $C^*$ algebra $\cla$. We prove that any complete order isomorphism $\cli:\cls \raro \cls'$ between two such operator…
Let $G$ be a countable group. We introduce several equivalence relations on the set ${\rm Sub}(G)$ of subgroups of $G$, defined by properties of the quasi-regular representations $\lambda_{G/H}$ associated to $H\in {\rm Sub}(G)$ and compare…
In this article an interpretation and a proof of some classical \\theorems in analysis on the integration of analytic vectors fields are derived from the algebraic method of realization of bialgebras which are constructed with the data of a…
The compactness lemma in programming language theory states that any recursive function can be simulated by a finite unrolling of the function. One important use case it has is in the logical relations proof technique for proving properties…
We have previously published the Isabelle/HOL formalization of a general theory of syntax with bindings. In this companion paper, we instantiate the general theory to the syntax of lambda-calculus and formalize the development leading to…
Capitalizing on previous encodings and formal developments about nominal calculi and type systems, we propose a weak Higher-Order Abstract Syntax formalization of the type language of pure System F<: within Coq, a proof assistant based on…
A variety of logical frameworks support the use of higher-order abstract syntax (HOAS) in representing formal systems. Although these systems seem superficially the same, they differ in a variety of ways; for example, how they handle a…
Over the past 50 years, Nelson algebras have been extensively studied by distinguished scholars as the algebraic counterpart of Nelson's constructive logic with strong negation. Despite these studies, a comprehensive survey of the topic is…
Let $G$ be a group and $S$ a unital epsilon-strongly $G$-graded algebra. We construct spectral sequences converging to the Hochschild (co)homology of $S$. Each spectral sequence is expressed in terms of the partial group (co)homology of $G$…
Higher-order constructs extend the expressiveness of first-order (Constraint) Logic Programming ((C)LP) both syntactically and semantically. At the same time assertions have been in use for some time in (C)LP systems helping programmers…
In this paper we introduced an algebraic semantics for process algebra in form of abstract data types. For that purpose, we developed a particular type of algebra, the seed algebra, which describes exactly the behavior of a process within a…
We deal with the random combinatorial structures called assemblies. By weakening the logarithmic condition which assures regularity of the number of components of a given order, we extend the notion of logarithmic assemblies. Using the…
This paper investigates the logical strength of completeness theorems for modal propositional logic within second-order arithmetic. We demonstrate that the weak completeness theorem for modal propositional logic is provable in…
Hybrid Communicating Sequential Processes (HCSP) is a powerful formal modeling language for hybrid systems, which is an extension of CSP by introducing differential equations for modeling continuous evolution and interrupts for modeling…
Relational verification encompasses information flow security, regression verification, translation validation for compilers, and more. Effective alignment of the programs and computations to be related facilitates use of simpler relational…
In holography there is a one-to-one correspondence between physical observables in the bulk and boundary theories. To define physical observables, however, regularisation needs to be implemented in both sides of the correspondence. It is…
Earlier we presented a method to decompose modal formulas for processes with the internal action $\tau$, and congruence formats for branching and $\eta$-bisimilarity were derived on the basis of this decomposition method. The idea is that a…
We formalize a complete proof of the regular case of Fermat's Last Theorem in the Lean4 theorem prover. Our formalization includes a proof of Kummer's lemma, that is the main obstruction to Fermat's Last Theorem for regular primes. Rather…
Process calculi based on logic, such as $\pi$DILL and CP, provide a foundation for deadlock-free concurrent programming. However, in previous work, there is a mismatch between the rules for constructing proofs and the term constructors of…