The developmental properties of organisms play important roles in the generation of variation necessary for evolutionary change. But how can individual development steer the course of evolution? To answer this question, we introduce developmental channeling as a disposition of individual organisms that shapes their possible developmental trajectories and evolutionary dappling as an evolutionary outcome in which the space of possible organismic forms is dappled—it is only partially filled. We then trace out the implications of the channeling-dappling framework for contemporary debates (...) in the philosophy of evolution, including evolvability, reciprocal causation, and the extended evolutionary synthesis. (shrink)

We study model theoretic tree properties and their associated cardinal invariants. In particular, we obtain a quantitative refinement of Shelah’s theorem for countable theories, show that [Formula: see text] is always witnessed by a formula in a single variable and that weak [Formula: see text] is equivalent to [Formula: see text]. Besides, we give a characterization of [Formula: see text] via a version of independent amalgamation of types and apply this criterion to verify that some examples in the literature are (...) indeed [Formula: see text]. (shrink)

There are three related criteria that a concept of fitness should be able to meet: it should render the principle of natural selection non-tautologous and it should be explanatory and predictive. I argue that for fitness to be able to fulfill these criteria, it cannot be a property that changes over the course of an individual's life. Rather, I introduce a fitness concept--Block Fitness--and argue that an individual's genes and environment fix its fitness in such a way that each (...) individual's fitness has a fixed value over its lifetime. (shrink)

In this paper, I argue (contra some recent philosophical work) that an objective distinction between natural selection and drift can be drawn. I draw this distinction by conceiving of drift, in the most fundamental sense, as an individual-level phenomenon. This goes against some other attempts to distinguish selection from drift, which have argued either that drift is a population-level process or that it is a population-level product. Instead of identifying drift with population-level features, the account introduced here can explain these (...) population-level features based on a property that I label driftability. Additionally, this account shows that biology’s “first law”—the Principle of Drift (Brandon, J Phil 102(7):319–335 2006)—is not a foundational law, but is a consequence of driftability. (shrink)

Innovation is a key component of most definitions of culture and intelligence. Additionally, innovations may affect a species' ecology and evolution. Nonetheless, conceptual and empirical work on innovation has only recently begun. In particular, largely because the existing operational definition (first occurrence in a population) requires long-term studies of populations, there has been no systematic study of innovation in wild animals. To facilitate such study, we have produced a new definition of innovation: Innovation is the process that generates in an (...) individual a novel learned behavior that is not simply a consequence of social learning or environmental induction. Using this definition, we propose a new operational approach for distinguishing innovations in the field. The operational criteria employ information from the following sources: (1) the behavior's geographic and local prevalence and individual frequency; (2) properties of the behavior, such as the social role of the behavior, the context in which the behavior is exhibited, and its similarity to other behaviors; (3) changes in the occurrence of the behavior over time; and (4) knowledge of spontaneous or experimentally induced behavior in captivity. These criteria do not require long-term studies at a single site, but information from multiple populations of a species will generally be needed. These criteria are systematized into a dichotomous key that can be used to assess whether a behavior observed in the field is likely to be an innovation. (shrink)

Biological fitness is a foundational concept in the theory of natural selection. Natural selection is often defined in terms of fitness differences as “any consistent difference in fitness (i.e., survival and reproduction) among phenotypically different biological entities” (Futuyma 1998, 349). And in Lewontin’s (1970) classic articulation of the theory of natural selection, he lists fitness differences as one of the necessary conditions for evolution by natural selection to occur. Despite this foundational position of fitness, there remains much debate over the (...) nature of fitness, especially whether fitness differences can truly be said to cause evolutionary change. In recent years these debates have crystalized into two camps: (1) causalists, who see fitness differences as being one of the causes of evolutionary change, and (2) statisticalists, who deny the causal efficacy of fitness and instead hold that “fitness is a mere statistical, noncausal property of trait types” (Walsh 2010, 148). (shrink)

