We show that Miller partition forcing preserves selective independent families and P-points, which implies the consistency of $\mbox {cof}(\mathcal {N})=\mathfrak {a}=\mathfrak {u}=\mathfrak {i}<\mathfrak {a}_T=\omega _2$. In addition, we show that Shelah’s poset for destroying the maximality of a given maximal ideal preserves tight mad families and so we establish the consistency of $\mbox {cof}(\mathcal {N})=\mathfrak {a}=\mathfrak {i}=\omega _1<\mathfrak {u}=\mathfrak {a}_T=\omega _2$.

There exist two main notions of typicality in computability theory, namely, Cohen genericity and randomness. In this article, we introduce a new notion of genericity, called partition genericity, which is at the intersection of these two notions of typicality, and show that many basis theorems apply to partition genericity. More precisely, we prove that every co-hyperimmune set and every Kurtz random is partition generic, and that every partition generic set admits weak infinite subsets, for various notions (...) of weakness. In particular, we answer a question of Kjos-Hanssen and Liu by showing that every Kurtz random admits an infinite subset which does not compute any set of positive effective Hausdorff dimension. Partition genericity is a partition regular notion, so these results imply many existing pigeonhole basis theorems. (shrink)

Nineteenth and twentieth century philosophies of science have consistently failed to identify any rational basis for the compelling character of scientific analogies. This failure is particularly worrisome in light of the fact that the development and diffusion of certain scientific analogies, e.g. Darwin’s analogy between domestic breeds and naturally occurring species, constitute paradigm cases of good science. It is argued that the interactivist model, through the notion of a partition epistemology, provides a way to understand the persuasive character of (...) compelling scientific analogies without consigning them to an irrational or arational context of discovery. (shrink)

This work is a study of Plato's ethical theory and in particular his paradoxical theses that virtue is knowledge and vice is ignorance and that no one voluntarily does evil. In the opening chapters O'Brien discusses Plato's debt to Homer and Hesiod and to the historians and tragedians. The succeeding chapters are devoted to an analysis of the ethical doctrines of over a dozen dialogues ranging from the Apology to the Laws. The principles of interpretation employed in the analysis are: (...) 1) each doctrine must be understood in relation to every other as well as to the whole, 2) we must give a literary analysis of the dialogues in addition to a textual and philosophical one, since Plato often prefers to suggest his view through his literary art rather than give them explicit statement, and 3) statements must be interpreted in context. From an application of these principles, Professor O'Brien concludes that Plato's ethical theory constitutes a unified set of doctrines. Elements which are often thought to be antithetic, i.e., the Socratic paradoxes and the partition of the soul, are seen to be complementary. The one affirms the rational unity of human nature and action and the other, the irrational multiplicity of both. In his words, they affirm "... virtue is knowledge, and it is more than knowledge." The book contains a long bibliography and an extensive index of topics discussed and texts cited. As a result, O'Brien's view on nearly every topic and text is readily accessible.—O. J. L. (shrink)

Partitioner algebras are defined by Baumgartner and Weese 619) as a natural tool for studying the properties of maximal almost disjoint families of subsets of ω. We prove from PFA+ and that there exists a partitioner algebra which contains a subalgebra which is not representable as a partitioner algebra.

This is a re-look at the (Indian) Partition event through the lens of Advaita Vedanta.

For an infinite cardinal K a stronger version of K-distributivity for Boolean algebras, called k-partition completeness, is defined and investigated . It is shown that every k-partition complete Boolean algebra is K-weakly representable, and for strongly inaccessible K these concepts coincide. For regular K ≥ u, it is proved that an atomless K-partition complete Boolean algebra is an updirected union of basic K-tree algebras. Using K-partition completeness, the concept of γ-almost compactness is introduced for γ ≥ (...) K. For strongly inaccessible K we show that K is K-almost compact iff K is weakly compact, and if K is 2K-almost compact, then K is measurable. Further K is strongly compact iff it is γ-almost compact for all γ ≥ K. (shrink)

Classical physics and quantum physics suggest two meta-physical types of reality: the classical notion of a objectively definite reality with properties "all the way down," and the quantum notion of an objectively indefinite type of reality. The problem of interpreting quantum mechanics is essentially the problem of making sense out of an objectively indefinite reality. These two types of reality can be respectively associated with the two mathematical concepts of subsets and quotient sets which are category-theoretically dual to one another (...) and which are developed in two dual mathematical logics, the usual Boolean logic of subsets and the more recent logic of partitions. Our sense-making strategy is "follow the math" by showing how the mathematics of set partitions can be transported in a natural way to complex vector spaces where it yields the mathematical machinery of QM. And then we show how the machinery of QM can be transported the other way down to set-like vector spaces over ℤ₂ yielding a rather fulsome "toy" or pedagogical model of "quantum mechanics over sets." In this way, we try to make sense out of objective indefiniteness and thus to interpret quantum mechanics. (shrink)

