Joseph G. Ramsey argues that Richard Wright’s 1940 novella “Bright and Morning Star” has been consistently misunderstood. What has been almost universally read as a narrative of communist heroism stages instead a heroic mistake. “Bright and Morning Star” is not a story primarily about heroic individual sacrifice, but about the ways collective struggle can fail.

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.

Frank Ramsey was the greatest of the remarkable generation of Cambridge philosophers and logicians which included G. E. Moore, Bertrand Russell, Ludwig Wittgenstein and Maynard Keynes. Before his tragically early death in 1930 at the age of twenty-six, he had done seminal work in mathematics and economics as well as in logic and philosophy. This volume, with a new and extensive introduction by D. H. Mellor, contains all Ramsey's previously published writings on philosophy and the foundations of mathematics. (...) The latter gives the definitive form and defence of the reduction of mathematics to logic undertaken in Russell and Whitehead's Principia Mathematica; the former includes the most profound and original studies of universals, truth, meaning, probability, knowledge, law and causation, all of which are still constantly referred to, and still essential reading for all serious students of these subjects. (shrink)

A compilation of all previously published writings on philosophy and the foundations of mathematics from the greatest of the generation of Cambridge scholars that included G.E. Moore, Bertrand Russell, Ludwig Wittgenstein and Maynard Keynes.

This note is, in effect, a postscript to Ramsey's 'Theories'. It argues that to assert the existence of a causal quality (e.g. mass) is merely to affirm the consequences of a theory that invokes it.

In chapter 3, we reflected on the view that the fallacies on the traditional list are inherently dialectical. The answer proposed there was that, with the possible exception of, e.g., begging the question and many questions, they are not. The aim of the present chapter is to cancel theispossibility by showing that begging the question and many questions are not in fact dialectical fallacies. The reason for this is not that question-begging and many questions aren’t (at least dominantly) dialectical practices. (...) The reason is that, dialectical or not, they are not fallacies. That begging the question, BQ for short, is a fallacy is an idea which originates with Aristotle. Given logic’s already long history, it should not be surprising that Aristotle’s views of these matters have in some ways been superseded. But the traditional view retains the original connection between conception and instantiation. Whereas BQ in Aristotle’s sense is said to be a fallacy in Aristotle’s sense, so too is BQ in the modern sense said to be a fallacy in the modern (i.e., EAUI) sense.[1] As currently conceived of, BQ and fallacies can be characterized in the following ways. (shrink)

In recent years, several remarkable results have shown that certain theorems of finite combinatorics are unprovable in certain logical systems. These developments have been instrumental in stimulating research in both areas, with the interface between logic and combinatorics being especially important because of its relation to crucial issues in the foundations of mathematics which were raised by the work of Kurt Godel. Because of the diversity of the lines of research that have begun to shed light on these issues, there (...) was a need for a comprehensive overview which would tie the lines together. This volume fills that need by presenting a balanced mixture of high quality expository and research articles that were presented at the August 1985 AMS-IMS-SIAM Joint Summer Research Conference, held at Humboldt State University in Arcata, California.With an introductory survey to put the works into an appropriate context, the collection consists of papers dealing with various aspects of 'unprovable theorems and fast-growing functions'. Among the topics addressed are: ordinal notations, the dynamical systems approach to Ramsey theory, Hindman's finite sums theorem and related ultrafilters, well quasiordering theory, uncountable combinatorics, nonstandard models of set theory, and a length-of-proof analysis of Godel's incompleteness theorem. Many of the articles bring the reader to the frontiers of research in this area, and most assume familiarity with combinatorics and/or mathematical logic only at the senior undergraduate or first-year graduate level. (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)

This book looks at the ways in which conditionals, an integral part of philosophy and logic, can be of practical use in computer programming. It analyzes the different types of conditionals, including their applications and potential problems. Other topics include defeasible logics, the Ramsey test, and a unified view of consequence relation and belief revision. Its implications will be of interest to researchers in logic, philosophy, and computer science, particularly artificial intelligence.

The Ramsey-sentence H* of any hypothesis H is shown to be a synthetic proposition containing mathematics as a finite component. Far from being quasi-tautological, H* proves to have as much physical content as H itself.