In this article we give a forcing characterization for the Ramsey property of Σ 1 2 -sets of reals. This research was motivated by the well-known forcing characterizations for Lebesgue measurability and the Baire property of Σ 1 2 -sets of reals. Further we will show the relationship between higher degrees of forcing absoluteness and the Ramsey property of projective sets of reals.

We review some known results about the Ramsey property for partitions of reals, and we present a certain two-person game such that if either player has a winning strategy then a homogeneous set for the partition can be constructed, and conversely. This gives alternative proofs of some of the known results. We then discuss possible uses of the game in obtaining effective versions of Ramsey's theorem and prove a theorem along these lines.

We investigate the notion of a semi-retraction between two first-order structures (in typically different signatures) that was introduced by the second author as a link between the Ramsey property and generalized indiscernible sequences. We look at semi-retractions through a new lens establishing transfers of the Ramsey property and finite Ramsey degrees under quite general conditions that are optimal as demonstrated by counterexamples. Finally, we compare semi-retractions to the category theoretic notion of a pre-adjunction.

A partial ordering $\mathbb{P}$ is $n$-Ramsey if, for every coloring of $n$-element chains from $\mathbb{P}$ in finitely many colors, $\mathbb{P}$ has a homogeneous subordering isomorphic to $\mathbb{P}$. In their paper on Ramsey properties of the complete binary tree, Chubb, Hirst, and McNicholl ask about Ramsey properties of other partial orderings. They also ask whether there is some Ramsey property for pairs equivalent to $\mathit{ACA}_{0}$ over $\mathit{RCA}_{0}$. A characterization theorem for finite-level partial orderings with Ramsey (...) properties has been proven by the second author. We show, over $\mathit{RCA}_{0}$, that one direction of the equivalence given by this theorem is equivalent to $\mathit{ACA}_{0}$, and the other is provable in $\mathit{ATR}_{0}$. We answer Chubb, Hirst, and McNicholl’s second question by showing that there is a primitive recursive partial ordering $\mathbb{P}$ such that, over $\mathit{RCA}_{0}$, “$\mathbb{P}$ is 2-Ramsey” is equivalent to $\mathit{ACA}_{0}$. (shrink)

In this article we compare the well-known Ramsey property with a dual form of it, the so called dual-Ramsey property (which was suggested first by Carlson and Simpson). Even if the two properties are different, it can be shown that all classical results known for the Ramsey property also hold for the dual-Ramsey property. We will also show that the dual-Ramsey property is closed under a generalized Suslin operation (the similar (...) result for the Ramsey property was proved by Matet). Further we compare two notions of forcing, the Mathias forcing and a dual form of it, and will give some symmetries between them. Finally we give some relationships between the dual-Mathias forcing and the dual-Ramsey property. (shrink)

We consider${\cal S}$, the class of finite semilattices;${\cal T}$, the class of finite treeable semilattices; and${{\cal T}_m}$, the subclass of${\cal T}$which contains trees with branching bounded bym. We prove that${\cal E}{\cal S}$, the class of finite lattices with linear extensions, is a Ramsey class. We calculate Ramsey degrees for structures in${\cal S}$,${\cal T}$, and${{\cal T}_m}$. In addition to this we give a topological interpretation of our results and we apply our result to canonization of linear orderings on finite (...) semilattices. In particular, we give an example of a Fraïssé class${\cal K}$which is not a Hrushovski class, and for which the automorphism group of the Fraïssé limit of${\cal K}$is not extremely amenable but is uniquely ergodic. (shrink)

Mitchell, W.J., An infinitary Ramsey property, Annals of Pure and Applied Logic 57 151–160. We prove that the consistency of a measurable cardinal implies the consistency of a cardinal κ>+ satisfying the partition relations κ ω and κ ωregressive. This result follows work of Spector which uses the same hypothesis to prove the consistency of ω1 ω. We also give some examples of partition relations which can be proved for ω1 using the methods of Spector but cannot be (...) proved for cardinals κ>+ without a much stronger hypothesis. (shrink)

