Hindman’s theorem says that every finite coloring of the natural numbers has a monochromatic set of finite sums. A Ramsey algebra is a structure that satisfies an analogue of Hindman’s theorem. In this paper, we present the basic notions of Ramsey algebras by using terminology from mathematical logic. We also present some results regarding classification of Ramsey algebras.

Hindman’s Theorem says that every finite coloring of the positive natural numbers has a monochromatic set of finite sums. Ramsey algebras, recently introduced, are structures that satisfy an analogue of Hindman’s Theorem. It is an open problem posed by Carlson whether every Ramsey algebra has an idempotent ultrafilter. This paper develops a general framework to study idempotent ultrafilters. Under certain countable setting, the main result roughly says that every nondegenerate Ramsey algebra has a nonprincipal idempotent (...) ultrafilter in some nontrivial countable field of sets. This amounts to a positive result that addresses Carlson’s question in some way. (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)

Hindman’s theorem says that every finite coloring of the natural numbers has a monochromatic set of finite sums. Ramsey algebras are structures that satisfy an analogue of Hindman’s Theorem. This paper introduces Ramsey algebras and presents some elementary results. Furthermore, their connection to Ramsey spaces will be addressed.

It is known that for two given countable sets of unary relations A and B on ω there exists an infinite set H ⫅ ω on which A and B are the same. This result can be used to generate counterexamples in expressibility theory. We examine the sharpness of this result.

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

Though some influentially critical objections have been raised during the ‘classical’ pre-computational simulation philosophy of science tradition, suggesting a more nuanced methodological category for experiments, it safe to say such critical objections have greatly proliferated in philosophical studies dedicated to the role played by computational simulations in science. For instance, Eric Winsberg suggests that computer simulations are methodologically unique in the development of a theory’s models suggesting new epistemic notions of application. This is also echoed in Jeffrey Ramsey’s notions (...) of “transformation reduction,”—i.e., a notion of reduction of a more highly constructive variety. Computer simulations create a broadly continuous arena spanned by normative and descriptive aspects of theory-articulation, as entailed by the notion of transformation reductions occupying a continuous region demarcated by Ernest Nagel’s logical-explanatory “domain-combining reduction” on the one hand, and Thomas Nickels’ heuristic “domain-preserving reduction,” on the other. I extend Winsberg’s and Ramsey’s points here, by arguing that in the field of computational fluid dynamics as well as in other branches of applied physics, the computer plays a constitutively experimental role—supplanting in many cases the more traditional experimental methods such as flow-visualization, etc. In this case, however CFD algorithms act as substitutes, not supplements when it comes to experimental practices. I bring up the constructive example involving the Clifford-Algebraic algorithms for modeling singular phenomena in CFD by Gerik Scheuermann and Steven Mann & Alyn Rockwood who demonstrate that their algorithms offer greater descriptive and explanatory scope than the standard Navier-Stokes approaches. The mathematical distinction between Navier-Stokes-based and Clifford-Algebraic based CFD has essentially to do with the regularization features exhibited to a far greater extent by the latter, than the former. Hence, CACFD indicate that the utilization of computational techniques can be based on principled reasons, as opposed to merely practical. CACFD hence exhibit a new generative role in the field of fluid mechanics, by offering categories of experimental evidence that are optimally descriptive and explanatory—i.e., pace Batterman can be both ontologically and epistemically fundamental. (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)

We discuss the externally definable Ramsey property, a weakening of the Ramsey property for relational structures, where the only colourings considered are those that are externally definable: that is, definable with parameters in an elementary extension. We show a number of basic results analogous to the classical Ramsey theory, and show that, for an ultrahomogeneous structure M with countable age, the externally definable Ramsey property is equivalent to the dynamical statement that, for all $$n \in \mathbb (...) {N} $$, every subflow of the space $$S_n(M)$$ of n-types has a fixed point. We discuss a range of examples, including results regarding the lexicographic product of structures. (shrink)

We study the effective and proof-theoretic content of the polarized Ramsey’s theorem, a variant of Ramsey’s theorem obtained by relaxing the definition of homogeneous set. Our investigation yields a new characterization of Ramsey’s theorem in all exponents, and produces several combinatorial principles which, modulo bounding for ${\Sigma^0_2}$ formulas, lie (possibly not strictly) between Ramsey’s theorem for pairs and the stable Ramsey’s theorem for pairs.

