Search arXivSearch

arXiv · 2303.15264

Localizing the axioms

Abstract

We examine what happens if we replace ZFC with a localistic/relativistic system, LZFC, whose central new axiom, denoted by $Loc({\rm ZFC})$, says that every set belongs to a transitive model of ZFC. LZFC consists of $Loc({\rm ZFC})$ plus some elementary axioms forming Basic Set Theory (BST). Some theoretical reasons for this shift of view are given. All $\Pi_2$ consequences of ZFC are provable in ${\rm LZFC}$. LZFC strongly extends Kripke-Platek (KP) set theory minus $\Delta_0$-Collection and minus $\in$-induction scheme. ZFC+``there is an inaccessible cardinal'' proves the consistency of LZFC. In LZFC we focus on models rather than cardinals, a transitive model being considered as the analogue of an inaccessible cardinal. Pushing this analogy further we define $\alpha$-Mahlo models and $\Pi_1^1$-indescribable models, the latter being the analogues of weakly compact cardinals. Also localization axioms of the form $Loc({\rm ZFC}+\phi)$ are considered and their global consequences are examined. Finally we introduce the concept of standard compact cardinal (in ZFC) and some standard compactness results are proved.

Explore related subjects

Keep this discovery

BibTeXRIS

Athanassios Tzouvaras. 2023-03-27. Localizing the axioms. https://doi.org/10.1007/s00153-010-0188-5

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