Related papers: Forcing as a Local Method of Accessing Small Exten…
The purpose of this article is to give a presentation of the method of forcing aimed at someone with a minimal knowledge of set theory and logic. The emphasis will be on how the method can be used to prove theorems in ZFC.
In light of the celebrated theorem of Vop\v{e}nka (1972), proving in ZFC that every set is generic over HOD, it is natural to inquire whether the set-theoretic universe $V$ must be a class-forcing extension of HOD by some possibly…
In this note, we find a sharp bound for the minimal number (or in general, indexing set) of subspaces of a fixed (finite) codimension needed to cover any vector space V over any field. If V is a finite set, this is related to the problem of…
This paper deals with formulas of set theory which force the infinity. For such formulas, we provide a technique to infer satisfiability from a finite assignment.
In this paper, we investigate connections between structures present in every generic extension of the universe $V$ and computability theory. We introduce the notion of {\em generic Muchnik reducibility} that can be used to to compare the…
The foundations of forcing theory are reworked to streamline the presentation and to show how the most basic results are applicable in very general contexts.
We investigate how set-theoretic forcing can be seen as a computational process on the models of set theory. Given an oracle for information about a model of set theory $\langle M,\in^M\rangle$, we explain senses in which one may compute…
We investigate the partial orderings of the form (P(X),\subset), where X is a relational structure and P(X) the set of the domains of its isomorphic substructures. A rough classification of countable binary structures corresponding to the…
We formalize the theory of forcing in the set theory framework of Isabelle/ZF. Under the assumption of the existence of a countable transitive model of ZFC, we construct a proper generic extension and show that the latter also satisfies…
In the present paper we are interested in simple forcing notions and Forcing Axioms. A starting point for our investigations was the article [JR1] in which several problems were posed. We answer some of those problems here.
The question if a given partial solution to a problem can be extended reasonably occurs in many algorithmic approaches for optimization problems. For instance, when enumerating minimal dominating sets of a graph $G=(V,E)$, one usually…
In this article we undertake a study of extension complexity from the perspective of formal languages. We define a natural way to associate a family of polytopes with binary languages. This allows us to define the notion of extension…
Recent work in set theory indicates that there are many different notions of 'set', each captured by a different collection of axioms, as proposed by J. Hamkins in [Ham11]. In this paper we strive to give one class theory that allows for a…
The aim of these lectures is to give a short introduction to forcing. We will avoid metamathematical issues as much as possible and similarly we will avoid performing the actual construction of forcing. We assume familiarity with basic…
Argumentation frameworks, consisting of arguments and an attack relation representing conflicts, are fundamental for formally studying reasoning under conflicting information. We use methods from mathematical logic, specifically…
This is an introduction to the set-theoretic method of forcing, including its application in proving the independence of the Continuum Hypothesis from the Zermelo-Fraenkel axioms of set theory. I presuppose no particular mathematical…
In previous papers on this project a general static logical framework for formalizing and mechanizing set theories of different strength was suggested, and the power of some predicatively acceptable theories in that framework was explored.…
We investigate the parameterised complexity of the classic coverability problem for vector addition systems (VAS): given a finite set of vectors $V \subseteq\mathbb{Z}^d$, an initial configuration $s\in\mathbb{N}^d$, and a target…
A central area of current philosophical debate in the foundations of mathematics concerns whether or not there is a single, maximal, universe of set theory. Universists maintain that there is such a universe, while Multiversists argue that…
Partial descriptions of the Universe are presented in the form of linear equations considered in the free (full, super) Fock space. The universal properties of these equations are discussed. The closure problem caused by computational and…