Related papers: On Hoare-McCarthy algebras
We discuss the Hodge theory of algebraic non-commutative spaces and analyze how this theory interacts with the Calabi-Yau condition and with mirror symmetry. We develop an abstract theory of non-commutative Hodge structures, investigate…
Convolution is a ubiquitous operation in mathematics and computing. The Kripke semantics for substructural and interval logics motivates its study for quantale-valued functions relative to ternary relations. The resulting notion of…
We propose an approach to extending the concept of a Lie algebra to ternary structures based on $\omega$-symmetry, where $\omega$ is a primitive cube root of unity. We give a definition of a corresponding structure, called a ternary Lie…
In this paper, we present a propositional sequent calculus containing disjoint copies of classical and intuitionistic logics. We prove a cut-elimination theorem and we establish a relation between this system and linear logic.
A finite-dimensional unital and associative algebra over $\mathbb{R}$, or what we shall call simply "an algebra" in this paper for short, generalities the construction by which we derive the complex numbers by "adjoining an element $i$" to…
Many applications of denotational semantics, such as higher-order model checking or the complexity of normalization, rely on finite semantics for monomorphic type systems. We exhibit such a finite semantics for a polymorphic purely linear…
The preferential conditional logic PCL, introduced by Burgess, and its extensions are studied. First, a natural semantics based on neighbourhood models, which generalise Lewis' sphere models for counterfactual logics, is proposed. Soundness…
Conditionals play a key role in different areas of logic and probabilistic reasoning, and they have been studied and formalized from different angles. In this paper we focus on the de Finetti's notion of conditional as a three-valued…
Recent years have witnessed the rise of compositional semantics as a foundation for formal verification of complex systems. In particular, interaction trees have emerged as a popular denotational semantics. Interaction trees achieve…
Consider the smooth sections of the tangent bundle of a reductive homogeneous space. This is a vector space over the field of real numbers. The canonical connection acts as a linear binary operator on this vector space, making it an…
Given a consequence relation in many-valued logic, what connectives can be defined? For instance, does there always exist a conditional operator internalizing the consequence relation, and which form should it take? In this paper, we pose…
We study properties related to relevance in non-monotonic consequence relations obtained by systems of structured argumentation. Relevance desiderata concern the robustness of a consequence relation under the addition of irrelevant…
Fiore and Hur recently introduced a conservative extension of universal algebra and equational logic from first to second order. Second-order universal algebra and second-order equational logic respectively provide a model theory and a…
We consider (finitary, propositional) logics through the original use of Category Theory: the study of the "sociology of mathematical objects", aligning us with a recent, and growing, trend of study logics through its relations with other…
When a physicist performs a quantic measurement, new information about the system at hand is gathered. This paper studies the logical properties of how this new information is combined with previous information. It presents Quantum Logic as…
A generalization of power associative algebra, called Hom-power associative algebra, is studied. The main result says that a multiplicative Hom-algebra is Hom-power associative if and only if it satisfies two identities of degrees three and…
The conformal equivalence of fourth-order gravity following from a non-linear Lagrangian L(R) to theories of other types is widely known, here we report on a new conformal equivalence of these theories to theories of the same type but with…
Graded modal types systems and coeffects are becoming a standard formalism to deal with context-dependent computations where code usage plays a central role. The theory of program equivalence for modal and coeffectful languages, however, is…
Program equivalence is the fulcrum for reasoning about and proving properties of programs. For noninterference, for example, program equivalence up to the secrecy level of an observer is shown. A powerful enabler for such proofs are logical…
We propose a formalization of the three-tier causal hierarchy of association, intervention, and counterfactuals as a series of probabilistic logical languages. Our languages are of strictly increasing expressivity, the first capable of…