Scientists employ a variety of procedures to eliminate degrees of freedom from computationally and/or analytically intractable equations. In the process, they often construct new models and discover new concepts, laws and functional relations. I argue these procedures embody a central notion of reduction, namely, the containment of one structure within another. However, their inclusion in the philosophical concept of reduction necessitates a reevaluation of many standard assumptions about the ontological, epistemological and functional features of a reduction. On the basis of (...) the reevaluation, I advocate a continuum of reduction which proceeds from the eliminative to the constructive. The metaphysical aspects of theory use in constructive reductions are sketched. (shrink)

Chemists take mechanisms to be an important way of explaining chemical change. I examine the usefulness of the mechanism approach in the recent philosophical literature in explicating the explanatory use of mechanisms by organic chemists. I argue that chemists consider a mechanism to be explanatory because it accounts for the “dynamic process of bringing about” (Tabery 2004 , 10) chemical change. For chemists, mechanisms are causal explanations based on interventions that show “how some possibilities depend on others” (Woodward 2003 , (...) 375). Only possibilities are achievable because chemists face a number of challenges when they explain by means of a mechanism. †To contact the author, please write to: Department of Philosophy, Smith College, Northampton, MA 01063; e‐mail: [email protected]. (shrink)

By stressing the act rather than the relation of approximation, I argue that the magnitude of the error introduced should not be used as the sole criterion for judging the worth of the approximation. Magnitude is a necessary but not sufficient condition for such a judgement. Controllability, the absence of cancelling errors, and the approximation's justification are also important criteria to consider when praising or blaming an approximation. Boltzmann's discussion of the types of approximations used in the kinetic theory of (...) gases at the turn of the century illustrates the use of these criteria. (shrink)

Prediction is more than testing established theory by examining whether the prediction matches the data. To show this, I examine the practices of a community of scientists, known as threaders, who are attempting to predict the final, folded structure of a protein from its primary structure, i.e., its amino acid sequence. These scientists employ a careful and deliberate methodology of prediction. A key feature of the methodology is calibration. They calibrate in order to construct better models. The construction leads to (...) knowledge of how to construct or build an object. Thus, prediction serves a cognitive goal of model construction and not just model or theory testing. The kind of knowledge that results is relevantly different than theoretical knowledge. (shrink)

Philosophers disagree how abstract, theoretical principles can be applied to instances. This paper generates a puzzle for law theorists, causal theorists and inductivists alike. Intractability can force scientists to use a "semi-empirical" method, in which some of an equation's theoretically-determinable parameters are replaced with values taken directly from the data. This is not a purely deductive or inductive process, nor does it involve causes and capacities in any simple way (Humphreys 1995). I argue the predictive successes of such methods require (...) us to reanalyze our views about the nature of prediction, the status of models, and the goal(s) of science. When laws and experimental evidence are neither individually nor jointly sufficient for prediction, models become the locus of understanding. I analyze an historically important debate about the use of semi-empirical methods to construct potential energy surfaces. (shrink)

I argue that numerical and causal accuracy arguments can be successful only if: (1) the theories in use are known to be true, (2) computational difficulties do not exist, and (3) the experimental data are stable and resolved. When any one or more of these assumptions are not satisfied, additional justificational considerations must be invoked. I illustrate the need for range of validity and intelligibility claims with examples drawn from chemical kinetics. My arguments suggest that the realist and anti-realist accounts (...) of justification are incomplete. Finally, I sketch some reasons why additional justificatory criteria are needed. (shrink)

Abstract Philosophers have paid little attention to the kind of reduction involved in transforming an analytically intractable equation into solvable form. I argue that this practice is important because it involves the design of a basic level theory for use in a specific domain. The design process can lead to the construction of a new theory. As a result of my analysis, theory design emerges as an important category of analysis for scientific methodology. Similarities between design in technology and science (...) are explored to illuminate the heuristic function of such reductions. (shrink)

Definitions of sustainability—and criticisms of the definitions—abound. I argue that there are problems with the definitional approach itself and not just with any specific definition. Wittgenstein. Macmillan Publishing Company, New York, 1958) argued that definitions are not sufficient to determine meaning or to legislate correct usage of words. For both singular terms and general concepts, meaning is meaning-as-use, proceeding via examples that instruct within an already existing normative structure. Once we are clear on the ways in which use presupposes a (...) normative structure, I believe we will understand better the meaning of sustainability and its normative basis. On this view, sustainability will be vague and contested but not meaningless. And we will not have to be worried about the plethora of definitions. (shrink)

Heather M. Farley and Zachary A. Smith, Sustainability: If It’s Everything, Is It Nothing? xiv + 176 pp., index. New York: Routledge, 2014. $39.95 Leslie Paul Thiele, Sustainability. viii + 234 p., bibl., index. New York: Polity Press, 2013. $22.95 The authors of both of these books offer new definitions of sustainability. They do so in order to battle “faux interpretations” or “hypocritical” or “unsupported endorsements” of sustainability. While I think many people, including I expect many readers of this journal, (...) would agree that sustainability is a rather imprecise concept that sometimes gets misused, I am not convinced the definitions in these books offer a way forward. Partly this is due to the specific ways the authors develop their discussions, and partly it is due to issues connected to their shared methodological approach, viz. the search for a new, univocal, strong definition. After discussing each book, I examine briefly that shared .. (shrink)

