SearcharxivSearch

arXiv · 1406.2039

Categorical concepts and their generalization by means of game theory (german: Kategorien-Konzepte und ihre spieltheoretische Verallgemeinerung)

Abstract

This paper deals with different concepts for characterizing the size of mathematical objects. A game theoretic investigation and generalization of two size concepts, which can both be formulated in topological terms, is provided: the so called "Baire category" and the "$σ$-category". This is mainly done by means of (generalized) Banach-Mazur games using the Axiom of determinacy (the inconsistency of AC and AD is reflected in the beginning and a weaker form of AC is chosen for proofs). Analogue versions of Cantor-Bendixson and Heine-Borel are proofed as well as some definability results. Such size concepts are established f.i. in measure and integration theory, set theory and topology often leading to mathematically precise formulations of "fuzziness". In measure and integration theory f.i. one defines for a "measure space" $(Ω, \underline{A}, μ)$ - i.e. $Ω$ is a non empty set, $\underline{A}$ a $σ$-algebra on $Ω$ and $μ$ a measure on $(Ω,\underline{A})$ - and a property $E \subset Ω$ of elements of $Ω$, that the property $E$ is valid in a set $A\in\underline{A}$ "$μ$-almost everywhere", if $E$ is true in $A$ up to a "$μ$-null set" - i.e. $\exists N\in\underline{A}{ } (μ(N)=0 \wedge A\cap N^\complement \subset E)$. This is crucial for the formulation of uniqueness statements in measure and integration theory as its theorems usually only apply up to "small" ($μ$-null) sets. Key words: Axiom of choice AC, Axiom of determinacy AD, Baire category theorem, Baire property, Baire space, Banach-Mazur games, Borel hierachy, Cantor-Bendixson, definability, Gale-Stewart, Heine-Borel, Lusin hierarchy, meager sets, perfect set property, polish spaces, projective hierarchy, sigma bounded sets, sigma compact sets, superperfect sets, topological games, winning strategy

Explore related subjects

Keep this discovery

BibTeXRIS

Falko Weigt. 2014-06-08. Categorical concepts and their generalization by means of game theory (german: Kategorien-Konzepte und ihre spieltheoretische Verallgemeinerung). https://arxiv.org/abs/1406.2039

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

There is no maximal $K$-degree

The Kolmogorov complexity of a string characterize how complex it is to describe the string. If every prefix of a real $x$ is more complex to describe than every prefix (of the same length) of real $y$, then it is seen as $x$ is more complex to describe than $y$. It is wondered if there is a real $x$ so that no other reals are strictly more complex (to describe) than $x$. The behavior of Kolmogorov complexity functions generated by reals (namely $n\mapsto$ the minimal description length of the real) is quite chaos. Therefore, it is widely believed that there are many reals that are maximally complex to describe. For instance, it is conjectured that all random enough reals have maximal $K$-degree. In this paper, it is shown that there is no real with maximal $K$-degree. Actually, for almost all real $x$, we can uniformly computably find another real whose $K$-degree is strictly above $x$.

math.LO

Quadruples and cubes

We prove, in $\mathsf{ZFC}$, that the $\lambda$-terraced cube relation fails whenever $\lambda$ is an uncountable cardinal. The corresponding terraced relation for quadruples fails for every $\lambda$. If $\lambda$ is $\aleph_0$ then the pretinent terraced relation has consistency strength of at least one Woodin cardinal. We prove positive polarized relations at a successor and a double successor from wondrous ideals. We show, however, that there are no such ideals over two consecutive cardinals simultaneously.

math.LO

Possibilistic Logic over a Logic of Formal Inconsistency

In this article, we have introduced a new possibilistic logic on a logic of formal inconsistency with the aim of developing a possibility theoretic framework to deal with uncertainty and inconsistency meaningfully without leading to a system collapse. We have discussed the syntax and semantics for this logic and have proved the soundness and completeness theorems. A set of new measures of consistency, contradictoriness, and triviality of a set of formulas have been defined. These have then been put to use in an example to show that this framework can provide better means of machine reasoning.

math.LO