Related papers: Independence of Essential Sets in Finite Implicati…
Well-structured transition systems provide the right foundation to compute a finite basis of the set of predecessors of the upward closure of a state. The dual problem, to compute a finite representation of the set of successors of the…
An analogue of Krein's extension theorem is proved for operator-valued positive definite functions on free groups. The proof gives also the parametrization of all extensions by means of a generalized type of Szego parameters. One singles…
We give a general notion of combinatory completeness with respect to a faithful cartesian club and use it systematically to obtain characterisations of a number of different kinds of applicative system. Each faithful cartesian club…
Implicative algebras, recently discovered by Miquel, are combinatorial structures unifying classical and intuitionistic realizability as well as forcing. In this paper we introduce implicative assemblies as sets valued in the separator of…
For the space of two identical systems of arbitrary dimensions, we introduce a continuous family of bases with the following properties: i) the bases are orthonormal, ii) in each basis, all the states have the same values of entanglement,…
This paper introduces the notions of independence and conditional independence in valuation-based systems (VBS). VBS is an axiomatic framework capable of representing many different uncertainty calculi. We define independence and…
High-order phenomena play crucial roles in many systems of interest, but their analysis is often highly nontrivial. There is a rich literature providing a number of alternative information-theoretic quantities capturing high-order…
We show that maximal families of mutually unbiased bases are characterized in all dimensions by partitioned unitary error bases, up to a choice of a family of Hadamards. Furthermore, we give a new construction of partitioned unitary error…
Quantum uncertainty relations impose fundamental limits on the joint knowledge that can be acquired from complementary observables: perfect knowledge of a quantum state in one basis implies maximal indetermination in all other mutually…
This article provide new approach to solve P vs NP problem by using cardinality of bases function. About NP-Complete problems, we can divide to infinite disjunction of P-Complete problems. These P-Complete problems are independent of each…
We present a new approach to the problem of mutually unbiased bases (MUBs), based on positive definite functions on the unitary group. The method provides a new proof of the fact that there are at most $d+1$ MUBs in ${\mathbb C}^d$. It may…
We prove several structural results on definably compact groups G in o-minimal expansions of real closed fields, such as (i) G is definably an almost direct product of a semisimple group and a commutative group, and (ii) the group (G, .) is…
We characterise the existentially closed models of the theory of exponential fields. They do not form an elementary class, but can be studied using positive logic. We find the amalgamation bases and characterise the types over them. We…
Existentially closed groups are, informally, groups that contain solutions to every consistent finite system of equations and inequations. They were introduced in 1951 in an algebraic context and subsequent research elucidated deep…
Coherent sets of almost desirable gambles and credal sets are known to be equivalent models. That is, there exists a bijection between the two collections of sets preserving the usual operations, e.g. conditioning. Such a correspondence is…
I define three "measures" of the complicatedness of a finite group in terms of bases in permutation representations of the group, and consider their relationships to other measures.
This paper provides a model theoretic semantics to feature terms augmented with set descriptions. We provide constraints to specify HPSG style set descriptions, fixed cardinality set descriptions, set-membership constraints, restricted…
We extend classical work by Janusz Czelakowski on the closure properties of the class of matrix models of entailment relations - nowadays more commonly called multiple-conclusion logics - to the setting of non-deterministic matrices…
Many deep, mysterious connections have been observed between collections of mutually unbiased bases (MUBs) and combinatorial designs called $k$-nets (and in particular, between complete collections of MUBs and finite affine - or…
We give an almost entirely model-theoretic account of both Ramsey classes of finite structures and of generalized indiscernibles as studied in special cases in (for example) [7], [9]. We understand "theories of indiscernibles" to be special…