• We define a notion of order of indiscernibility type of a structure by analogy with Mitchell order on measures; we use this to define a hierarchy of strong axioms of infinity defined through normal filters, the α-weakly Erdős hierarchy. The filters in this hierarchy can be seen to be generated by sets of ordinals where these indiscernibility orders on structures dominate the canonical functions.• The limit axiom of this is that of greatly Erdős and we use it to calibrate (...) some strengthenings of the Chang property, one of which, CC+, is equiconsistent with a Ramsey cardinal, and implies that where K is the core model built with non-overlapping extenders — if it is rigid, and others which are a little weaker. As one corollary we have:TheoremIf then there is an inner model with a strong cardinal. • We define an α-Jónsson hierarchy to parallel the α-Ramsey hierarchy, and show that κ being α-Jónsson implies that it is α-Ramsey in the core model. (shrink)

In this paper we study the consistency strength of the theory $\mathbf\mathrm{ZFC} + (\exists\kappa \text{strong limit})(\forall\mu , and we prove the consistency of this theory relative to the consistency of the existence of a supercompact cardinal and an inaccessible above it.

We show, relative to the base theory RCA₀: A nontrivial tree satisfies Ramsey's Theorem only if it is biembeddable with the complete binary tree. There is a class of partial orderings for which Ramsey's Theorem for pairs is equivalent to ACA₀. Ramsey's Theorem for singletons for the complete binary tree is stronger than $B\sum_{2}^{0}$ , hence stronger than Ramsey's Theorem for singletons for ω. These results lead to extensions of results, or answers to questions, of Chubb, (...) Hirst, and McNicholl [3]. (shrink)

A general method for constructing a new class of topological Ramsey spaces is presented. Members of such spaces are infinite sequences of products of Fraïssé classes of finite relational structures satisfying the Ramsey property. The Product Ramsey Theorem of Sokič is extended to equivalence relations for finite products of structures from Fraïssé classes of finite relational structures satisfying the Ramsey property and the Order-Prescribed Free Amalgamation Property. This is essential to proving Ramsey-classification (...) theorems for equivalence relations on fronts, generalizing the Pudlák–Rödl Theorem to this class of topological Ramsey spaces. To each topological Ramsey space in this framework corresponds an associated ultrafilter satisfying some weak partition property. By using the correct Fraïssé classes, we construct topological Ramsey spaces which are dense in the partial orders of Baumgartner and Taylor generating p-points which are k-arrow but not \-arrow, and in a partial order of Blass producing a diamond shape in the Rudin-Keisler structure of p-points. Any space in our framework in which blocks are products of n many structures produces ultrafilters with initial Tukey structure exactly the Boolean algebra \\). If the number of Fraïssé classes on each block grows without bound, then the Tukey types of the p-points below the space’s associated ultrafilter have the structure exactly \. In contrast, the set of isomorphism types of any product of finitely many Fraïssé classes of finite relational structures satisfying the Ramsey property and the OPFAP, partially ordered by embedding, is realized as the initial Rudin-Keisler structure of some p-point generated by a space constructed from our template. (shrink)

Ramsey’s theorem asserts that every k-coloring of $[\omega ]^n$ admits an infinite monochromatic set. Whenever $n \geq 3$, there exists a computable k-coloring of $[\omega ]^n$ whose solutions compute the halting set. On the other hand, for every computable k-coloring of $[\omega ]^2$ and every noncomputable set C, there is an infinite monochromatic set H such that $C \not \leq _T H$. The latter property is known as cone avoidance.In this article, we design a natural class of (...) class='Hi'>Ramsey-like theorems encompassing many statements studied in reverse mathematics. We prove that this class admits a maximal statement satisfying cone avoidance and use it as a criterion to re-obtain many existing proofs of cone avoidance. This maximal statement asserts the existence, for every k-coloring of $[\omega ]^n$, of an infinite subdomain $H \subseteq \omega $ over which the coloring depends only on the sparsity of its elements. This confirms the intuition that Ramsey-like theorems compute Turing degrees only through the sparsity of its solutions. (shrink)

