Related papers: A null ideal for inaccessibles
The probabilistic reachability problems of nondeterministic systems are studied. Based on the existing studies, the definition of probabilistic reachable sets is generalized by taking into account time-varying target set and obstacle. A…
The forcing theorem is the most fundamental result about set forcing, stating that the forcing relation for any set forcing is definable and that the truth lemma holds, that is everything that holds in a generic extension is forced by a…
The lottery preparation, a new general kind of Laver preparation, works uniformly with supercompact cardinals, strongly compact cardinals, strong cardinals, measurable cardinals, or what have you. And like the Laver preparation, the lottery…
Let $\kappa$ be an infinite cardinal. Then, forcing with $\mathbb{R}(\kappa)$$\times$$\mathbb{R}(\kappa)$ adds a generic filter for $\mathbb{C}(\kappa);$ where $\mathbb{R}(\kappa)$ and $\mathbb{C}(\kappa)$ are the forcing notions for adding…
This work is a part of my upcoming thesis [7]. We establish an equiconsistency between (1) weak indestructibility for all $\kappa +2$-degrees of strength for cardinals $\kappa $ in the presence of a proper class of strong cardinals, and (2)…
We investigate the question of when free structures of infinite rank (in a variety) possess model-theoretic properties like categoricity in higher power, saturation, or universality. Concentrating on left $R$-modules we show, among other…
Given a cardinal $\lambda$, category forcing axioms for $\lambda$-suitable classes $\Gamma$ are strong forcing axioms which completely decide the theory of the Chang model $\mathcal C_\lambda$, modulo generic extensions via forcing notions…
In this article we present a technique for selecting models of set theory that are complete in a model-theoretic sense. Specifically, we will apply Robinson infinite forcing to the collections of models of ZFC obtained by Cohen forcing.…
In the context of generalized descriptive set theory, we systematically compare and analyze various notions of Polish-like spaces and standard $\kappa$-Borel spaces for $\kappa$ an uncountable (regular) cardinal satisfying $\kappa^{<\kappa}…
We construct a model in which all $C$-sequences are trivial, yet there exists a $\kappa$-Souslin tree with full vanishing levels. This answers a question of Lambie-Hanson and Rinot, and provides an optimal combination of compactness and…
Given an inner model $W \subset V$ and a regular cardinal $\kappa$, we consider two alternatives for adding a subset to $\kappa$ by forcing: the Cohen poset $Add(\kappa,1)$, and the Cohen poset of the inner model $Add(\kappa,1)^W$. The…
We present a notion of forcing that can be used, in conjunction with other results, to show that there is a Martin-L\"of random set X such that X does not compute 0' and X computes every K-trivial set.
A space X is kappa-resolvable (resp. almost kappa-resolvable) if it contains kappa dense sets that are pairwise disjoint (resp. almost disjoint over the ideal of nowhere dense subsets of X). Answering a problem raised by Juhasz, Soukup, and…
Motivated in part by an observation that the zero forcing number for the complement of a tree on $n$ vertices is either $n-3$ or $n-1$ in one exceptional case, we consider the zero forcing number for the complement of more general graphs…
We study the dynamics of systems on networks from a linear algebraic perspective. The control theoretic concept of controllability describes the set of states that can be reached for these systems. Under appropriate conditions, there is a…
We formalize an existing computability-theoretic method of presenting first-order structures whose domains have the cardinality of the continuum. Work using these methods until now has emphasized their topological properties. We shift the…
Can there be a structure space-type theory for an arbitrary class of ideals of a ring? The ideal spaces introduced in this paper allows such a study and our theory includes (but not restricted to) prime, maximal, minimal prime, strongly…
A central theme in set theory is to find universes with extreme, well-understood behaviour. The case we are interested in is assuming GCH and has a strong forcing axiom of higher order than usual. Instead of "for every suitable forcing…
With each of the usual tree forcings I (e.g., I = Sacks forcing S, Laver forcing L, Miller forcing M, Mathias forcing R, etc.) we associate a sigma--ideal i^0 on the reals as follows: A \in i^0 iff for all T \in I there is S \leq T (i.e. S…
In this paper, controllability of systems defined on graphs is discussed. We consider the problem of controllability of the network for a family of matrices carrying the structure of an underlying directed graph. A one-to-one correspondence…