Related papers: Generalized Quantifiers on Dependent Types: A Syst…
The notion of quantized characters is introduced in our previous paper as a natural quantization of characters in the context of asymptotic representation theory for compact quantum groups. As in the case of ordinary groups, the…
Multicriteria decision analysis aims at supporting a person facing a decision problem involving conflicting criteria. We consider an additive utility model which provides robust conclusions based on preferences elicited from the decision…
The concept of uncertainty quanta for a general system is introduced and applied to some important problems in physics and mathematics. EPR paradox gives new clue to the further understanding of particle correlation which turns out to be…
A dependence measure for arbitrary type pairs of random variables is proposed and analyzed, which in the particular case where both random variables are continuous turns out to be a concordance measure. Also, a sample version of the…
As a part of the construction of an information theory based on general probabilistic theories, we propose and investigate the several distinguishability measures and "entropies" in general probabilistic theories. As their applications,…
The state-of-the-art on basic, single-antecedent anaphora has greatly improved in recent years. Researchers have therefore started to pay more attention to more complex cases of anaphora such as split-antecedent anaphora, as in Time-Warner…
We give an approach to open quantum systems based on formal deformation quantization. It is shown that classical open systems of a certain type can be systematically quantized into quantum open systems preserving the complete positivity of…
We present a general framework for studying regularized estimators; such estimators are pervasive in estimation problems wherein "plug-in" type estimators are either ill-defined or ill-behaved. Within this framework, we derive, under…
We study quantified propositional logics from the complexity theoretic point of view. First we introduce alternating dependency quantified boolean formulae (ADQBF) which generalize both quantified and dependency quantified boolean formulae.…
An extension of the Dirac procedure for the quantization of constrained systems is necessary to address certain issues that are left open in Dirac's original proposal. These issues play an important role especially in the context of…
This paper proposes a new theory and methodology to tackle the problem of unifying distributed analyses and inferences on shared parameters from multiple sources, into a single coherent inference. This surprisingly challenging problem…
Diagonalization in the spirit of Cantor's diagonal arguments is a widely used tool in theoretical computer sciences to obtain structural results about computational problems and complexity classes by indirect proofs. The Uniform…
Quantified constraints over the reals appear in numerous contexts. Usually existential quantification occurs when some parameter can be chosen by the user of a system, and univeral quantification when the exact value of a parameter is…
In this paper we attempt to consider quantum superpositions from the perspective of the logos categorical approach presented in [26]. We will argue that our approach allows us not only to better visualize the structural features of quantum…
We consider a recently introduced framework for the description of memory effects based on quantum state distinguishability quantifiers, in which entropic quantifiers can be included. After briefly presenting the approach, we validate it…
Signed systems were introduced as a general, syntax-independent framework for paraconsistent reasoning, that is, non-trivialised reasoning from inconsistent information. In this paper, we show how the family of corresponding paraconsistent…
Generalized metrics, arising from Lawvere's view of metric spaces as enriched categories, have been widely applied in denotational semantics as a way to measure to which extent two programs behave in a similar, although non equivalent, way.…
We define an equivalence relation on propositions and a proof system where equivalent propositions have the same proofs. The system obtained this way resembles several known non-deterministic and algebraic lambda-calculi.
Quantified formulas pose a significant challenge for Satisfiability Modulo Theories (SMT) solvers due to their inherent undecidability. Existing instantiation techniques, such as e-matching, syntax-guided, model-based, conflict-based, and…
Given an arbitrary statistical theory, different from quantum mechanics, how to decide which are the nonclassical correlations? We present a formal framework which allows for a definition of nonclassical correlations in such theories,…