One of the numerous characterizations of a Ramsey cardinal κ involves the existence of certain types of elementary embeddings for transitive sets of size κ satisfying a large fragment of ZFC. We introduce new large cardinal axioms generalizing the Ramsey elementary embeddings characterization and show that they form a natural hierarchy between weakly compact cardinals and measurable cardinals. These new axioms serve to further our knowledge about the elementary embedding properties of smaller large cardinals, in particular those still (...) consistent with V = L. (shrink)

We show that a theory of autonomous iterated Ramseyness based on second order arithmetic (SOA) is proof-theoretically equivalent to ${\Pi^1_2}$ -comprehension. The property of Ramsey is defined as follows. Let X be a set of real numbers, i.e. a set of infinite sets of natural numbers. We call a set H of natural numbers homogeneous for X if either all infinite subsets of H are in X or all infinite subsets of H are not in X. X has (...) the property of Ramsey if there exists a set which is homogeneous for X. The property of Ramsey is considered in reverse mathematics to compare the strength of subsystems of SOA. To characterize the system of ${\Pi^1_2}$ -comprehension in terms of Ramseyness we introduce a system of autonomous iterated Ramseyness, called R-calculus. We augment the language of SOA with additional set terms (called R-terms) ${R\vec{x}X\phi(\vec{x},X)}$ for each first order formula ${\phi(\vec{x},X)}$ (where φ may contain further R-terms). The R-calculus is a system which comprises comprehension for all first order formulas (which may contain R-terms or other set parameters) and defining axioms for the R-terms which claim that for each ${\vec{x}}$ , we can remove finitely many elements from the set ${R\vec{x}X\phi(\vec{x},X)}$ such that the remaining set is homogeneous for ${\{{X}{\phi(\vec{x},X)\}}}$ . We show that the R-calculus proves the same ${\Pi^1_1}$ -sentences as the system of ${\Pi^1_2}$ -comprehension. (shrink)

We build a collection of topological Ramsey spaces of trees giving rise to universal inverse limit structures, extending Zheng’s work for the profinite graph to the setting of Fraïssé classes of finite ordered binary relational structures with the Ramsey property. This work is based on the Halpern-Läuchli theorem, but different from the Milliken space of strong subtrees. Based on these topological Ramsey spaces and the work of Huber-Geschke-Kojman on inverse limits of finite ordered graphs, we prove (...) that for each such Fraïssé class, its universal inverse limit structure has finite big Ramsey degrees under finite Baire-measurable colorings. For such Fraïssé classes satisfying free amalgamation as well as finite ordered tournaments and finite partial orders with a linear extension, we characterize the exact big Ramsey degrees. (shrink)

Given a topological Ramsey space math formula, we extend the notion of semiselective coideal to sets math formula and study conditions for math formula that will enable us to make the structure math formula a Ramsey space and also study forcing notions related to math formula which will satisfy abstract versions of interesting properties of the corresponding forcing notions in the realm of Ellentuck's space. This extends results from to the most general context of topological Ramsey spaces. (...) As applications, we prove that for every topological Ramsey space math formula, under suitable large cardinal hypotheses every semiselective ultrafilter math formula is generic over math formula; and that given a semiselective coideal math formula, every definable subset of math formula is math formula-Ramsey. This generalizes the corresponding results for the case when math formula is equal to Ellentuck's space. (shrink)