Research on the oxidation of alloys supports the claim that natural scientists can and do use ideal type concepts when confronted with analytical or computational intractability. In opposition to those who collapse ideal types into 'standard' theoretical concepts, I argue ideal types possess a unique structure, function and axiology. In phenomenologically complex situations, scientists use these features to articulate experiment with theory generally and in particular to discover new boundary conditions. This conceptual articulation is achieved using models rather than objective (...) perceptual attributes alone. The analysis supports a claim of local rather than global identities of methodology. (shrink)

Until recently, realists and anti-realists alike have assumed that any approximations which appear in explanations and confirmations in the mathematically oriented physical and biological sciences are “mere distractions” (Laymon 1989, p. 353). When approximation techniques must be used, they are typically justified by appeals to their numerical accuracy. However, recent interest in computational complexity in the sciences has revealed that numerical accuracy is not always the only criterion which should be invoked to justify the use of approximations. Cartwright (1983), Franklin (...) (1988) and others have suggested that causal accuracy should be added as a criterion.Numerical and causal accuracy are important. However, they form a sufficient set of justificational criteria only when certain—often unstated—conditions obtain. These conditions are actually assumptions which are often not satisfied, especially in the computationally complex situations which characterize discovery and exploratory contexts. In these contexts, we need to concentrate on “delineating a justificatory set which is relevant to [the] given epistemic situation” (Duran 1988, p. 273). (shrink)

We show that \\) cannot be proved with one typical application of \\) in an intuitionistic extension of \ to higher types, but that this does not remain true when the law of the excluded middle is added. The argument uses Kohlenbach’s axiomatization of higher order reverse mathematics, results related to modified reducibility, and a formalization of Weihrauch reducibility.

We examine the reverse mathematics and computability theory of a form of Ramsey's theorem in which the linear n-tuples of a binary tree are colored.

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.

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.

We formulate a polarized version of Ramsey’s theorem for trees. For those exponents greater than 2, both the reverse mathematics and the computability theory associated with this theorem parallel that of its linear analog. For pairs, the situation is more complex. In particular, there are many reasonable notions of stability in the tree setting, complicating the analysis of the related results.

We show that a version of Ramsey’s theorem for trees for arbitrary exponents is equivalent to the subsystem \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${{\sf ACA}^\prime_{0}}$$\end{document} of reverse mathematics.

Simpson has claimed that “ATR0 is the weakest set of axioms which permits the development of a decent theory of countable ordinals” [8]. This paper provides empirical support for Simpson's claim. In particular, Cantor's Normal Form Theorem and Sherman's Inequality for countable well-orderings are both equivalent to ATR0. The proofs of these results require a substantial development of ordinal exponentiation and a strengthening of the comparability result in [3].

We show that when certain statements are provable in subsystems of constructive analysis using intuitionistic predicate calculus, related sequential statements are provable in weak classical subsystems. In particular, if a $\Pi^1_2$ sentence of a certain form is provable using E-HA ${}^\omega$ along with the axiom of choice and an independence of premise principle, the sequential form of the statement is provable in the classical system RCA. We obtain this and similar results using applications of modified realizability and the Dialectica interpretation. (...) These results allow us to use techniques of classical reverse mathematics to demonstrate the unprovability of several mathematical principles in subsystems of constructive analysis. (shrink)

We show that a statement HIL, which is motivated by a lemma of Hilbert and close in formulation to Hindman’s theorem, is actually much weaker than Hindman’s theorem. In particular, HIL is finitistically reducible in the sense of Hilbert’s program, while Hindman’s theorem is not.

We analyze the logical strength of theorems on marriage problems with unique solutions using the techniques of reverse mathematics, restricting our attention to problems in which each boy knows only finitely many girls. In general, these marriage theorems assert that if a marriage problem has a unique solution then there is a way to enumerate the boys so that for every m, the first m boys know exactly m girls. The strength of each theorem depends on whether the underlying marriage (...) problem is finite, infinite, or bounded. (shrink)

If α and β are ordinals, α ≤ β, and $\beta \nleq \alpha$ , then α + 1 ≤ β. The first result of this paper shows that the restriction of this statement to countable well orderings is provably equivalent to ACA 0 , a subsystem of second order arithmetic introduced by Friedman. The proof of the equivalence is reminiscent of Dekker's construction of a hypersimple set. An application of the theorem yields the equivalence of the set comprehension scheme ACA (...) 0 and an arithmetical transfinite induction scheme. (shrink)

One of the earliest applications of transfinite numbers is in the construction of derived sequences by Cantor [2]. In [6], the existence of derived sequences for countable closed sets is proved in ATR0. This existence theorem is an intermediate step in a proof that a statement concerning topological comparability is equivalent to ATR0. In actuality, the full strength of ATR0 is used in proving the existence theorem. To show this, we will derive a statement known to be equivalent to ATR0, (...) using only RCA0 and the assertion that every countable closed set has a derived sequence. We will use three of the subsystems of second order arithmetic defined by H. Friedman , which can be roughly characterized by the strength of their set comprehension axioms. RCA0 includes comprehension for Δmath image definable sets, ACA0 includes comprehension for arithmetical sets, and ATR0 appends to ACA0 a comprehension scheme for sets defined by transfinite recursion on arithmetical formulas. MSC: 03F35, 54B99. (shrink)