The properties of belief revision operators are known to have an informal semantics which relates them to the axioms of conditional logic. The purpose of this paper is to make this connection precise via the model theory of conditional logic. A semantics for conditional logic is presented, which is expressed in terms of algebraic models constructed ultimately out of revision operators. In addition, it is shown that each algebraic model determines both a revision operator and a logic, that are related (...) by virtue of the stable Ramsey test. (shrink)

A family $$\mathcal {I}$$ I of subsets of a set X is an ideal on X if it is closed under taking subsets and finite unions of its elements. An ideal $$\mathcal {I}$$ I on X is below an ideal $$\mathcal {J}$$ J on Y in the Katětov order if there is a function $$f{: }Y\rightarrow X$$ f : Y → X such that $$f^{-1}[A]\in \mathcal {J}$$ f - 1 [ A ] ∈ J for every $$A\in \mathcal {I}$$ A (...) ∈ I. We show that the Hindman ideal, the Ramsey ideal and the summable ideal are pairwise incomparable in the Katětov order, where The Ramsey ideal consists of those sets of pairs of natural numbers which do not contain a set of all pairs of any infinite set (equivalently do not contain, in a sense, any infinite complete subgraph), The Hindman ideal consists of those sets of natural numbers which do not contain any infinite set together with all finite sums of its members (equivalently do not contain IP-sets that are considered in Ergodic Ramsey theory), The summable ideal consists of those sets of natural numbers such that the series of the reciprocals of its members is convergent. (shrink)

The main result of the present article is the following: Let N be an infinite subset of,, and let be a matrix with infinitely many rows of completely Ramsey subsets of such that for every n,. Then there exist, a sequence of nonempty finite subsets of N, and an infinite subset T of such that for every infinite subset I of. We also give an application of this result to partitions of an uncountable analytic subset of a Polish space (...) X into sets belonging to the σ‐algebra generated by the analytic subsets of X. (shrink)

We realize the Jiang-Su algebra, all UHF algebras, and the hyperfinite II1factor as Fraïssé limits of suitable classes of structures. Moreover by means of Fraïssé theory we provide new examples of AF algebras with strong homogeneity properties. As a consequence of our analysis we deduce Ramsey-theoretic results about the class of full-matrix algebras.

For \(n\in \omega \), the weak choice principle \(\textrm{RC}_n\) is defined as follows: _For every infinite set_ _X_ _there is an infinite subset_ \(Y\subseteq X\) _with a choice function on_ \([Y]^n:=\{z\subseteq Y:|z|=n\}\). The choice principle \(\textrm{C}_n^-\) states the following: _For every infinite family of_ _n_-_element sets, there is an infinite subfamily_ \({\mathcal {G}}\subseteq {\mathcal {F}}\) _with a choice function._ The choice principles \(\textrm{LOC}_n^-\) and \(\textrm{WOC}_n^-\) are the same as \(\textrm{C}_n^-\), but we assume that the family \({\mathcal {F}}\) is linearly orderable (...) (for \(\textrm{LOC}_n^-\) ) or well-orderable (for \(\textrm{WOC}_n^-\) ). In the first part of this paper, for \(m,n\in \omega \) we will give a full characterization of when the implication \(\textrm{RC}_m\Rightarrow \textrm{WOC}_n^-\) holds in \({\textsf {ZF}}\). We will prove the independence results by using suitable Fraenkel-Mostowski permutation models. In the second part, we will show some generalizations. In particular, we will show that \(\textrm{RC}_5\Rightarrow \textrm{LOC}_5^-\) and that \(\textrm{RC}_6\Rightarrow \textrm{C}_3^-\), answering two open questions from Halbeisen and Tachtsis (Arch Math Logik 59(5):583–606, 2020). Furthermore, we will show that \(\textrm{RC}_6\Rightarrow \textrm{C}_9^-\) and that \(\textrm{RC}_7\Rightarrow \textrm{LOC}_7^-\). (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)