We study large cardinal properties associated with Ramseyness in which homogeneous sets are demanded to satisfy various transfinite degrees of indescribability. Sharpe and Welch [25], and independently Bagaria [1], extended the notion of $\Pi ^1_n$ -indescribability where $n<\omega $ to that of $\Pi ^1_\xi $ -indescribability where $\xi \geq \omega $. By iterating Feng’s Ramsey operator [12] on the various $\Pi ^1_\xi $ -indescribability ideals, we obtain new large cardinal hierarchies and corresponding nonlinear increasing hierarchies of normal ideals. We (...) provide a complete account of the containment relationships between the resulting ideals and show that the corresponding large cardinal properties yield a strict linear refinement of Feng’s original Ramsey hierarchy. We isolate Ramsey properties which provide strictly increasing hierarchies between Feng’s $\Pi _\alpha $ -Ramsey and $\Pi _{\alpha +1}$ -Ramsey cardinals for all odd $\alpha <\omega $ and for all $\omega \leq \alpha <\kappa $. We also show that, given any ordinals $\beta _0,\beta _1<\kappa $ the increasing chains of ideals obtained by iterating the Ramsey operator on the $\Pi ^1_{\beta _0}$ -indescribability ideal and the $\Pi ^1_{\beta _1}$ -indescribability ideal respectively, are eventually equal; moreover, we identify the least degree of Ramseyness at which this equality occurs. As an application of our results we show that one can characterize our new large cardinal notions and the corresponding ideals in terms of generic elementary embeddings; as a special case this yields generic embedding characterizations of $\Pi ^1_\xi $ -indescribability and Ramseyness. (shrink)

The author has previously shown that for a certain class of structures $\mathcal {I}$, $\mathcal {I}$-indexed indiscernible sets have the modeling property just in case the age of $\mathcal {I}$ is a Ramsey class. We expand this known class of structures from ordered structures in a finite relational language to ordered, locally finite structures which isolate quantifier-free types by way of quantifier-free formulas. This result is applied to give new proofs that certain classes of trees are Ramsey. (...) To aid this project we develop the logic of EM-types. (shrink)

We examine combinatorial aspects and consistency strength properties of almost Ramsey cardinals. Without the Axiom of Choice, successor cardinals may be almost Ramsey. From fairly mild supercompactness assumptions, we construct a model of ZF + ${\neg {\rm AC}_\omega}$ in which every infinite cardinal is almost Ramsey. Core model arguments show that strong assumptions are necessary. Without successors of singular cardinals, we can weaken this to an equiconsistency of the following theories: “ZFC + There is a proper class (...) of regular almost Ramsey cardinals”, and “ZF + DC + All infinite cardinals except possibly successors of singular cardinals are almost Ramsey”. (shrink)

We improve results of Marczewski, Frankiewicz, Brown, and others comparing the σ-ideals of measure zero, meager, Marczewski measure zero, and completely Ramsey null sets; in particular, we remove CH from the hypothesis of many of Brown's constructions of sets lying in some of these ideals but not in others. We improve upon work of Marczewski by constructing, without CH, a nonmeasurable Marczewski measure zero set lacking the property of Baire. We extend our analysis of σ-ideals to include the (...) completely Ramsey null sets relative to a Ramsey ultrafilter and obtain all 32 possible examples of sets in some ideals and not others, some under the assumption of MA, but most in ZFC alone. We also improve upon the known constructions of a Marczewski measure zero set which is not Ramsey by using a set theoretic hypothesis which is weaker than those used by other authors. We give several consistency proofs: one concerning the relative sizes of the covering numbers for the meager sets and the completely Ramsey null sets; another concerning the size of non(CRU 0); and a third concerning the size of add(CRU 0). We also study those classes of perfect sets which are bases for the class of always first category sets. (shrink)

This paper investigates properties of \(\sigma \) -closed forcings which generate ultrafilters satisfying weak partition relations. The Ramsey degree of an ultrafilter \({\mathcal {U}}\) for _n_-tuples, denoted \(t({\mathcal {U}},n)\), is the smallest number _t_ such that given any \(l\ge 2\) and coloring \(c:[\omega ]^n\rightarrow l\), there is a member \(X\in {\mathcal {U}}\) such that the restriction of _c_ to \([X]^n\) has no more than _t_ colors. Many well-known \(\sigma \) -closed forcings are known to generate ultrafilters with finite (...) class='Hi'>Ramsey degrees, but finding the precise degrees can sometimes prove elusive or quite involved, at best. In this paper, we utilize methods of topological Ramsey spaces to calculate Ramsey degrees of several classes of ultrafilters generated by \(\sigma \) -closed forcings. These include a hierarchy of forcings due to Laflamme which generate weakly Ramsey and weaker rapid p-points, forcings of Baumgartner and Taylor and of Blass and generalizations, and the collection of non-p-points generated by the forcings \({\mathcal {P}}(\omega ^k)/\mathrm {Fin}^{\otimes k}\). We provide a general approach to calculating the Ramsey degrees of these ultrafilters, obtaining new results as well as streamlined proofs of previously known results. In the second half of the paper, we calculate pseudointersection and tower numbers for these \(\sigma \) -closed forcings and their relationships with the classical pseudointersection number \({\mathfrak {p}}\). (shrink)

