Strongly Unfoldable Cardinals Made Indestructible by Thomas A. Johnstone Advisor: Joel David Hamkins I provide indestructibility results for weakly compact, indescribable and strongly unfoldable cardinals. In order to make these large cardinals indestructible, I assume the existence of a strongly unfoldable cardinal κ, which is a hypothesis consistent with V = L. The main result shows that any ...

This paper contributes to the literature of pro-poor growth measurement by introducing a growth-rate consistency axiom. The axiom states that if one growth pattern is judged to be more pro-poor than another growth pattern at a given growth rate, then the pro-poor ranking between the two growth patterns should remain the same at a higher growth rate. We show that summary pro-poor measures such a...

We saw the following in the previous lecture.

When dealing with modern big data sets, a very common theme is reducing the set through a random process. These generally work by making “many simple estimates” of the full data set, and then judging them as a whole. Perhaps magically, these “many simple estimates” can provide a very accurate and small representation of the large data set. The key tool in showing how many of these simple estima...

4 Axioms of ZFC 7 4.1 Axiom of extensionality . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 7 4.2 Axiom of the empty set . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 7 4.3 Axiom of unordered pairs . . . . . . . . . . . . . . . . . . . . . . . . . . . . 7 4.4 Axiom of union . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 8 4.5 Axiom of infinity . . ...

In this paper, we present a hypergraph-based inference method for conditional independence. Our method allows us to obtain several interesting results on graph combination. In particular, our hypergraph approach allows us to strengthen one result obtained in a conventional graph-based approach. We also introduce a new inference axiom, called combination, of which the contraction axiom is a spec...

1 Three Axioms for a Determinant Function Let d be a scalar-valued function on the space Mn×n of all n×n matrices. Let A1, A2, . . . , An be the n rows of an n×n matrix A. We will denote the value d(A) of A under the function d as d(A) = d(A1, A2, . . . , An), indicating that d is a scalar-valued function of n n-dimensional row vectors A1, A2, . . . , An. The scalar-valued function d is called ...