En el ámbito de la lógica matemática existe un problema sobre la relación lógica entre dos versiones débiles del Axioma de elección (AE) que no se ha podido resolver desde el año 2000 (aproximadamente). Tales versiones están relacionadas con ultrafiltros no principales y con Propiedades Ramsey (Bernstein, Polarizada, Subretículo, Ramsey, Ordinales flotantes, etc). La primera versión débil del AE es la siguiente (A): “Existen ultrafiltros no principales sobre el conjunto de los números naturales (ℕ)”. Y la segunda versión (...) débil del AE es la siguiente (B): “Existen ultraflitros sobre ℕ”. Se sabe que A implica B, pero se desconoce si B implica A. Di Prisco y Henle conjeturan en los artículos ([1], [2]) que esto no ocurre, es decir, conjeturan que B no implica A, en otras palabras, conjeturan que A es más fuerte estrictamente que B, que A es independiente de B, pero esto no se ha podido demostrar todavía aunque se ha intentado hacer desde hace aproximadamente 21 años. Una descripción detallada de este problema abierto puede encontrarse en esta ponencia (dictada en el marco del Día Mundial de la Lógica 14-01-2022) y en el artículo [3]. [1] C. Di Prisco y H. Henle. “Doughnuts, Floating Ordinals, Square Brackets, and Ultraflitters”. Journal of Symbolic Logic 65 (2000) 462-473. [2] C. Di Prisco y H. Henle. “Partitions of the reals and choice”. En “Models, algebras and proofs”. X. Caicedo y C.M. Montenegro. Eds. Lecture Notes in Pure and Appl. Math, 203, Marcel Dekker, 1999. [3] F. Galindo. “Tópicos de ultrafiltros”. Divulgaciones Matemáticas. Vol. 21, No 1-2, 2020. (shrink)

