Related papers: Continuous Algebra: Algebraic Semantics for Contin…
Representation theory of an infinite dimensional Galilean conformal algebra introduced by Martelli and Tachikawa is developed. We focus on the algebra defined in (2+1) dimensional spacetime and consider central extension. It is then shown…
In this paper we show several similarities among logic systems that deal simultaneously with deductive and quantitative inference. We claim it is appropriate to call the tasks those systems perform as Quantitative Logic Reasoning. Analogous…
In the framework of propositional {\L}ukasiewicz logic, a suitable notion of implicit definability, tailored to the intended real-valued semantics and referring to the elements of its domain, is introduced. Several variants of implicitly…
We study the notion of linear sofic approximations for algebras, analogous to the concept of sofic representations for groups. We prove that for a finitely generated amenable $K$-algebra with no zero divisors, all linear sofic…
We use the connection between automata and logic to prove that a wide class of coalgebraic fixpoint logics enjoys uniform interpolation. To this aim, first we generalize one of the central results in coalgebraic automata theory, namely…
We present a coalgebraic framework for studying generalisations of dynamic modal logics such as PDL and game logic in which both the propositions and the semantic structures can take values in an algebra $\mathbf{A}$ of truth-degrees. More…
We study different representation theorems for various reducts of Heyting polyadic algebras. Superamalgamation is proved for several (natural reducts) and our results are compared to the finitizability problem in classical algebraic logic…
We introduce a modal logic, called Cone Logic, whose formulas describe properties of points in the plane and spatial relationships between them. Points are labelled by proposition letters and spatial relations are induced by the four…
The uniform interpolation property in a given logic can be understood as the definability of propositional quantifiers. We mechanise the computation of these quantifiers and prove correctness in the Coq proof assistant for three modal…
In this paper we investigate two logics from an algebraic point of view. The two logics are: MALL (multiplicative-additive Linear Logic) and LL (classical Linear Logic). Both logics turn out to be strongly algebraizable in the sense of Blok…
We study the computational expressivity of proof systems with fixed point operators, within the 'proofs-as-programs' paradigm. We start with a calculus muLJ (due to Clairambault) that extends intuitionistic logic by least and greatest…
This work connects two mathematical fields - computational complexity and interval linear algebra. It introduces the basic topics of interval linear algebra - regularity and singularity, full column rank, solving a linear system, deciding…
We present a comprehensive programme analysing the decomposition of proof systems for non-classical logics into proof systems for other logics, especially classical logic, using an algebra of constraints. That is, one recovers a proof…
We give a presentation theorem for continuous first-order logic and Metric Abstract Elementary classes in terms of $L_{\omega_1, \omega}$ and Abstract Elementary Classes, respectively. This presentation is accomplished by analyzing dense…
Self-similar potentials generalize the concept of shape-invariance which was originally introduced to explore exactly-solvable potentials in quantum mechanics. In this article it is shown that previously introduced algebraic approach to the…
In this short note we relate some known properties of propositional calculus to purely algebraic considerations of a Boolean algebra. Classes of formulas of propositional calculus are considered as elements of a Boolean algebra. As such…
In the current paper, we generalize the "compact operator" part of the Voiculescu's non-commutative Weyl-von Neumann theorem on approximate equivalence of unital $*$-homomorphisms of an commutative C$^*$ algebra $\mathcal{A}$ into a…
We offer the proofs that complete our article introducing the propositional calculus called semi-intuitionistic logic with strong negation.
We prove an analogue of Kac's Theorem, describing the dimension vectors of indecomposable coherent sheaves, or parabolic bundles, over weighted projective lines. We use a theorem of Peng and Xiao to associate a Lie algebra to the category…
Abstract. Matching logic cannot handle concurrency. We introduce concurrent matching logic (CML) to reason about fault-free partial correctness of shared-memory concurrent programs. We also present a soundness proof for concurrent matching…