SearcharxivSearch

arXiv · 1510.00719

Topological Forcing Semantics with Settling

Abstract

It was realized early on that topologies can model constructive systems, as the open sets form a Heyting algebra. After the development of forcing, in the form of Boolean-valued models, it became clear that, just as over ZF any Boolean-valued model also satisfies ZF, so do Heyting-valued models satisfy IZF, which stands for Intuitionistic ZF, the most direct constructive re-working of the ZF axioms. In this paper, we return to topologies, and introduce a variant model, along with a correspondingly revised forcing or satisfaction relation. The purpose is to prove independence results related to weakenings of the Power Set axiom. The original motivation is earlier work, based on the set of reals, which shows that Exponentiation, in the context of CZF minus Subset Collection, does not suffice to prove that the Dedekind reals form a set. The current semantics is the generalization of that model from R to an arbitrary topological space. It is investigated which set-theoretic principles hold in such models in general. In addition, natural properties of the underlying topological space are shown to imply the validity of stronger such principles.

Explore related subjects

Keep this discovery

BibTeXRIS

Robert Lubarsky. 2015-10-02. Topological Forcing Semantics with Settling. https://doi.org/10.1016/j.apal.2011.09.014

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