We introduce two new belief revision axioms: partial monotonicity and consequence correctness. We show that partial monotonicity is consistent with but independent of the full set of axioms for a Gärdenfors belief revision sytem. In contrast to the Gärdenfors inconsistency results for certain monotonicity principles, we use partial monotonicity to inform a consistent formalization of the Ramsey test within a belief revision system extended by a conditional operator. We take this to be a technical dissolution of the well-known Gärdenfors (...) dilemma.In addition, we present the consequential correctness axiom as a new measure of minimal revision in terms of the deductive core of a proposition whose support we wish to excise. We survey several syntactic and semantic belief revision systems and evaluate them according to both the Gärdenfors axioms and our new axioms. Furthermore, our algebraic characterization of semantic revision systems provides a useful technical device for analysis and comparison, which we illustrate with several new proofs. (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.

Henle, Mathias, and Woodin proved in [21] that, provided that${\omega }{\rightarrow }({\omega })^{{\omega }}$holds in a modelMof ZF, then forcing with$([{\omega }]^{{\omega }},{\subseteq }^*)$overMadds no new sets of ordinals, thus earning the name a “barren” extension. Moreover, under an additional assumption, they proved that this generic extension preserves all strong partition cardinals. This forcing thus produces a model$M[\mathcal {U}]$, where$\mathcal {U}$is a Ramsey ultrafilter, with many properties of the original modelM. This begged the question of how important the Ramseyness (...) of$\mathcal {U}$is for these results. In this paper, we show that several classes of$\sigma $-closed forcings which generate non-Ramsey ultrafilters have the same properties. Such ultrafilters include Milliken–Taylor ultrafilters, a class of rapid p-points of Laflamme,k-arrow p-points of Baumgartner and Taylor, and extensions to a class of ultrafilters constructed by Dobrinen, Mijares, and Trujillo. Furthermore, the class of Boolean algebras$\mathcal {P}({\omega }^{{\alpha }})/{\mathrm {Fin}}^{\otimes {\alpha }}$,$2\le {\alpha }<{\omega }_1$, forcing non-p-points also produce barren extensions. (shrink)

When the Canonical Ramsey’s Theorem by Erdős and Rado is applied to regressive functions, one obtains the Regressive Ramsey’s Theorem by Kanamori and McAloon. Taylor proved a “canonical” version of Hindman’s Theorem, analogous to the Canonical Ramsey’s Theorem. We introduce the restriction of Taylor’s Canonical Hindman’s Theorem to a subclass of the regressive functions, the $$\lambda $$ λ -regressive functions, relative to an adequate version of min-homogeneity and prove some results about the Reverse Mathematics of this Regressive (...) Hindman’s Theorem and of natural restrictions of it. In particular we prove that the first non-trivial restriction of the principle is equivalent to Arithmetical Comprehension. We furthermore prove that the well-ordering-preservation principle for base-$$\omega $$ ω exponentiation is reducible to this same principle by a uniform computable reduction. (shrink)

It is widely assumed that there exist certain objects which can in no way be distinguished from each other, unless by their location in space or other reference-system. Some of these are, in a broad sense, 'empirical objects', such as electrons. Their case would seem to be similar to that of certain mathematical 'objects', such as the minimum set of manifolds defining the dimensionality of an R -space. It is therefore at first sight surprising that there exists no branch of (...) mathematics, in which a third parity-relation, besides equality and inequality, is admitted; for this would seem to furnish an appropriate model for application to such instances as these. I hope, in this work, to show that such a mathematics in feasible, and could have useful applications if only in a limited field. The concept of what I here call 'indistinguishability' is not unknown in logic, albeit much neglected. It is mentioned, for example, by F. P. Ramsey [1] who criticizes Whitehead and Russell [2] for defining 'identity' in such a way as to make indistinguishables identical. But, so far as I can discover, no one has made any systematic attempt to open up the territory which lies behind these ideas. What we find, on doing so, is a body of mathematics, offering only a limited prospect of practical usefulness, but which on the theoretical side presents a strong challenge to conventional ideas. (shrink)

In the dissertation we study the complexity of generalized quantifiers in natural language. Our perspective is interdisciplinary: we combine philosophical insights with theoretical computer science, experimental cognitive science and linguistic theories. -/- In Chapter 1 we argue for identifying a part of meaning, the so-called referential meaning (model-checking), with algorithms. Moreover, we discuss the influence of computational complexity theory on cognitive tasks. We give some arguments to treat as cognitively tractable only those problems which can be computed in polynomial time. (...) Additionally, we suggest that plausible semantic theories of the everyday fragment of natural language can be formulated in the existential fragment of second-order logic. -/- In Chapter 2 we give an overview of the basic notions of generalized quantifier theory, computability theory, and descriptive complexity theory. -/- In Chapter 3 we prove that PTIME quantifiers are closed under iteration, cumulation and resumption. Next, we discuss the NP-completeness of branching quantifiers. Finally, we show that some Ramsey quantifiers define NP-complete classes of finite models while others stay in PTIME. We also give a sufficient condition for a Ramsey quantifier to be computable in polynomial time. -/- In Chapter 4 we investigate the computational complexity of polyadic lifts expressing various readings of reciprocal sentences with quantified antecedents. We show a dichotomy between these readings: the strong reciprocal reading can create NP-complete constructions, while the weak and the intermediate reciprocal readings do not. Additionally, we argue that this difference should be acknowledged in the Strong Meaning hypothesis. -/- In Chapter 5 we study the definability and complexity of the type-shifting approach to collective quantification in natural language. We show that under reasonable complexity assumptions it is not general enough to cover the semantics of all collective quantifiers in natural language. The type-shifting approach cannot lead outside second-order logic and arguably some collective quantifiers are not expressible in second-order logic. As a result, we argue that algebraic (many-sorted) formalisms dealing with collectivity are more plausible than the type-shifting approach. Moreover, we suggest that some collective quantifiers might not be realized in everyday language due to their high computational complexity. Additionally, we introduce the so-called second-order generalized quantifiers to the study of collective semantics. -/- In Chapter 6 we study the statement known as Hintikka's thesis: that the semantics of sentences like ``Most boys and most girls hate each other'' is not expressible by linear formulae and one needs to use branching quantification. We discuss possible readings of such sentences and come to the conclusion that they are expressible by linear formulae, as opposed to what Hintikka states. Next, we propose empirical evidence confirming our theoretical predictions that these sentences are sometimes interpreted by people as having the conjunctional reading. -/- In Chapter 7 we discuss a computational semantics for monadic quantifiers in natural language. We recall that it can be expressed in terms of finite-state and push-down automata. Then we present and criticize the neurological research building on this model. The discussion leads to a new experimental set-up which provides empirical evidence confirming the complexity predictions of the computational model. We show that the differences in reaction time needed for comprehension of sentences with monadic quantifiers are consistent with the complexity differences predicted by the model. -/- In Chapter 8 we discuss some general open questions and possible directions for future research, e.g., using different measures of complexity, involving game-theory and so on. -/- In general, our research explores, from different perspectives, the advantages of identifying meaning with algorithms and applying computational complexity analysis to semantic issues. It shows the fruitfulness of such an abstract computational approach for linguistics and cognitive science. (shrink)

We show that under the proper forcing axiom the class of all Aronszajn lines behave like [Formula: see text]-scattered orders under the embeddability relation. In particular, we are able to show that the class of better-quasi-order labeled fragmented Aronszajn lines is itself a better-quasi-order. Moreover, we show that every better-quasi-order labeled Aronszajn line can be expressed as a finite sum of labeled types which are algebraically indecomposable. By encoding lines with finite labeled trees, we are also able to deduce a (...) decomposition result, that for every Aronszajn line [Formula: see text] there is an integer [Formula: see text] such that for any finite coloring of [Formula: see text] there is subset [Formula: see text] of [Formula: see text] isomorphic to [Formula: see text] which uses no more than [Formula: see text] colors. (shrink)

A P-point ultrafilter over \(\omega \) is called an interval P-point if for every function from \(\omega \) to \(\omega \) there exists a set _A_ in this ultrafilter such that the restriction of the function to _A_ is either a constant function or an interval-to-one function. In this paper we prove the following results. (1) Interval P-points are not isomorphism invariant under \(\textsf{CH}\) or \(\textsf{MA}\). (2) We identify a cardinal invariant \(\textbf{non}^{**}({\mathcal {I}}_{\tiny {\hbox {int}}})\) such that every filter base (...) of size less than continuum can be extended to an interval P-point if and only if \(\textbf{non}^{**}({\mathcal {I}}_{\tiny {\hbox {int}}})={\mathfrak {c}}\). (3) We prove the generic existence of slow/rapid non-interval P-points and slow/rapid interval P-points which are neither quasi-selective nor weakly Ramsey under the assumption \({\mathfrak {d}}={\mathfrak {c}}\) or \(\textbf{cov}({\mathcal {B}})={\mathfrak {c}}\). (shrink)

We prove the consistency of: if B 1 , B 2 are Boolean algebras satisfying the c.c.c. and the 2 ℵo -c.c. respectively then B 1 × B 2 satisfies the 2 ℵo -c.c. We start with a universe with a Ramsey cardinal.

We investigate higher dimensional chain conditions, where the largeness notion is given by Fubini products of a given ideal. From strong saturation properties of an ideal, we derive abstractly versions of higher dimensional [Formula: see text]-system lemma, which imply many posets, including any finite support iteration of [Formula: see text]-centered posets and measure algebras, satisfy the higher dimensional chain conditions. We then show that if a poset satisfies a strengthening of the [Formula: see text]-finite chain condition by Horn and Tarski, (...) then it satisfies higher dimensional chain conditions. As an application, we derive Ramsey-theoretic consequences, namely various partition hypotheses as studied by Bannister, Bergfalk, Moore and Todorcevic, from the existence of ideals satisfying strong chain conditions. (shrink)

Journal of Mathematical Logic, Ahead of Print. We investigate higher dimensional chain conditions, where the largeness notion is given by Fubini products of a given ideal. From strong saturation properties of an ideal, we derive abstractly versions of higher dimensional [math]-system lemma, which imply many posets, including any finite support iteration of [math]-centered posets and measure algebras, satisfy the higher dimensional chain conditions. We then show that if a poset satisfies a strengthening of the [math]-finite chain condition by Horn and (...) Tarski, then it satisfies higher dimensional chain conditions. As an application, we derive Ramsey-theoretic consequences, namely various partition hypotheses as studied by Bannister, Bergfalk, Moore and Todorcevic, from the existence of ideals satisfying strong chain conditions. (shrink)

We show that a version of Ramsey’s theorem for trees for arbitrary exponents is equivalent to the subsystem ${{\sf ACA}^\prime_{0}}$ of reverse mathematics.

This thesis is devoted to the exploration of the complexity of some mathematical problems using the framework of computable analysis and descriptive set theory. We will especially focus on Weihrauch reducibility as a means to compare the uniform computational strength of problems. After a short introduction of the relevant background notions, we investigate the uniform computational content of problems arising from theorems that lie at the higher levels of the reverse mathematics hierarchy.We first analyze the strength of the open and (...) clopen Ramsey theorems. Since there is not a canonical way to phrase these theorems as multi-valued functions, we identify eight different multi-valued functions and study their degree from the point of view of Weihrauch, strong Weihrauch, and arithmetic Weihrauch reducibility.We then discuss some new operators on multi-valued functions and study their algebraic properties and the relations with other previously studied operators on problems. In particular, we study the first-order part and the deterministic part of a problem f, capturing the Weihrauch degree of the strongest multi-valued problem that is reducible to f and that, respectively, has codomain $\mathbb {N}$ or is single-valued.These notions proved to be extremely useful when exploring the Weihrauch degree of the problem $\mathsf {DS}$ of computing descending sequences in ill-founded linear orders. They allow us to show that $\mathsf {DS}$, and the Weihrauch equivalent problem $\mathsf {BS}$ of finding bad sequences through non-well quasi-orders, while being very “hard” to solve, are rather weak in terms of uniform computational strength. We then generalize $\mathsf {DS}$ and $\mathsf {BS}$ by considering $\boldsymbol {\Gamma }$ -presented orders, where $\boldsymbol {\Gamma }$ is a Borel pointclass or $\boldsymbol {\Delta }^1_1$, $\boldsymbol {\Sigma }^1_1$, $\boldsymbol {\Pi }^1_1$. We study the obtained $\mathsf {DS}$ -hierarchy and $\mathsf {BS}$ -hierarchy of problems in comparison with the Baire hierarchy and show that they do not collapse at any finite level.Finally, we work in the context of geometric measure theory and we focus on the characterization, from the point of view of descriptive set theory, of some conditions involving the notions of Hausdorff/Fourier dimension and Salem sets. We first work in the hyperspace $\mathbf {K}$ of compact subsets of $[0,1]$ and show that the closed Salem sets form a $\boldsymbol {\Pi }^0_3$ -complete family. This is done by characterizing the complexity of the family of sets having sufficiently large Hausdorff or Fourier dimension. We also show that the complexity does not change if we increase the dimension of the ambient space and work in $\mathbf {K}$. We also generalize the results by relaxing the compactness of the ambient space and show that the closed Salem sets are still $\boldsymbol {\Pi }^0_3$ -complete when we endow $\mathbf {F}$ with the Fell topology. A similar result holds also for the Vietoris topology.We conclude by analyzing the same notions from the point of view of effective descriptive set theory and Type-2 Theory of Effectivity, and show that the complexities remain the same also in the lightface case. In particular, we show that the family of all the closed Salem sets is $\Pi ^0_3$ -complete. We furthermore characterize the Weihrauch degree of the functions computing Hausdorff and Fourier dimension of closed sets.prepared by Manlio Valenti.E-mail:[email protected]. (shrink)

We introduce the notion of Boolean measure algebra. It can be described shortly using some standard notations and terminology. If B is any Boolean algebra, let BN denote the algebra of sequences , xn B. Let us write pk BN the sequence such that pk = 1 if i K and Pk = 0 if k < i. If x B, denote by x* BN the constant sequence x* = . We define a Boolean measure algebra (...) to be a Boolean algebra B with an operation μ:BN → B such that μ = 0 and μ = x. Any Boolean measure algebra can be used to model non-principal ultrafilters in a suitable sense. Also, we can build effectively the initial Boolean measure algebra. This construction is related to the closed open Ramsey Theorem 193–198.). (shrink)