F. P. Ramsey pointed out in Theories that the observational content of a theory expressed partly in non-observational terms is retained in the sentence resulting from existentially generalizing the conjunction of all sentences of the theory with respect to all nonobservational terms. Such terms are thus avoidable in principle, but only at the cost of forming a single "monolithic" sentence. This paper suggests that communication may be thought of as occurring not only by sentence but by clause, a sentential (...) formula closed except for a special kind of variable. Understanding such clauses requires incorporating them within the scope of one's own Ramsey sentence. Many concepts of deductive and inductive logic carry over without great change. But the concepts of truth and designation are extendible to clauses only in the sense that assertions involving them must, to be understood, in turn be construed as clauses and incorporated into the Ramsey sentence. The behavior of these extended concepts of truth and designation suggests an explication of coherence truth within a correspondence-truth framework. (shrink)

Structural Realism (SSR), as embodied in the Ramsey-sentence H* of a theory H, is defended against the view that H* reduces to a trivial statement about the cardinality of the domain of H, a view which arises from ignoring the central role of observation within science. Putnam’s theses are examined and shown to support rather than undermine SSR. Finally: in view of its synthetic character, applied mathematics must enter into the formulation of H* and hence be shown to be (...) finitely axiomatisable; this is done in the Appendix, which is the most important part of the paper. (shrink)

Structural Realism (SSR), as embodied in the Ramsey-sentence H of a theory H, is defended against the view that H reduces to a trivial statement about the cardinally of the domain of H, a view which arises from ignoring the central role of observation within science. Putnam's theses are examined and shown to support rather than undermine SSR. Finally: in view of its synthetic character, applied mathematics must enter into the formulation of H and hence to be shown axiomatisable; (...) this is done in the Appendix, which is the most important part of the paper. (shrink)

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 introduce the relation of almost-reduction in an arbitrary topological Ramsey space ℛ as a generalization of the relation of almost-inclusion on ℕ[∞]. This leads us to a type of ultrafilter [MATHEMATICAL SCRIPT CAPITAL U] ⊆ ℛ which corresponds to the well-known notion of selective ultrafilter on ℕ. The relationship turns out to be rather exact in the sense that it permits us to lift several well-known facts about selective ultrafilters on ℕ and the Ellentuck space ℕ[∞] to the (...) ultrafilter [MATHEMATICAL SCRIPT CAPITAL U] and the Ramsey space ℛ. For example, we prove that the open coloring axiom holds on L [[MATHEMATICAL SCRIPT CAPITAL U]], extending therefore the result from [3] which gives the same conclusion for the Ramsey space ℕ[∞]. (shrink)

These notes of G. E. Moore's lectures for the three terms of 1934-1935 were compiled by Alice Ambrose, then Student of Newnham College, and Margaret Macdonald, then Fellow of Girton College. The lectures cover a wealth of interrelated topics, and provide instances of the analyses which made Moore «the father of the analytic school.» Since his analyses of such concepts as material objects, sense data, and truth rest on the ordinary use of expressions for these concepts, «ordinary language» philosophers found (...) in him their champion. Moore examines the views of Broad, Russell, F. P. Ramsey, W. E. Johnson, and John Wisdom. (shrink)

First-order logic is known to have a severely limited expressive power on finite structures. As a result, several different extensions have been investigated, including fragments of second-order logic, fixpoint logic, and the infinitary logic L∞ωω in which every formula has only a finite number of variables. In this paper, we study generalized quantifiers in the realm of finite structures and combine them with the infinitary logic L∞ωω to obtain the logics L∞ωω, where Q = {Qi: iε I} is a family (...) of generalized quantifiers on finite structures. Using the logics L∞ωω, we can express polynomial-time properties that are not definable in L∞ωω, such as “there is an even number of x” and “there exists at least n/2 x” , without going to second-order logic. We show that equivalence of finite structures relative to L∞ωω can be characterized in terms of certain pebble games that are a variant of the Ehrenfeucht—Fraïssé games. We combine this game-theoretic characterization with sophisticated combinatorial tools from Ramsey theory, such as van der Waerden's Theorem and Folkman's Theorem, in order to investigate the scope and limits of generalized quantifiers in finite model theory. We obtain sharp lower bounds for expressibility in the logics L∞ωω and discover an intrinsic difference between adding finitely many simple unary generalized quantifiers to L∞ωω adding infinitely many. In particular, we show that if Qis a finite sequence of simple unary generalized quantifiers, then the equicardinality, or Härtig, quantifier is not definable in L∞ωω. We also show that the query “does the equivalence relation E have an even number of equivalence classes” is not definable in the extension L∞ωω of L∞ωω by the Härtig quantifier I and any finite sequence Q of simple unary generalized quantifiers. (shrink)