Classical physics and quantum physics suggest two meta-physical types of reality: the classical notion of a objectively definite reality with properties "all the way down," and the quantum notion of an objectively indefinite type of reality. The problem of interpreting quantum mechanics (QM) is essentially the problem of making sense out of an objectively indefinite reality. These two types of reality can be respectively associated with the two mathematical concepts of subsets and quotient sets (or partitions) which are category-theoretically dual (...) to one another and which are developed in two mathematical logics, the usual Boolean logic of subsets and the more recent logic of partitions. Our sense-making strategy is "follow the math" by showing how the logic and mathematics of set partitions can be transported in a natural way to Hilbert spaces where it yields the mathematical machinery of QM--which shows that the mathematical framework of QM is a type of logical system over ℂ. And then we show how the machinery of QM can be transported the other way down to the set-like vector spaces over ℤ₂ showing how the classical logical finite probability calculus (in a "non-commutative" version) is a type of "quantum mechanics" over ℤ₂, i.e., over sets. In this way, we try to make sense out of objective indefiniteness and thus to interpret quantum mechanics. (shrink)

Subgraph matching on a large graph has become a popular research topic in the field of graph analysis, which has a wide range of applications including question answering and community detection. However, traditional edge-cutting strategy destroys the structure of indivisible knowledge in a large RDF graph. On the premise of load-balancing on subgraph division, a dominance-partitioned strategy is proposed to divide a large RDF graph without compromising the knowledge structure. Firstly, a dominance-connected pattern graph is extracted from a pattern graph (...) to construct a dominance-partitioned pattern hypergraph, which divides a pattern graph as multiple fish-shaped pattern subgraphs. Secondly, a dominance-driven spectrum clustering strategy is used to gather the pattern subgraphs into multiple clusters. Thirdly, the dominance-partitioned subgraph matching algorithm is designed to conduct all isomorphic subgraphs on a cluster-partitioned RDF graph. Finally, experimental evaluation verifies that our strategy has higher time-efficiency of complex queries, and it has a better scalability on multiple machines and different data scales. (shrink)

Current theories make a distinction between two types of case, STRUCTURAL case and INHERENT (or LEXICAL) case (Chomsky 1981), similar to the older distinction between GRAMMATICAL and SEMANTIC case (Kuryłowicz 1964).1 Structural case is assumed to be assigned at S-structure in a purely configurational way, whereas inherent case is assigned at D-structure in possible dependence on the governing predicates’s lexical properties. It is well known that not all cases fall cleanly into this typology. In particular, there is a class of (...) cases that pattern syntactically with the structural cases, but are semantically conditioned. These cases however depend on different semantic conditions than inherent cases do: instead of being sensitive to the thematic relation that the NP bears to the verbal predicate, they are sensitive to the NP’s definiteness, animacy, or quantificational properties, or to the aspectual character of the VP, or to some combination of these factors. The Finnish partitive is a particularly clear instance of this apparently hybrid category of semantically conditioned structural case. (shrink)

The connections between mathematical logic and combinatorics have a rich history. This paper focuses on one aspect of this relationship: understanding the strength, measured using the tools of computability theory and reverse mathematics, of various partition theorems. To set the stage, recall two of the most fundamental combinatorial principles, König's Lemma and Ramsey's Theorem. We denote the set of natural numbers by ω and the set of finite sequences of natural numbers by ω<ω. We also identify each n ∈ (...) ω with its set of predecessors, so n = {0, 1, 2, …, n − 1}. (shrink)

It is shown that for any cardinal $\kappa, \dbinom{(2^{ , and if κ is weakly compact $\dbinom{\kappa^+}{\kappa} \rightarrow \dbinom{\kappa}{\kappa}_{.

Several canonical partition theorems are obtained, including a simultaneous generalization of Neumer's lemma and the Erdos-Rado theorem. The canonical partition relation for infinite cardinals is completely determined, answering a question of Erdos and Rado. Counterexamples are given showing that in several ways these results cannot be improved.

Two partition-theorems are proved for a particular causal decision theory. One is restricted to a certain kind of partition of circumstances, and analyzes the utility of an option in terms of its utilities in conjunction with circumstances in this partition. The other analyzes an option's utility in terms of its utilities conditional on circumstances and is quite unrestricted. While the first form seems more useful for applications, the second form may be of theoretical importance in foundational exercises. (...) Comparisons are made with theorems of Richard Jeffrey, Brad Armendt, and Peter Fishburn. (shrink)

We consider colorings of the pairs of a family \ of topological type \, for \; and we find a homogeneous family \ for each coloring. As a consequence, we complete our study of the partition relation \^2_{l,m}}\) identifying \ as the smallest ordinal space \^2_{l,4}}\).

The goal of this short note is to interest set theorists in the order type ω*ω1, and to encourage them to work on the question of whether or not the Continuum Hypothesis decides the partition relation τ→2, for τ=ω*ω1 and for τ=ω1ω+2.