If there is a homeomorphic embedding of one set into another, the sets are said to be topologically comparable. Friedman and Hirst have shown that the topological comparability of countable closed subsets of the reals is equivalent to the subsystem of second order arithmetic denoted byATR 0. Here, this result is extended to countable closed locally compact subsets of arbitrary complete separable metric spaces. The extension uses an analogue of the one point compactification of ℝ.

Suppose that 〈xk〉k∈ℕ is a countable sequence of real numbers. Working in the usual subsystems for reverse mathematics, RCA0 suffices to prove the existence of a sequence of reals 〈uk〉k∈ℕ such that for each k, uk is the minimum of {x0, x1, …, xk}. However, if we wish to prove the existence of a sequence of integer indices of minima of initial segments of 〈xk〉k∈ℕ, the stronger subsystem WKL0 is required. Following the presentation of these reverse mathematics results, we will (...) derive computability theoretic corollaries and use them to illustrate a distinction between computable analysis and constructive analysis. (shrink)

A rank function for a directed graph G assigns elements of a well ordering to the vertices of G in a fashion that preserves the order induced by the edges. While topological sortings require a one-to-one matching of vertices and elements of the ordering, rank functions frequently must assign several vertices the same value. Theorems stating basic properties of rank functions vary significantly in logical strength. Using the techniques of reverse mathematics, we present results that require the subsystems ${\ensuremath{\vec{RCA}_0}}$ , (...) ${{\vec{ACA}_0}}$ , ${{\vec{ATR}_0}}$ , and ${{\vec{\Pi^1_1 - CA}_0}}$. (shrink)

This paper uses the framework of reverse mathematics to analyze the proof theoretic content of several statements concerning multiplication of countable well-orderings. In particular, a division algorithm for ordinal arithmetic is shown to be equivalent to the subsystem ATR0.

One of the earliest applications of Cantor's Normal Form Theorem is Jacobstahl's proof of the existence of prime factorizations of ordinals. Applying the techniques of reverse mathematics, we show that the full strength of the Normal Form Theorem is used in this proof.

This paper contains a corrected proof that the statement “every non-empty closed subset of a compact complete separable metric space is separably closed” implies the arithmetical comprehension axiom of reverse mathematics.

Recently, several authors have explored the connections between NP-complete problems for finite objects and the complexity of their analogs for infinite objects. In this paper, we will categorize infinite versions of several problems arising from finite complexity theory in terms of their recursion theoretic complexity and proof theoretic strength. These infinite analogs can behave in a variety of unexpected ways.

Two countable well orderings are weakly comparable if there is an order preserving injection of one into the other. We say the well orderings are strongly comparable if the injection is an isomorphism between one ordering and an initial segment of the other. In [5], Friedman announced that the statement “any two countable well orderings are strongly comparable” is equivalent to ATR 0 . Simpson provides a detailed proof of this result in Chapter 5 of [13]. More recently, Friedman has (...) proved that the statement “any two countable well orderings are weakly comparable” is equivalent to ATR 0 . The main goal of this paper is to give a detailed exposition of this result. (shrink)

We examine a number of results of infinite combinatorics using the techniques of reverse mathematics. Our results are inspired by similar results in recursive combinatorics. Theorems included concern colorings of graphs and bounded graphs, Euler paths, and Hamilton paths.

We prove that the statement “there is aksuch that for everyfthere is ak-bounded diagonally nonrecursive function relative tof” does not imply weak König’s lemma over${\rm{RC}}{{\rm{A}}_0} + {\rm{B\Sigma }}_2^0$. This answers a question posed by Simpson. A recursion-theoretic consequence is that the classic fact that everyk-bounded diagonally nonrecursive function computes a 2-bounded diagonally nonrecursive function may fail in the absence of${\rm{I\Sigma }}_2^0$.

This book covers a wide variety of topics in combinatorics and graph theory.

Extrapolating from the work of Mahlo , one can prove that given any pair of countable closed totally bounded subsets of complete separable metric spaces, one subset can be homeomorphically embedded in the other. This sort of topological comparability is reminiscent of the statements concerning comparability of well orderings which Friedman has shown to be equivalent to ATR0 over the weak base system RCA0. The main result of this paper states that topological comparability is also equivalent to ATR0. In Section (...) 1, the pertinent subsystems of second-order arithmetic and results on well orderings are reviewed. Sections 2 and 3 overview the encoding of metric spaces and homeomorphisms in second-order arithmetic. Section 4 contains a proof of the topological comparability result in ATR0. Section 5 contains the reversal, a derivation of ATR0 from the topological comparability result. In Section 6, additional information about the structure of the embeddings is obtained, culminating in an application to closed subsets of the real numbers. (shrink)