After a chapter which is an introduction to and summary of the rest of the book, chapter 2 begins by criticizing various attempts to do away with theories, such as the Reichenbach-Salmon conception of theoretical truth in terms of observational consequences, and the Ramsey strategy of replacing first-order theoretical sentences by second-order nontheoretical ones; it then argues against hypothetico-deductivist theories of confirmation on the grounds that they are unable to handle the relevance of evidence to theory, whether or not (...) other formal constraints or even nonformal ones such as simplicity and explanatory power are added to those theories; it ends with an exposition of the Reichenbach-Carnap conventionalist thesis that the confirmation of hypotheses with evidence presupposes analytic principles connecting hypothetical and empirical concepts. Chapter 3 criticizes Bayesian theories of confirmation on such grounds as that the a priori arguments for Bayesian restrictions on beliefs are insufficient; that the Bayesian explanations of notions like variety of evidence, ad hocness, and simplicity are inadequate; and that they cannot account, without drastic revisions, for the relevance of evidence to theory, especially old evidence to new theory. Chapter 4 is an unsympathetic account of historically oriented philosophies of science; Lakatos’s notion of progressive research programs and Laudan’s theory of problem-solving effectiveness are found to be insufficiently precise and dubbed examples of "new fuzziness", while the Sneed-Stegmüller dynamics of theories is regarded as "a paradigm of misplaced rigor" ; and all three are criticized as unable to explicate the concept of evidential relevance. Chapter 5 is a formal and informal elaboration of the basic idea in Glymour’s account of theory and evidence, namely that confirmation or support is a three-term relation among evidence, hypothesis, and theory, so that evidence confirms an hypothesis only relative to a theory, and such that evidence e confirms hypothesis h relative to T if T with e implies, but T without e does not imply, an instance of h, and T with e does not imply a comparable hypothesis h’ different from h; the most interesting part of this chapter is a series of discussions showing how such an idea makes sense of the "methodological truisms" that it is possible selectively to test certain parts of a theory but not others, that a theory is supported better by a greater variety of evidence, that redundant or physically meaningless quantities are an undesirable feature of theories, that there are no inviolable rules, that a "white shoe" does not confirm "all ravens are black," that a theory is more useful and better supported than the set of its observational consequences, and that the hypothetico-deductive method often works. Since Glymour claims no originality for the conception of this general account, but only for its description, he plausibly thinks it necessary to apply it to some important historical cases of actual science; he does so in the next chapter by discussing at some length the structure and merits of Ptolemaic and Copernican astronomy, of Newton’s universal gravitation, of nineteenth century atomism, of Freud’s Rat Man, and of general relativity. For example, he argues convincingly that Copernicanism was better supported by the evidence available even before the telescope because it alone, and not the Ptolemaic theory, can determine some planetary properties which are presupposed by both theories, can test and confirm some common hypotheses, and can be confirmed in an essential rather than incidental manner; and though Glymour admits that the Copernicans tended to argue in terms of explanatory rather than confirmatory superiority, he sketches an interesting account of the relation between explanation and confirmation which strengthens his case. He also analyzes the text at the beginning of book 3 of Newton’s Principia and compiles a reconstruction of the intricate details of the inferential structure of the argument to universal gravitation; his impressive reconstruction clearly shows that Newton’s method is neither the inductivist one he himself thought he was following, nor the one attributed to him by Pierre Duhem, but rather one in accordance with Glymour’s so-called "bootstrap strategy" of repeatedly using the evidence from Kepler’s second and third laws, from lunar data, and from falling bodies, together with the theory consisting of the second and third laws of motion, to arrive at increasingly general instances of the principle of universal gravitation. Glymour’s account of arguments for and against the atomic theory from Thomson to Cannizzaro is his longest historical example, but he himself admits that this illustration of the bootstrap strategy is "certainly not the neatest", and rather "diffuse, and perhaps disconnected". Chapter 7 is a detailed application of the same principles to the technique known among social scientists as "causal modeling"; since such "causal models" are essentially systems of algebraic equations, Glymour’s account shows indirectly that the bootstrap strategy is applicable to any scientific theory presented as a set of algebraic equations; this, of course is not surprising, since the formal considerations with which Glymour begins the exposition of his theory in chapter 5 involve systems of algebraic equations. Chapter 8 is an attempt to apply Glymour’s theory of evidence to the very common scientific practice of curve-fitting, where one measures values of two or more quantities and then infers a functional relationship; Glymour argues that simpler polynomials are preferred because they are tested more frequently and more severely by the data and because they are more informative; but then he criticizes his own explanation and concludes that "the bootstrap procedures of chapter 5 do not seem to help the problem much more than a whit" ; this is admirably honest, but if one wants an additional logical or methodological rationale, then one would perhaps have to go to the meta-level and say that Glymour is here testing his own theory, and he is more interested in a further illustration of the bootstrap methodology even with a failed test, than he is to claim universal or exclusive validity for it. In chapter 9 Glymour uses his bootstrap theory of confirmation to criticize geometrical conventionalism; he considers the alternative theories of space or space-time proposed by conventionalists to show the radical undetermination of geometries by evidence, for example, a non-Euclidean geometry with no universal force instead of Newtonian gravitation with Euclidean geometry; he argues that such alternatives are simply not as well tested as the originals and that their equivalence to the originals is questionable. The last chapter is a brief discussion of further problems worthy of future investigation. (shrink)

