Related papers: A proof-theoretical approach to some extensions of…
We provide the solution to the normal ordering problem for powers and exponentials of two classes of operators. The first one consists of boson strings and more generally homogeneous polynomials, while the second one treats operators linear…
One of the fundamental problems in quantum mechanics is finding the correct quantum image of a classical observable that would correspond to experimental measurements. We investigate for the appropriate quantization rule that would yield a…
To define a minimal mathematical framework for isolating some of the characteristic properties of quantum entanglement, we introduce a generalization of the tensor product of graphs. Inspired by the notion of a density matrix, the…
The theory of finite term algebras provides a natural framework to describe the semantics of functional languages. The ability to efficiently reason about term algebras is essential to automate program analysis and verification for…
Higher-order unification (HOU) concerns unification of (extensions of) $\lambda$-calculus and can be seen as an instance of equational unification ($E$-unification) modulo $\beta\eta$-equivalence of $\lambda$-terms. We study equational…
A differential calculus of the first order over multi-braided quantum groups is developed. In analogy with the standard theory, left/right-covariant and bicovariant differential structures are introduced and investigated. Furthermore,…
Ordinary differential equations of the first order on the torus have been investigated in detail by H. Poincar\'e and A. Denjoy. The long-standing problem of generalising these results for the equations of the order $k>1$ (or for the…
Possibilistic logic, an extension of first-order logic, deals with uncertainty that can be estimated in terms of possibility and necessity measures. Syntactically, this means that a first-order formula is equipped with a possibility degree…
There are several finite axiomatizations of stratified comprehension. The famous two are Hailperin's and Randall Holmes's. However, the system presented here could be the shortest known one written in the first order language of set theory.…
Possible generalizations of quantum theory permitting to describe in a unique way the development of the quantum system and the measurement process are discussed. The approach to the problem based on the Lindblad's equation for the…
We generalize the result of Brandenbursky and Marcinkowski for the bounded cohomology of transformation groups to infinite volume case. To state the result, we introduce the notion of norm controlled cohomology as a generalization of…
Monadic second order logic is the expansion of first order logic by quantifiers ranging over unary relations. We study the shared monadic second order theory of finite linear orders, i.e. the pseudofinite monadic second order theory of…
In the asymptotic theory of quantum hypothesis testing, the minimal error probability of the first kind jumps sharply from zero to one when the error exponent of the second kind passes by the point of the relative entropy of the two states…
This paper extends implication-space semantics to include first-order quantification. Implication-space semantics has recently been introduced as an inferentialist formal semantics that can capture nonmonotonic and nontransitive material…
Large complexity classes, like the exponential time hierarchy, received little attention in terms of finding complete problems. In this work a generalization of propositional logic is investigated which fills this gap with the introduction…
Ordering theorems, characterizing when partial orders of a group extend to total orders, are used to generate hypersequent calculi for varieties of lattice-ordered groups (l-groups). These calculi are then used to provide new proofs of…
Variational convexity, together with ist strong counterpart, of extended-real-valued functions has been recently introduced by Rockafellar. In this paper we present second-order characterizations of these properties, i.e., conditions using…
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…
Notions of k-asimulation and asimulation are introduced as asymmetric counterparts to k-bisimulation and bisimulation, respectively. It is proved that a first-order formula is equivalent to a standard translation of an intuitionistic…
Inductive and coinductive types are commonly construed as ontological (Church-style) types, denoting canonical data-sets such as natural numbers, lists, and streams. For various purposes, notably the study of programs in the context of…