We study the proof-theoretic strength and effective content of the infinite form of Ramsey's theorem for pairs. Let RT n k denote Ramsey's theorem for k-colorings of n-element sets, and let RT $^n_{ denote (∀ k)RT n k . Our main result on computability is: For any n ≥ 2 and any computable (recursive) k-coloring of the n-element sets of natural numbers, there is an infinite homogeneous set X with X'' ≤ T 0 (n) . Let IΣ n (...) and BΣ n denote the Σ n induction and bounding schemes, respectively. Adapting the case n = 2 of the above result (where X is low 2 ) to models of arithmetic enables us to show that RCA 0 + IΣ 2 + RT 2 2 is conservative over RCA 0 + IΣ 2 for Π 1 1 statements and that $RCA_0 + I\Sigma_3 + RT^2_{ , is Π 1 1 -conservative over RCA 0 + IΣ 3 . It follows that RCA 0 + RT 2 2 does not imply BΣ 3 . In contrast, J. Hirst showed that $RCA_0 + RT^2_{ does imply BΣ 3 , and we include a proof of a slightly strengthened version of this result. It follows that $RT^2_{ is strictly stronger than RT 2 2 over RCA 0. (shrink)

I formulate a counterfactual version of the notorious ‘Ramsey Test’. Whereas the Ramsey Test for indicative conditionals links credence in indicatives to conditional credences, the counterfactual version links credence in counterfactuals to expected conditional chance. I outline two forms: a Ramsey Identity on which the probability of the conditional should be identical to the corresponding conditional probability/expectation of chance; and a Ramsey Bound on which credence in the conditional should never exceed the latter. Even in the (...) weaker, bound, form, the counterfactual Ramsey Test makes counterfactuals subject to the very argument that Lewis used to argue against the indicative version of the Ramsey Test. I compare the assumptions needed to run each, pointing to assumptions about the time‐evolution of chances that can replace the appeal to Bayesian assumptions about credence update in motivating the assumptions of the argument. I finish by outlining two reactions to the discussion: to indicativize the debate on counterfactuals; or to counterfactualize the debate on indicatives. (shrink)

It was shown by Cholak, Jockusch, and Slaman that every computable 2-coloring of pairs admits an infinite low₂ homogeneous set H. We answer a question of the same authors by showing that H may be chosen to satisfy in addition $C\,\not \leqslant _T \,H$, where C is a given noncomputable set. This is shown by analyzing a new and simplified proof of Seetapun's cone avoidance theorem for Ramsey's theorem. We then extend the result to show that every computable 2-coloring (...) of pairs admits a pair of low₂ infinite homogeneous sets whose degrees form a minimal pair. (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 some generalized notions of cohesiveness which arise naturally in connection with effective versions of Ramsey's Theorem. An infinite set A of natural numbers is n-cohesive (respectively, n-r-cohesive) if A is almost homogeneous for every computably enumerable (respectively, computable) 2-coloring of the n-element sets of natural numbers. (Thus the 1-cohesive and 1-r-cohesive sets coincide with the cohesive and r-cohesive sets, respectively.) We consider the degrees of unsolvability and arithmetical definability levels of n-cohesive and n-r-cohesive sets. For example, we (...) show that for all n ≥ 2, there exists a Δ 0 n+1 n-cohesive set. We improve this result for n = 2 by showing that there is a Π 0 2 2-cohesive set. We show that the n-cohesive and n-r-cohesive degrees together form a linear, non-collapsing hierarchy of degrees for n ≥ 2. In addition, for n ≥ 2 we characterize the jumps of n-cohesive degrees as exactly the degrees ≥ 0 (n+1) and also characterize the jumps of the n-r-cohesive degrees. (shrink)

Recent discussions of experimental tests of the Sum Rule have been carried out in the context of the special circumstances attending the Cross-Ramsey experiment. A more general analysis of possible tests is presented. A technical mistake of Fine and Glymour concerned with a misunderstanding of the physics of the Cross-Ramsey experiment is explained and a detailed analysis of a thought experiment based on the Einstein-Podolsky-Rosen wave function is given. It is concluded, in agreement with Fine, that scattering experiments (...) do not test the Sum Rule as a principle which supplements standard quantum mechanics. (shrink)

I argue that the numbering system of the Tractatus lets us see how it was constructed, in two closely related senses of that term. First, it tells us a great deal about the genesis of the book, for the numbering system was used to assemble and rearrange a series of drafts, as recorded in MS 104. Second, it helps us understand the structure of the published book, as cryptically summarized in the opening footnote. I also discuss an unpublished letter from (...) Anscombe to von Wright from 1948 which contains the very first sketch of a tree-structured reading, and what I believe is Stenius’s response to Anscombe’s proposal. The paper critically evaluates previous work on tree-structured readings and contends that we need to read the Tractatus in both the number order used in the published book and the tree order that Wittgenstein used to draft it. It also considers some of the main ways of turning this complex branching structure into a linear, printed text, and so serves as an introduction to the three tree-structured editions of the Tractatus that accompany this paper (the German text, and the translations by Ogden/Ramsey and Pears & McGuinness). (shrink)

It is shown that for each computably enumerable set P of n-element subsets of ω there is an infinite Π 0 n set $A \subseteq \omega$ such that either all n-element subsets of A are in P or no n-element subsets of A are in P. An analogous result is obtained with the requirement that A be Π 0 n replaced by the requirement that the jump of A be computable from 0 (n) . These results are best possible in (...) various senses. (shrink)

This paper argues that if a person's beliefs are idealized as a set of sentences (theoretical, observational, and mixed) then the device of Ramsey sentences provides a treatment, of the mind-brain problem, that has at least four noteworthy characteristics. First, sentences asserting correlations between one's own brain state and one's own "private" experiences are, on such treatment, reconstrued as neither causal, coreferential, nor as meaning postulates, but as clauses in an overall hypothesis (Ramsey sentence) whose only nonlogical constants (...) have "private" meanings. Second, sentences asserting psycho-physical correlations in general, or in other individuals, remain theoretical and susceptible to scientific reduction, though not prejudged to be so. Third, communication between persons having mutually exclusive, "private," observational vocabularies can be made intelligible. Fourth, it becomes possible in principle (though not necessary) that the world could ultimately be given a total description in a scientific language, $L_{\varnothing}$ , without mental primitives. However, such a language would be susceptible to interpretation by a given individual using a metalanguage whose primitives (not among those of $L_{\varnothing}$ ) were privately observational to that individual. His procedure in accomplishing such an interpretation would be to construct a Tarskian truth definition in a metalanguage $ML_{\varnothing}$ and then to incorporate it, by Ramsifying its descriptive terms, in his own overall Ramsey sentence. The physical language, $L_{\varnothing}$ , while not containing a person's primitives, would, of course, be able to define their physical correlates, thus providing a certain sort of mutual mirroring, and a certain sort of relativity. (shrink)

*This work is no longer under development* Two major themes in the literature on indicative conditionals are that the content of indicative conditionals typically depends on what is known;1 that conditionals are intimately related to conditional probabilities.2 In possible world semantics for counterfactual conditionals, a standard assumption is that conditionals whose antecedents are metaphysically impossible are vacuously true.3 This aspect has recently been brought to the fore, and defended by Tim Williamson, who uses it in to characterize alethic necessity by (...) exploiting such equivalences as: A⇔¬A A. One might wish to postulate an analogous connection for indicative conditionals, with indicatives whose antecedents are epistemically impossible being vacuously true: and indeed, the modal account of indicative conditionals of Brian Weatherson has exactly this feature.4 This allows one to characterize an epistemic modal by the equivalence A⇔¬A→A. For simplicity, in what follows we write A as KA and think of it as expressing that subject S knows that A.5 The connection to probability has received much attention. Stalnaker suggested, as a way of articulating the ‘Ramsey Test’, the following very general schema for indicative conditionals relative to some probability function P: P = P 1For example, Nolan ; Weatherson ; Gillies. 2For example Stalnaker ; McGee ; Adams. 3Lewis. See Nolan for criticism. 4‘epistemically possible’ here means incompatible with what is known. 5This idea was suggested to me in conversation by John Hawthorne. I do not know of it being explored in print. The plausibility of this characterization will depend on the exact sense of ‘epistemically possible’ in play—if it is compatibility with what a single subject knows, then can be read ‘the relevant subject knows that p’. If it is more delicately formulated, we might be able to read as the epistemic modal ‘must’. (shrink)