We canvas a number of past uses of Ramsey sentences which have yielded disappointing results, and then consider three very interesting recent attempts to deploy them for a Ramseyan Dialetheist theory of truth, a modal account of laws and theories, and a criterion for the existence of factual properties. We think that once attention is given to the specific kinds of theories that Ramsey had in mind, it becomes evident that their Ramsey sentences are not the best (...) ways of presenting those theories. (shrink)

Ramsey algebras are an attempt to investigate Ramsey spaces generated by algebras in a purely combinatorial fashion. Previous studies have focused on the basic properties of Ramsey algebras and a few specific examples. In this article, we study the properties of Ramsey algebras from a structural point of view. For instance, we will see that isomorphic algebras have the same Ramsey algebraic properties, but elementarily equivalent algebras need not be so, as expected. We also answer (...) an open question about Cartesian products of Ramsey algebras. (shrink)

We improve results of Marczewski, Frankiewicz, Brown, and others comparing the $\sigma$-ideals of measure zero, meager, Marczewski measure zero, and completely Ramsey null sets; in particular, we remove CH from the hypothesis of many of Brown's constructions of sets lying in some of these ideals but not in others. We improve upon work of Marczewski by constructing, without CH, a nonmeasurable Marczewski measure zero set lacking the property of Baire. We extend our analysis of $\sigma$-ideals to include the (...) completely Ramsey null sets relative to a Ramsey ultrafilter and obtain all 32 possible examples of sets in some ideals and not others, some under the assumption of MA, but most in ZFC alone. We also improve upon the known constructions of a Marczewski measure zero set which is not Ramsey by using a set theoretic hypothesis which is weaker than those used by other authors. We give several consistency proofs: one concerning the relative sizes of the covering numbers for the meager sets and the completely Ramsey null sets; another concerning the size of non; and a third concerning the size of add$. We also study those classes of perfect sets which are bases for the class of always first category sets. (shrink)

Assuming the existence of a measurable cardinal, we define a hierarchy of Ramsey cardinals and a hierarchy of normal filters. We study some combinatorial properties of this hierarchy. We show that this hierarchy is absolute with respect to the Dodd-Jensen core model, extending a result of Mitchell which says that being Ramsey is absolute with respect to the core model.

It is often thought that questions of reference are crucial in assessing scientific realism, construed as the view that successful theories are at least approximately true descriptions of the unobservable; realism is justified only if terms in empirically successful theories generally refer to genuinely existing entities or properties. In this paper this view is questioned. First, it is argued that there are good reasons to think that questions of realism are largely decided by convention and carry no epistemic significance. An (...) alternative conception of realism is then proposed, which focuses on the Ramsey sentences of scientific theories, constructed in the manner of David Lewis's 'How to define theoretical terms'. It is argued that because the Ramsey sentence of a theory preserves the epistemically significant part of the theory's content without generating commitments to any particular conclusions about reference, the realism issue is better addressed by asking whether Ramsey sentences of theories, rather than the theories themselves, are approximately true. (shrink)

We give a simple game-theoretic proof of Silver's theorem that every analytic set is Ramsey. A set P of subsets of ω is called Ramsey if there exists an infinite set H such that either all infinite subsets of H are in P or all out of P. Our proof clarifies a strong connection between the Ramsey property of partitions and the determinacy of infinite games.