We show that if there is no inner model with a Woodin cardinal and the Steel core model K exists, then every Jónsson cardinal is Ramsey in K, and every δ-Jónsson cardinal is δ-Erdös in K. In the absence of the Steel core model K we prove the same conclusion for any model L[E] such that either V = L[E] is the minimal model for a Woodin cardinal, or there is no inner model with a Woodin cardinal and V (...) is a generic extension of L[E]. The proof includes one lemma of independent interest: If V = L[A], where A $\subset$ κ and κ is regular, then L κ [A] is a Jónsson algebra. The proof of this result, Lemma 2.5, is very short and entirely elementary. (shrink)

I am not so insular and I hope not so presumptuous as to suppose that there is no contemporary philosophy apart from that empiricism which dominates very much of Great Britain, North America and Scandinavia. So let us notice that contemporary philosophy embraces broadly three points of view, though it will be part of my argument that they largely combine in the lessons they have to teach us, and in many of their implications for theology.

Paul Ramsey was one of the most important ethicists of the twentieth century. From the publication of his classic Basic Christian Ethics in 1950 until his death in 1988, his writings decisively shaped moral discourse and reflection in the areas of theology, law, politics, and medicine. This collection of Ramsey's most important essays on Christian, political, and medical ethics displays the scope and depth of his vision, highlighting both the character of his theological commitments and the continuing significance (...) of his work for the pressing moral problems of our day. Selections deal with such issues as race relations, sexuality and marriage, war, the meaning of Christian love, abortion, and medical care for the sick and dying. A general introduction by William Werpehowski and Stephen D. Crocco evaluates Ramsey's career and accomplishments and reviews contemporary criticism of his output and legacy. Shorter introductions to each selection point out crucial themes and lines of development in Ramsey's thought. (shrink)

