We classify finite-dimensional complex Hopf algebras A which are pointed, that is, all of whose irreducible comodules are one-dimensional, and whose group of group-like elements G(A) is abelian such that all prime divisors of the order of G(A) are > 7. Since these Hopf algebras turn out to be deformations of a natural class of generalized small quantum groups, our result can be read as an axiom...

In this paper we present a model of implementation based on the idea that agents renegotiate unfeasible allocations. We characterize the maximal set of Social Choice Correspondences that can be implemented in Nash Equilibrium with a class of renegotiation functions that do not reward agents for unfeasibilities. This result is used to study the possibility of implementing the Walrasian Correspon...

To capture the uncertainty of information or knowledge in information systems, various information granulations, also known as knowledge granulations, have been proposed. Recently, several axiomatic definitions of information granulation have been introduced. In this paper, we try to improve these axiomatic definitions and give a universal construction of information granulation by relating inf...

A model of conscious mechanisms called Axiomatic Consciousness Theory (ACT) is used to develop a theoretical computational model of visual phenomenology . The result is an extension of concepts in AI towards phenomenal intentionality: the lack of which is a common starting point for critiques of AI . Here the argument is developed at four interacting grain levels of computational description an...

We provide general conditions on hypersequent calculi that guarantee standard completeness for the formalized logics. These conditions are implemented in the PROLOG system AxiomCalc that takes as input any suitable axiomatic extension of Monoidal T-norm Logic MTL and outputs a hypersequent calculus for the logic and the result of the check. Our approach subsumes many existing results and allows...

Working in the axiomatic framework recently proposed by Gaberdiel and Goddard, we prove a generalized version of Zhu’s Theorem; for any chiral bosonic conformal field theory on the sphere, our result characterizes the chiral blocks in terms of a certain quotient of the Fock space. We also establish, under a finiteness hypothesis closely related to rationality of the theory, that the relevant Kn...

We study hierarchical clustering schemes under an axiomatic view. We show that within this framework, one can prove a theorem analogous to one of Kleinberg (2002), in which one obtains an existence and uniqueness theorem instead of a non-existence result. We explore further properties of this unique scheme: stability and convergence are established. We represent dendrograms as ultrametric space...

In this paper we prove strong completeness of axiomatic extensions of First Order SMTL logic adding the so-called quasi-witnessed axioms with respect to quasi-witnessed Models. In order to achieve this result, we make use of methods that are typical of Classical Predicate Logic, and have been later generalized by P. Hájek to cope with Predicate Fuzzy Logic. At the end of the paper, we obtain, a...

Indefinite summation, together with a generalized version of the Kronecker delta, provide a calculus for reasoning about various polynomial functions that arise in combinatorics, such as the Tutte, chromatic, flow, and reliability polynomials. In this paper we develop the algebraic properties of the indefinite summation operator and the generalized Kronecker delta from an axiomatic viewpoint. O...

The aim of the present paper is to study a one-point solution concept for bicooperative games. For these games introduced by Bilbao (Cooperative Games on Combinatorial Structures, 2000), we define a one-point solution called the Shapley value, since this value can be interpreted in a similar way to the classical Shapley value for cooperative games. The main result of the paper is an axiomatic c...