Related papers: Norms on possibilities I: forcing with trees and c…
The tree forcing method given by (Liu 2015) enables the cone avoiding of strong enumeration of a given tree, within a subset or co-subset of an arbitrary given set, provided the given tree does not admit computable strong enumeration. Using…
We introduce the forcing property "almost strong properness" which sits between properness and strong properness. As an application, we introduce a simple forcing with finite conditions to force $\rm MRP$.
We outline a portfolio of novel iterable properties of c.c.c. and proper forcing notions and study its most important instantiations, Y-c.c. and Y-properness. These properties have interesting consequences for partition-type forcings and…
This article introduces a line of investigation into connections between creature forcings and topological Ramsey spaces. Three examples of sets of pure candidates for creature forcings are shown to contain dense subsets which are actually…
This expository paper, aimed at the reader without much background in set theory or logic, gives an overview of Cohen's proof (via forcing) of the independence of the continuum hypothesis. It emphasizes the broad outlines and the intuitive…
We examine the existence (and mostly non-existence) of fresh sets in commonly used iterations of Prikry type forcing notions. Results of [4] are generalized. As an application, a question of a referee of [9] is answered. In addition…
We provide a formal, simple and intuitive theory of rational decision making including sequential decisions that affect the environment. The theory has a geometric flavor, which makes the arguments easy to visualize and understand. Our…
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.
This paper develops the model theory of normal modal logics based on partial "possibilities" instead of total "worlds," following Humberstone (1981) instead of Kripke (1963). Possibility semantics can be seen as extending to modal logic the…
In the last years there has been a growing interest in the study of learning problems associated with algebraic structures. The framework we use models the scenario in which a learner is given larger and larger fragments of a structure from…
Bayesian inference is limited in scope because it cannot be applied in idealized contexts where none of the hypotheses under consideration is true and because it is committed to always using the likelihood as a measure of evidential…
We introduce a new rule-based optimization method for classification with constraints. The proposed method leverages column generation for linear programming, and hence, is scalable to large datasets. The resulting pricing subproblem is…
This dissertation surveys several topics in the general areas of iterated forcing, infinite combinatorics and set theory of the reals. There are two parts. In the first half I consider alternative versions of the Cicho\'n diagram. First I…
Abstract argumentation provides us with methods such as gradual and Dung semantics with which to evaluate arguments after potential attacks by other arguments. Some of these methods can take intrinsic strengths of arguments as input, with…
We present a general framework for forcing on $\omega_2$ with finite conditions using countable models as side conditions. This framework is based on a method of comparing countable models as being membership related up to a large initial…
We develop a forcing framework based on the idea of amalgamating language fragments into a theory with a canonical term model. We then demonstrate the usefulness of this framework by applying it to variants of the extended Namba problem, as…
The problem of maximizing the $p$-th power of a $p$-norm over a halfspace-presented polytope in $\R^d$ is a convex maximization problem which plays a fundamental role in computational convexity. It has been shown in 1986 that this problem…
In this paper, we establish an analogue of Craig Interpolation Property for a many-sorted variant of first-order hybrid logic. We develop a forcing technique that dynamically adds new constants to the underlying signature in a way that…
Quantifying the usefulness of individual features in random forests learning can greatly enhance its interpretability. Existing studies have shown that some popularly used feature importance measures for random forests suffer from the bias…
We show if we use countable support iteration of forcing notions not adding reals that satisfy additional conditions, then the limit forcing does not add reals. As a result we prove that we can amalgamate two earlier methods and prove the…