Grounding, understood as a primitive posit operative in contexts where metaphysical dependence is at issue, is not able on its own to do any substantive work in characterizing or illuminating metaphysical dependence---or so I argue in 'No Work for a Theory of Grounding' (Inquiry, 2014). Such illumination rather requires appeal to specific metaphysical relations---type or token identity, functional realization, the determinable-determinate relation, the mereological part-whole relation, and so on---of the sort typically at issue in these contexts. In that case, why (...) posit 'big-G' Grounding in addition to the 'small-g' grounding relations already in the metaphysician's toolkit? The best reasons for doing so stem from the Unity argument, according to which the further posit of Grounding is motivated as an apt unifier of the specific relations, and the Priority argument, according to which Grounding is needed in order to fix the direction of priority of the specific relations. I previously considered versions of these arguments, and argued that they did not succeed; in two papers, however, Jonathan Schaffer aims to develop a better version of the Unity argument, and offers certain objections to my reasons for rejecting the Priority argument. Here I consider these new arguments for Grounding. (shrink)

The literature on conditionals is rife with alternate formulations of the abstract semantics of conditional logic. Each formulation has its own advantages in terms of applications and generalizations; nevertheless, they are for the most part equivalent, in the sense that they underwrite the same range of logical systems. The purpose of the present note is to bring under this umbrella the partition semantics introduced by Brian Skyrms in (Skyrms, 1984).

We investigate the following weak Ramsey property of a cardinal κ: If χ is coloring of nodes of the tree κ <ω by countably many colors, call a tree ${T \subseteq \kappa^{ < \omega}}$ χ-homogeneous if the number of colors on each level of T is finite. Write ${\kappa \rightsquigarrow (\lambda)^{ < \omega}_{\omega}}$ to denote that for any such coloring there is a χ-homogeneous λ-branching tree of height ω. We prove, e.g., that if ${\kappa < \mathfrak{p}}$ or ${\kappa > \mathfrak{d}}$ (...) is regular, then ${{\kappa \rightsquigarrow (\kappa)^{ < \omega}_{\omega}}}$ and that ${\mathfrak{b}}$ ${(\mathfrak{b})^{ < \omega}_{\omega}}$ and ${\mathfrak{d}}$ ${(\mathfrak{d})^{ < \omega}_{\omega}}$ . The arrow is applied to prove a generalization of a theorem of Hurewicz: A Čech-analytic space is σ-locally compact iff it does not contain a closed homeomorphic copy of irrationals. (shrink)

Partitions and their Afterlives engages with political partitions and how their aftermath affects the contemporary life of nations and their citizens.

We continue [21] and study partition numbers of partial orderings which are related to /fin. In particular, we investigate Pf, be the suborder of /fin)ω containing only filtered elements, the Mathias partial order M, and , ω the lattice of partitions of ω, respectively. We show that Solomon's inequality holds for M and that it consistently fails for Pf. We show that the partition number of is C. We also show that consistently the distributivity number of ω is (...) smaller than the distributivity number of /fin. We also investigate partitions of a Polish space into closed sets. We show that such a partition either is countable or has size at least D, where D is the dominating number. We also show that the existence of a dominating family of size 1 does not imply that a Polish space can be partitioned into 1 many closed sets. (shrink)

The paper examines Schopenhauer’s complex diagrams from the Berlin Lectures of the 1820 s, which show certain partitions of classes. Drawing upon ideas and techniques from logical geometry, we show that Schopenhauer’s partition diagrams systematically give rise to a special type of Aristotelian diagrams, viz. (strong) α -structures.

This article makes an argument for Atlas Shrugged as a highly unified and integrated novel. All of the sections of the paper explain how integration and unity are embodied in Atlas Shrugged. Part one discusses the philosophical and literary structure of Rand’s masterpiece. The next section is concerned with issues of political economy. Section three then examines Rand’s techniques of characterization and character development as demonstrated in Atlas Shrugged. The following part analyzes the philosophical speeches. The final major part (...) considers Atlas Shrugged as a means for social change. The conclusion then discusses Atlas Shrugged as the manifestation of a fully-integrated philosophical novel. (shrink)

We consider several kinds of partition relations on the set ${\mathbb{R}}$ of real numbers and its powers, as well as their parameterizations with the set ${[\mathbb{N}]^{\mathbb{N}}}$ of all infinite sets of natural numbers, and show that they hold in some models of set theory. The proofs use generic absoluteness, that is, absoluteness under the required forcing extensions. We show that Solovay models are absolute under those forcing extensions, which yields, for instance, that in these models for every well ordered (...) partition of ${\mathbb{R}^\mathbb{N}}$ there is a sequence of perfect sets whose product lies in one piece of the partition. Moreover, for every finite partition of ${[\mathbb{N}]^{\mathbb{N}} \times \mathbb{R}^{\mathbb{N}}}$ there is ${X \in [\mathbb{N}]^{\mathbb{N}}}$ and a sequence ${\{P_{k} : k \in \mathbb{N}\}}$ of perfect sets such that the product ${[X]^{\mathbb{N}} \times \prod_{k}^{\infty}P_{k}}$ lies in one piece of the partition, where ${[X]^{\mathbb{N}}}$ is the set of all infinite subsets of X. The proofs yield the same results for Borel partitions in ZFC, and for more complex partitions in any model satisfying a certain degree of generic absoluteness. (shrink)