In this paper, we discuss different models for human logic systems and describe a game with nature. Gödel‘s incompleteness theorem is taken into account to construct a model of logical networks based on axioms obtained by symmetry breaking. These classical logic networks are then coupled using rules that depend on whether two networks contain axioms or anti-axioms. The social lattice of axiom b...

We give an affirmative answer to Brendle’s and Hrušák’s question of whether the club principle together with h > א1 is consistent. We work with a class of axiom A forcings with countable conditions such that q ≥n p is determined by finitely many elements in the conditions p and q and that all strengthenings of a condition are subsets, and replace many names by actual sets. There are two types o...

Proof. Without loss of generality, we only need to prove for the case s= 1, as ρ satisfies Axioms A1-A5 if and only if 1 s ρ satisfies Axioms A1-A5 (with s= 1 in Axiom A3). The “only if” part. First, we show that (2) holds for any X ∈L∞(Ω,F , P ). Define the set function ν(E) := ρ(1E),E ∈F . Then, it follows from Axiom A2 and A3 that ν is monotonic, ν(∅) = 0, and ν(Ω) = 1. ForM ≥ 1, define LM :...

We present instances of the following phenomenon: if a product of topological spaces satisfies some given compactness property then the factors satisfy a stronger compactness property, except possibly for a small number of factors. The first known result of this kind, a consequence of a theorem by A. H. Stone, asserts that if a product is regular and Lindelöf then all but at most countably many...

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...

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...