There is an important class of conditionals whose assertibility conditions are not given by the Ramsey test but by an inductive extension of that test. Such inductive Ramsey conditionals fail to satisfy some of the core properties of plain conditionals. Associated principles of nonmonotonic inference should not be assumed to hold generally if interpretations in terms of induction or appeals to total evidence are not to be ruled out.

We introduce a natural class of quantifiersTh containing all monadic type quantifiers, all quantifiers for linear orders, quantifiers for isomorphism, Ramsey type quantifiers, and plenty more, showing that no sublogic ofL ωω (Th) or countably compact regular sublogic ofL ∞ω (Th), properly extendingL ωω , satisfies the uniform reduction property for quotients. As a consequence, none of these logics satisfies eitherΔ-interpolation or Beth's definability theorem when closed under relativizations. We also show the failure of both properties for any (...) sublogic ofL ∞ω (Th) in which Chang's quantifier or some cardinality quantifierQ α, with α≧1, is definable. (shrink)

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)

The Dutch Book Argument shows that an agent will lose surely in a gamble (a Dutch Book is made) if his degrees of belief do not satisfy the laws of the probability. Yet a question arises here: What does the Dutch Book imply? This paper firstly argues that there exists a utility function following Ramsey’s axioms. And then, it explicates the properties of the utility function and degree of belief respectively. The properties show that coherence in partial beliefs for (...) Subjective Bayesianism means that the degree of belief, representing a belief ordering, satisfies the laws of probability, and that coherence in preferences means that the preferences are represented by expected utilities. A coherent belief ordering and a utility scale induce a coherent preference ordering; a coherent preference ordering induces a coherent belief ordering which can be uniquely represented by a degree-of-belief function. The preferences (values) and beliefs are both incoherent or disordered if a Dutch Book is made. (shrink)

We study several perfect set properties of the Baire space which follow from the Ramsey property ω→(ω) ω . In particular we present some independence results which complete the picture of how these perfect set properties relate to each other.

This article rebuts Ramsey's earlier theory, in 'Universals of Law and of Fact', of how laws of nature differ from other true generalisations. It argues that our laws are rules we use in judging 'if I meet an F I shall regard it as a G'. This temporal asymmetry is derived from that of cause and effect and used to distinguish what's past as what we can know about without knowing our present intentions.

Humean interpretations claim that laws of nature merely summarize events. Non-Humean interpretations claim that laws force events to occur in certain patterns. First, I show that the Lewis/Ramsey account of lawhood, which claims that laws are axioms or theorems of the simplest strongest summary of events, provides the best Humean interpretation of laws. The strongest non-Humean account, the scientific essentialist position, grounds laws of nature in essential non-reducible dispositional properties held by natural kinds. The scientific essentialist account entails that (...) laws are a posteriori necessary truths. After showing that these are the best Humean and non-Humean accounts, I demonstrate that the Lewis/Ramsey account is better equipped for interpreting dispositions and counterfactuals. One distinction between the two accounts is whether counterfactuals, whose antecedents are physically possible, sometimes require closest worlds with different laws than the laws of the base world. On the Lewis/Ramsey account non-legal worlds will be necessary. If laws are merely summaries of events that occur then a world where the events are drastically different will often have different laws. The scientific essentialist, however, must demand that laws are the same in counterfactual reasoning because she grounds counterfactual reasoning in the essential dispositional properties of natural kinds. Recently, problems have developed for counterfactual analysis of dispositions due to finkish dispositions, mimicked dispositions, and masked dispositions. These difficulties have led some to abandon reductive accounts of dispositions. Doing so makes positions like scientific essentialism tenable. Yet, while scientific essentialism demands that dispositional properties cannot be reduced to categorical properties, the Humean has the opposite commitment. If dispositional properties are primitives in our ontology, then there is a stronger tie between events than Humeans admit. So, another major disagreement between these accounts is whether dispositions can be reduced. After examining why many attempts at reducing dispositions have failed, I offer one suggestion of how to reduce dispositions and demonstrate that keeping dispositional properties as primitives in our ontology is worse than the solution I offer. (shrink)

