English
Related papers

Related papers: Axiomatic structure of k-additive capacities

200 papers

This paper proposes a new category theoretic account of equationally axiomatizable classes of algebras. Our approach is well-suited for the treatment of algebras equipped with additional computationally relevant structure, such as ordered…

Logic in Computer Science · Computer Science 2019-02-05 Stefan Milius , Henning Urbat

Incomplete preferences provide the epistemic foundation for models of imprecise subjective probabilities and utilities that are used in robust Bayesian analysis and in theories of bounded rationality. This paper presents a simple…

Statistics Theory · Mathematics 2007-06-13 Robert Nau

Three extensions and reinterpretations of nonclassical probabilities are reviewed. (i) We propose to generalize the probability axiom of quantum mechanics to self-adjoint positive operators of trace one. Furthermore, we discuss the…

Quantum Physics · Physics 2007-05-23 Karl Svozil

We introduce two approximate variants of inclusion dependencies and examine the axiomatization and computational complexity of their implication problems. The approximate variants allow for some imperfection in the database and differ in…

Logic in Computer Science · Computer Science 2025-05-27 Matilda Häggblom

Richard Cox [1] set the axiomatic foundations of probable inference and the algebra of propositions. He showed that consistency within these axioms requires certain rules for updating belief. In this paper we use the analogy between…

Artificial Intelligence · Computer Science 2007-05-23 Ali E. Abbas

A countable discrete group is called Choquet-Deny if for any non-degenerate probability measure on the group, the corresponding space of bounded harmonic functions is trivial. Building on the previous work of Jaworski, a complete…

Functional Analysis · Mathematics 2024-06-26 Tey Berendschot , Soham Chakraborty , Milan Donvil , Se-Jin Kim , Mario Klisse

We provide a universal characterization of the construction taking a scheme $X$ to its stable $\infty$-category $\text{Mot}(X)$ of noncommutative motives, patterned after the universal characterization of algebraic K-theory due to…

K-Theory and Homology · Mathematics 2024-08-21 Aaron Mazel-Gee , Reuben Stern

We present a complete finite axiomatization of the unrestricted implication problem for inclusion and conditional independence atoms in the context of dependence logic. For databases, our result implies a finite axiomatization of the…

Logic · Mathematics 2013-09-23 Miika Hannula , Juha Kontinen

We derive computational formulas for the generalized Choquet integral based on the novel survival function introduced by M. Boczek et al. [1]. We demonstrate its usefulness on the Knapsack problem and the problem of accommodation options.…

Optimization and Control · Mathematics 2023-06-23 Stanislav Basarik , Jana Borzová , Lenka Halčinová , Jaroslav Šupina

In this paper we extend the classical Korovkin theorems to the framework of comonotone additive, sublinear and monotone operators. Based on the theory of Choquet capacities, several concrete examples illustrating our results are also…

Classical Analysis and ODEs · Mathematics 2020-09-15 Sorin G. Gal , Constantin Niculescu

In this work, we study the generalized k-th power symbol (a/n)_k and present a comprehensive collection of its algebraic properties. The results are classified according to their dependence on the three main parameters a, n, and k. In…

General Mathematics · Mathematics 2025-10-02 Es-said En-naoui

Given a submodular capacity space, we prove the uniform convergence in capacity and also the uniform convergence in the Choquet-mean of order $p\ge1$ with a quantitative estimate, of the multivariate Bernstein polynomials associated to a…

Classical Analysis and ODEs · Mathematics 2020-10-02 Sorin G. Gal , Constantin Niculescu

We introduce a generalization of the notion of approximately proper equivalence relations studied by Renault and with it we build an \'etale groupoid. Choosing a suitable set of continuous functions to play the role of a potential, we…

Operator Algebras · Mathematics 2018-09-10 R. Bissacot , R. Exel , R. Frausino , T. Raszeja

This paper axiomatizes, in a two-stage setup, a new theory for decision under risk and ambiguity. The axiomatized preference relation $\succeq$ on the space $\tilde{V}$ of random variables induces an ambiguity index $c$ on the space…

Optimization and Control · Mathematics 2026-03-24 Roger J. A. Laeven , Mitja Stadje

Propositional term modal logic is interpreted over Kripke structures with unboundedly many accessibility relations and hence the syntax admits variables indexing modalities and quantification over them. This logic is undecidable, and we…

Logic in Computer Science · Computer Science 2019-01-01 Anantha Padmanabha , R Ramanujam

We prove two completeness results, one for the extension of dependence logic by a monotone generalized quantifier Q with weak interpretation, weak in the meaning that the interpretation of Q varies with the structures. The second result…

Logic · Mathematics 2013-04-03 Fredrik Engström , Juha Kontinen , Jouko Väänänen

Let $G$ be a finite group. Let $K/k$ be a Galois extension of number fields with Galois group isomorphic to $G$, and let $C \subseteq \mathrm{Gal}(K/k) \simeq G$ be a conjugacy invariant subset. It is well known that there exists an…

Number Theory · Mathematics 2026-01-01 Peter J. Cho , Robert J. Lemke Oliver , Asif Zaman

We introduce the notion of first order amenability, as a property of a first order theory $T$: every complete type over $\emptyset$, in possibly infinitely many variables, extends to an automorphism-invariant global Keisler measure in the…

Logic · Mathematics 2025-11-18 Ehud Hrushovski , Krzysztof Krupiński , Anand Pillay

We introduce the notion of quantum duplicates of an (associative, unital) algebra, motivated by the problem of constructing toy-models for quantizations of certain configuration spaces in quantum mechanics. The proposed (algebraic) model…

Quantum Algebra · Mathematics 2014-02-26 Óscar Cortadellas , Javier López Peña , Gabriel Navarro

Inclusion dependencies form one of the most widely used dependency classes. We extend existing results on the axiomatization and computational complexity of their implication problem to two extended variants. We present an alternative…

Logic in Computer Science · Computer Science 2025-05-27 Matilda Häggblom