The present publication forms part of a projected book that F. P. Ramsey drafted but never completed. It survived among his papers and ultimately came into the possession of the University of Pittsburgh in the circumstances detailed in the Editor's Introduction. Our hope in issuing this work at this stage - some sixty years after Ramsey's premature death at the age of 26 - is both to provide yet another token of his amazing philosophical creativity, and also to (...) make available an important datum for the still to be written history of the development of philosophical analysis. This is a book whose appearance will, we hope and expect, be appreciated both by those interested in linguistic philosophy itself and by those concerned for its historical development in the present century. EDITORS'INTRODUCTION 1. THE RAMSEY COLLECTION Frank Plump ton Ramsey was an extra ordinary scholarly phenomenon. Son of a distinguished mathematician and President of Magdalene College, Cambridge and brother of Arthur Michael, eventual Archbishop of Canterbury, Ramsey was closely connected with Cambridge throughout his life, ultimately becoming lecturer in Mathematics in the University. Notwithstanding his great mathematical talent, it was primarily logic and philosophy that engaged his interests, and he wrote original and important contributions to logic, semantics, epistomology, probability theory, philosophy of science, and economics, in addition to seminal work in the foundations of mathematics. (shrink)

First published in 2000. Routledge is an imprint of Taylor & Francis, an informa company.

In this book, Ramsey addresses the moral problems of medicine, life and death and not merely to those who share his faith.

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.

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.

The article argues that universals of law, i.e. the laws of nature, are the general axioms of a deductive system of all knowledge, and their deductive consequences. Universals of fact are generalisations deducible from these together with particular facts.

The author responds to the interpretations and criticisms of his thought as presented in the eleven essays in "Love and Society: Essays in the Ethics of Paul Ramsey ". He defends and refines his position on ethical theory, war and political ethics and medical ethics.