Related papers: Generic Trace Logics
We continue to develop a research line initiated in \cite{wollic22}, studying I/O logic from an algebraic approach based on subordination algebras. We introduce the classes of slanted (co-)Heyting algebras as equivalent presentations of…
Continuous logic extends the multi-valued Lukasiewicz logic by adding a halving operator on propositions. This extension is designed to give a more satisfactory model theory for continuous structures. The semantics of these logics can be…
In this paper we propose still another approach to the Hopf-type cyclic homology of Hopf algebras, introduced by A. Connes and H. Moscovici. Our construction is based on the notion of "universal differential calculus" on an algebra. Few…
It is proved in this paper that the Jacob's ladders together with the A. Selberg's classical formula (1942) lead to a new kind of formulae for some short trigonometric sums. These formulae cannot be obtained in the classical theory of A.…
The paper establishes the Krein and Koplienko trace formulas for multivariable operator functions on symmetrically normed ideals of bounded operators. Results are proved for self-adjoint and maximal dissipative operators. They cover both…
In this article, we define general normal forms for any logic that has propositional part and whose non-propositional connectives distribute over the finite disjunctions. We do not require the non-propositional connectives to be closed on…
Based on the definition of vertex coalgebra introduced by Hubbard [H], we prove that this notion can be reformulated using the Co-Commutator, Co-Skew symmetry and Co-Associator formulas without restrictions on the grading.
We prove two-term supercongruences for generalizations of recently discovered sporadic sequences of Cooper. We also discuss recent progress and future directions concerning other types of supercongruences.
This paper is a submission to the contest: How to combine logics? at the World Congress and School on Universal Logic III, 2010. We claim that combining "things", whatever these things are, is made easier if these things can be seen as the…
The logical parallelism of propositional connectives and type constructors extends beyond the static realm of predicates, to the dynamic realm of processes. Understanding the logical parallelism of process propositions and dynamic types was…
We show that formulas differing from classical analogues of rational trace formulas for algebraic-geometric potentials occur in the theory of finite-gap integration of spectral equations. The new formulas contain transcendental modular…
Formal, mathematically rigorous programming language semantics are the essential prerequisite for the design of logics and calculi that permit automated reasoning about concurrent programs. We propose a novel modular semantics designed to…
We propose a nonmonotonic Description Logic of typicality able to account for the phenomenon of concept combination of prototypical concepts. The proposed logic relies on the logic of typicality ALC TR, whose semantics is based on the…
In this work, the partially and totally hom-coassociative ternary coalgebras are constructed and discussed. Their {infinitesimal} bialgebraic structures are also investigated. The related dual space structures and their properties are…
The article proposes a new technique for proving the undefinability of logical connectives through each other and illustrates the technique with several examples. Some of the obtained results are new proofs of the existing theorems, others…
Game semantics allows us to look at basic logical concepts from another side. This approach to logic has a long history, there are plenty of different types of games: provability games, semantic games, etc. And there is an interesting type…
The groupoid of projectivities, introduced by M. Joswig, serves as a basis for a construction of parallel transport of graph and more general $Hom$-complexes. In this framework we develop a general conceptual approach to the Lovasz…
This is an expanded lecture note for "Masterclass on sofic groups and applications to operator algebras" (University of Copenhagen, 5-9 November 2012). It is about algebraic aspects of the Connes Embedding Conjecture. It contains new proofs…
For lack of general algorithmic methods that apply to wide classes of logics, establishing a complexity bound for a given modal logic is often a laborious task. The present work is a step towards a general theory of the complexity of modal…
We give an introduction to logic tailored for algebraists, explaining how proofs in linear logic can be viewed as algorithms for constructing morphisms in symmetric closed monoidal categories with additional structure. This is made explicit…