Related papers: Partial Evaluations and the Compositional Structur…
We present a coalgebraic generalisation of Fischer and Ladner's Propositional Dynamic Logic (PDL) and Parikh's Game Logic (GL). In earlier work, we proved a generic strong completeness result for coalgebraic dynamic logics without…
The classical subset construction for non-deterministic automata can be generalized to other side-effects captured by a monad. The key insight is that both the state space of the determinized automaton and its semantics---languages over an…
Commutative totally ordered monoids abound, number systems for example. When the monoid is not assumed commutative, one may be hard pressed to find an example. One suggested by Professor Orr Shalit are the countable ordinals with addition.…
Circuits based on sum-product structure have become a ubiquitous representation to compactly encode knowledge, from Boolean functions to probability distributions. By imposing constraints on the structure of such circuits, certain inference…
For some monoids, we give a method of composing invertibility preserving maps associated to "partial involutions." Also, we define the notion of "determinants for finite dimensional algebras over a field." As examples, we give invertibility…
Capretta's delay monad can be used to model partial computations, but it has the "wrong" notion of built-in equality, strong bisimilarity. An alternative is to quotient the delay monad by the "right" notion of equality, weak bisimilarity.…
Almost block diagonal linear systems of equations can be exemplified by two modules. This makes it possible to construct all sequential forms of band and/or block elimination methods, six old and fourteen new. It allows easy assessment of…
In the paper we study the algebroid A of the groupoid of partially invertible elements over the lattice of orthogonal projections of a $W^*$-algebra. In particular the complex analytic manifold structure of these objects is investigated.…
All constructive methods employed in modern mathematics produce only countable sets, even when designed to transcend countability. We show that any constructive argument for uncountability -- excluding diagonalization techniques --…
We construct positional numeral systems that work natively over nonderived polyadic $\left( m,n\right) $-rings whose addition takes $m$ arguments and multiplication takes $n$. In such rings, the length of an admissible additive word and a…
The classical propositional logic is known to be sound and complete with respect to the set semantics that interprets connectives as set operations. The paper extends propositional language by a new binary modality that corresponds to…
For a positive real $\alpha$, we can consider the additive submonoid $M$ of the real line that is generated by the nonnegative powers of $\alpha$. When $\alpha$ is transcendental, $M$ is a unique factorization monoid. However, when $\alpha$…
It is known that the so-called monadic decomposition, applied to the adjunction connecting the category of bialgebras to the category of vector spaces via the tensor and the primitive functors, returns the usual adjunction between…
We investigate the behavior of extension monads, introduced in the 1990s by the second author, in terms of structure results for infinitely many finitary operations and common constructions in varieties or categories of algebras.…
A deductive system is structurally complete if its admissible inference rules are derivable. For several important systems, like modal logic S5, failure of structural completeness is caused only by the underivability of passive rules, i.e.…
This paper introduces and studies a categorical analogue of the familiar monoid semiring construction. By introducing an axiomatisation of summation that unifies notions of summation from algebraic program semantics with various notions of…
We introduce a new algebraic construction, {\em monop}, that combines monoids (with respect to the product of species), and operads (monoids with respect to the substitution of species) in the same algebraic structure. By the use of…
It is shown the construction of a module structure [2] with universe over a set of a particular kind of mathematical proofs, the base ring of this module will be built on a maximal consistent extension of a set of propositions, this…
This paper examines the structure of poset matrices by formulating a set of new construction rules for this purpose. In this direction, the technique of partial composition operation will be introduced as the basis for the construction of…
Given a Hopf algebra in a symmetric monoidal category with duals, the category of modules inherits the structure of a monoidal category with duals. If the notion of algebra is replaced with that of monad on a monoidal category with duals…