English
Related papers

Related papers: Finitely additive beliefs and universal type space…

200 papers

According to the math tea argument, there must be real numbers that we cannot describe or define, because there are uncountably many real numbers, but only countably many definitions. And yet, the existence of pointwise-definable models of…

Logic · Mathematics 2024-04-09 Joel David Hamkins

To model discrete-time finite-state uncertain processes, we argue for the use of a global belief model in the form of an upper expectation that is the most conservative one under a set of basic axioms. Our motivation for these axioms, which…

Probability · Mathematics 2021-01-12 Natan T'Joens , Jasper De Bock , Gert de Cooman

We introduce the categories of quasi-measurable spaces, which are slight generalizations of the category of quasi-Borel spaces, where we now allow for general sample spaces and less restrictive random variables, spaces and maps. We show…

Probability · Mathematics 2021-09-27 Patrick Forré

Turing machines and spin models share a notion of universality according to which some simulate all others. Is there a theory of universality that captures this notion? We set up a categorical framework for universality which includes as…

Computational Complexity · Computer Science 2024-09-04 Tomáš Gonda , Tobias Reinhart , Sebastian Stengele , Gemma De les Coves

In a recent paper \cite{Redei-Jing2026} the notion of conditional $p$-inaccessibility of a decision based on utility maximization was defined and examples of conditionally $p$-inaccessible decisions were given. The conditional…

Statistics Theory · Mathematics 2026-05-05 Zalán Gyenis , Miklós Rédei , Leszek Wroński

Hierarchies of conditional beliefs (Battigalli and Siniscalchi 1999) play a central role for the epistemic analysis of solution concepts in sequential games. They are practically modelled by type structures, which allow the analyst to…

Computer Science and Game Theory · Computer Science 2023-07-13 Nicodemo De Vito

This paper presents two general criteria to determine spaceability results in the complements of unions of subspaces. The first criterion applies to countable unions of subspaces under specific conditions and is closely related to the…

Functional Analysis · Mathematics 2024-11-15 Gustavo Araújo , Anderson Barbosa , Anselmo Raposo , Geivison Ribeiro

By the additive property, we mean a condition under which $L^p$ spaces over finitely additive measures are complete. Basile and Rao gives a necessary and sufficient condition that a finite sum of finitely additive measures has the additive…

Functional Analysis · Mathematics 2019-05-23 Ryoichi Kunisada

In this paper we collect several examples of convergence of functions of random processes to generalized functionals of those processes. We remark that the limit is always finitely absolutely continuous with respect to Wiener measure. We…

Probability · Mathematics 2024-09-17 A. A. Dorogovtsev , Naoufel Salhi

We define notions of cautiousness and cautious belief to provide epistemic conditions for iterated admissibility in finite games. We show that iterated admissibility characterizes the behavioral implications of "cautious rationality and…

Theoretical Economics · Economics 2023-05-25 Emiliano Catonini , Nicodemo De Vito

We study countable embedding-universal and homomorphism-universal structures and unify results related to both of these notions. We show that many universal and ultrahomogeneous structures allow a concise description (called here a finite…

Combinatorics · Mathematics 2010-09-06 Jan Hubicka

In a game of incomplete information, an infinite state space can create problems. When the space is uncountably large, the strategy spaces of the players may be unwieldly, resulting in a lack of measurable equilibria. When the knowledge of…

Logic · Mathematics 2011-10-17 Robert Samuel Simon

We show pro-definability of spaces of definable types in various classical complete first order theories, including complete o-minimal theories, Presburger arithmetic, $p$-adically closed fields, real closed and algebraically closed valued…

Logic · Mathematics 2022-08-09 Pablo Cubides Kovacsics , Jinhe Ye

We introduce a new setting, the category of $\omega$PAP spaces, for reasoning denotationally about expressive differentiable and probabilistic programming languages. Our semantics is general enough to assign meanings to most practical…

Programming Languages · Computer Science 2023-05-29 Mathieu Huot , Alexander K. Lew , Vikash K. Mansinghka , Sam Staton

Wasserman et al. (2020, PNAS, vol. 117, pp. 16880-16890) constructed estimator agnostic and finite-sample valid confidence sets and hypothesis tests, using split-data likelihood ratio-based statistics. We demonstrate that the same approach…

Statistics Theory · Mathematics 2020-09-24 Hien Duy Nguyen

We find universal spaces for Alexandroff and finite spaces and explore some of its topological properties as well as their description as inverse limits of finite spaces and Alexandroff extensions. They can be used as a natural environment…

General Topology · Mathematics 2024-12-02 Diego Mondéjar

This paper relates comparative belief structures and a general view of belief management in the setting of deductively closed logical representations of accepted beliefs. We show that the range of compatibility between the classical…

Artificial Intelligence · Computer Science 2013-02-01 Didier Dubois , Helene Fargier , Henri Prade

Modern scientific cosmology pushes the boundaries of knowledge and the knowable. This is prompting questions on the nature of scientific knowledge. A central issue is what defines a 'good' model. When addressing global properties of the…

History and Philosophy of Physics · Physics 2018-12-12 Martin Sahlén

This work proposes a view of probability as a relative measure rather than an absolute one. To demonstrate this concept, we focus on finite outcome spaces and develop three fundamental axioms that establish requirements for relative…

Machine Learning · Statistics 2023-05-30 Max Sklar

We introduce a new approach to modeling uncertainty based on plausibility measures. This approach is easily seen to generalize other approaches to modeling uncertainty, such as probability measures, belief functions, and possibility…

Artificial Intelligence · Computer Science 2016-08-31 Nir Friedman , Joseph Y. Halpern