Most causal discovery algorithms in the literature exploit an assumption usually referred to as the Causal Faithfulness or Stability Condition. In this paper, we highlight two components of the condition used in constraint-based algorithms, which we call “Adjacency-Faithfulness” and “Orientation- Faithfulness.” We point out that assuming Adjacency-Faithfulness is true, it is possible to test the validity of Orientation- Faithfulness. Motivated by this observation, we explore the consequence of making only the Adjacency-Faithfulness assumption. We show that the familiar PC algorithm has (...) to be modified to be correct under the weaker, Adjacency-Faithfulness assumption. The modified algorithm, called Conservative PC (CPC), checks whether Orientation- Faithfulness holds in the orientation phase, and if not, avoids drawing certain causal conclusions the PC algorithm would draw. Howtion: ever, if the stronger, standard causal Faith-. (shrink)

The validity and utility of the proximate-ultimate distinction in biology have recently been under debate. Opponents of the distinction argue that it rules out individual-level organismic processes from evolutionary explanations, thereby leading to an unfounded separation between organismic causation and evolutionary causation. Proponents of the proximate-ultimate distinction, on the other hand, argue that it serves an important epistemological role in forming different kinds of explanation-seeking questions in biology. In this paper we offer an interpretation the proximate-ultimate distinction not only as (...) a means of forming explanation-seeking questions, but also as a distinction that can help highlight the way in which individual-level organismic processes can be evolutionary causes. We do this by interpreting the distinction between proximate and ultimate causes as a distinction between structuring and triggering causes. (shrink)

We prove the following theorems:1. IfX⊆ 2ωis aγ-set andY⊆2ωis a strongly meager set, thenX+Yis Ramsey null.2. IfX⊆2ωis aγ-set andYbelongs to the class ofsets, then the algebraic sumX+Yis anset as well.3. Under CH there exists a setX∈MGR* which is not Ramsey null.

Ancients and moderns alike have constructed arguments and assessed theories on the basis of common sense and intuitive judgments. Yet, despite the important role intuitions play in philosophy, there has been little reflection on fundamental questions concerning the sort of data intuitions provide, how they are supposed to lead us to the truth, and why we should treat them as important. In addition, recent psychological research seems to pose serious challenges to traditional intuition-driven philosophical inquiry. Rethinking Intuition brings together a (...) distinguished group of philosophers and psychologists to discuss these important issues. Students and scholars in both fields will find this book to be of great value. (shrink)

We are good at discussing law statements of different epistemic status, and to describe logical relationships between different law statements. But contemporary discussion often suffers from a difficulty to formulate questions concerning laws of different ontological status. This paper presents a framework for distinguishing between properties and fake properties that seems to provide better tools for such inquiries. This paper also examines criteria for properties in connection with laws of nature. It discusses three suggested tests for properties, by Maxwell, (...) class='Hi'>Ramsey, and Cartwright. None of these tests is good as it stands. Rather than favouring one particular test, we should opt for methodologically stable decisions, i.e. decisions where several tests come to the same conclusion. (shrink)

Deweyan pedagogy seeks to promotes growth, characterized as an increased sensitivity, responsiveness, and ability to participate in an environment. Growth, Dewey says, is fostered by the development of habits that enable further habit formation. Unfortunately, humans have their own habitual ways of encountering other species, which often do not support growth. In this article, I briefly review some common conceptions of learning and the process of habit-formation to scope out the landscape of a more responsible and responsive approach to taking (...) growth seriously. What emerges is a reflexive biosemiotics that has humans explicitly concerned with the in situ emergence of new signification in themselves and in other organisms. This requires we take a pedagogical stance in our attitudes and practices towards other species, which we can enrich with insights derived from re-interpreting traditional empirical studies. By freeing the habit-forming process from confining stereotype, a biological pedagogy can enable a more fluid and creative biosphere, unencumbered to explore unfolding possibilities in semiotic space. (shrink)