Most models of response time (RT) in elementary cognitive tasks implicitly assume that the speed-accuracy trade-off is continuous: When payoffs or instructions gradually increase the level of speed stress, people are assumed to gradually sacrifice response accuracy in exchange for gradual increases in response speed. This trade-off presumably operates over the entire range from accurate but slow responding to fast but chance-level responding (i.e., guessing). In this article, we challenge the assumption of continuity and propose a phase transition model (...) for RTs and accuracy. Analogous to the fast guess model (Ollman, 1966), our model postulates two modes of processing: a guess mode and a stimulus-controlled mode. From catastrophe theory, we derive two important predictions that allow us to test our model against the fast guess model and against the popular class of sequential sampling models. The first prediction—hysteresis in the transitions between guessing and stimulus-controlled behavior—was confirmed in an experiment that gradually changed the reward for speed versus accuracy. The second prediction—bimodal RT distributions—was confirmed in an experiment that required participants to respond in a way that is intermediate between guessing and accurate responding. (shrink)

I analyze the extent to which classical phase transitions, both first order and continuous, pose a challenge for intertheoretic reduction. My contention is that phase transitions are compatible with a notion of reduction that combines Nagelian reduction and what Thomas Nickles called Reduction2. I also argue that, even if the same approach to reduction applies to both types of phase transitions, there is a crucial difference in their physical treatment: in addition to the thermodynamic (...) limit, in continuous phase transitions there is a second infinite limit involved, which marks an important difference in the reduction of first-order and continuous phase transitions. (shrink)

Written at an undergraduate mathematical level, this book provides the essential theoretical tools and foundations required to develop basic models to explain collective phase transitions for a wide variety of ecosystems.

With the present paper I maintain that the group field theory (GFT) approach to quantum gravity can help us clarify and distinguish the problems of spacetime emergence from the questions about the nature of the quanta of space. I will show that the mechanism of phase transition suggests a form of indifference between scales (or phases) and that such an indifference allows us to black-box questions about the nature of the ontology of the fundamental levels of the theory. I (...) consider the GFT approach to quantum gravity which derives spacetime as an emergent property from abstract non-geometrical tetrahedra through a processes of phase transition. Because the physical interpretation of the tetrahedra is problematic in view of their (non)-spatiotemporal nature, I will apply the considerations about phase transitions to GFT and conclude that the fundamental ontology of the theory and the mechanism of spacetime emergence can and should be treated separately. (shrink)

We classify the phase transition thresholds from provability to unprovability for certain Friedman-style miniaturizations of Kruskal's Theorem and Higman's Lemma. In addition we prove a new and unexpected phase transition result for ε0. Motivated by renormalization and universality issues from statistical physics we finally state a universality hypothesis.

In this paper, I analyze the extent to which classical phase transitions, especially continuous phase transitions, impose a challenge for reduction- ism. My main contention is that classical phase transitions are compatible with reduction, at least with the notion of limiting reduction, which re- lates the behavior of physical quantities in different theories under certain limiting conditions. I argue that this conclusion follows even after rec- ognizing the existence of two infinite limits involved in (...) the treatment of continuous phase transitions. (shrink)

We classify a sharp phase transition threshold for Friedman’s finite adjacent Ramsey theorem. We extend the method for showing this result to two previous classifications involving Ramsey theorem variants: the Paris–Harrington theorem and the Kanamori–McAloon theorem. We also provide tools to remove ad hoc arguments from the proofs of phase transition results as much as currently possible.

Gödel’s first incompleteness result from 1931 states that there are true assertions about the natural numbers which do not follow from the Peano axioms. Since 1931 many researchers have been looking for natural examples of such assertions and breakthroughs were obtained in the seventies by Jeff Paris [Some independence results for Peano arithmetic. J. Symbolic Logic 43 725–731] , Handbook of Mathematical Logic, North-Holland, Amsterdam, 1977] and Laurie Kirby [L. Kirby, Jeff Paris, Accessible independence results for Peano Arithmetic, Bull. of (...) the LMS 14 285–293]) and Harvey Friedman [S.G. Simpson, Non-provability of certain combinatorial properties of finite trees, in: Harvey Friedman’s Research on the Foundations of Mathematics, North-Holland, Amsterdam, 1985, pp. 87–117; R. Smith, The consistency strength of some finite forms of the Higman and Kruskal theorems, in: Harvey Friedman’s Research on the Foundations of Mathematics, North-Holland, Amsterdam, 1985, pp. 119–136] who produced the first mathematically interesting independence results in Ramsey theory and well-order and well-quasi-order theory .In this article we investigate Friedman-style principles of combinatorial well-foundedness for the ordinals below ε0. These principles state that there is a uniform bound on the length of decreasing sequences of ordinals which satisfy an elementary recursive growth rate condition with respect to their Gödel numbers.For these independence principles we classify their phase transitions, i.e. we classify exactly the bounding conditions which lead from provability to unprovability in the induced combinatorial well-foundedness principles.As Gödel numbering for ordinals we choose the one which is induced naturally from Gödel’s coding of finite sequences from his classical 1931 paper on his incompleteness results.This choice makes the investigation highly non-trivial but rewarding and we succeed in our objectives by using an intricate and surprising interplay between analytic combinatorics and the theory of descent recursive functions. For obtaining the required bounds on count functions for ordinals we use a classical 1961 Tauberian theorem of Parameswaran which apparently is far remote from Gödel’s theorem. (shrink)

Vincent Ardourel discusses the eliminability of infinite limits in the explanations of phase transitions—an important point in the debate on the reducibility of thermodynamics to statistical mechanics. To this end, he examines alternative physical theories that deal with phase transitions in finite systems.

We elaborate Weiermann-style phase transitions for well-partial-orderings (wpo) determined by iterated finite sequences under Higman-Friedman style embedding with Gordeev’s symmetric gap condition. For every d-times iterated wpo \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\left({\rm S}\text{\textsc{eq}}^{d}, \trianglelefteq _{d}\right)}$$\end{document} in question, d > 1, we fix a natural extension of Peano Arithmetic, \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${T \supseteq \sf{PA}}$$\end{document}, that proves the corresponding second-order sentence \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} (...) \setlength{\oddsidemargin}{-69pt} \begin{document}$${\sf{WPO}\left({\rm S}{\textsc{eq}}^{d}, \trianglelefteq _{d}\right) }$$\end{document}. Having this we consider the following parametrized first-order slow well-partial-ordering sentence \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\sf{SWP}\left({\rm S}\text{\textsc{eq}}^{d}, \trianglelefteq _{d}, r\right):}$$\end{document}\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\left( \forall K > 0 \right) \left( \exists M > 0\right) \left( \forall x_{0},\ldots,x_{M}\in {\rm S}\text{\textsc{eq}}^{d}\right)$$\end{document}\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\left( \left( \forall i\leq M\right) \left( \left| x_{i}\right| 1}$$\end{document} then \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\sf{SWP}\left({\rm S}\text{\textsc{eq}}^{d}, \trianglelefteq _{d},r \right) }$$\end{document} is not provable in T.Moreover, by the well-known proof theoretic equivalences we can just as well replace T by PA or ACA0 and \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\Delta _{1}^{1}\sf{CA}}$$\end{document}, if d = 2 and d = 3, respectively.In the limit case d → ∞ we replaceEFA-provably computable reals r by EFA-provably computable functions \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${f: \mathbb{N} \rightarrow \mathbb{R}_{+}}$$\end{document} and prove analogous theorems. (In the sequel we denote by \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\mathbb{R}_{+}}$$\end{document} the set of EFA-provably computable positive reals). In the basic case T = PA we strengthen the basic phase transition result by adding the following static threshold clause\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\sf{SWP}\left({\rm S}\text{\textsc{eq}}^{2}, \trianglelefteq _{2}, 1\right)}$$\end{document} is still provable in T = PA (actually in EFA). Furthermore we prove the following dynamic threshold clauses which, loosely speaking are obtained by replacing the static threshold t by slowly growing functions 1α given by \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${1_{\alpha }\left( i\right)\,{:=}\,1+\frac{1}{H_{\alpha }^{-1}\left(i\right) }, H_{\alpha}}$$\end{document} being the familiar fast growing Hardy function and \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${H_{\alpha }^{-1}\left( i\right)\,{:=}\,\rm min \left\{ j \mid H_{\alpha } \left ( j\right) \geq i \right\}}$$\end{document} the corresponding slowly growing inversion. If \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\alpha < \varepsilon _{0}}$$\end{document}, then \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\sf{SWP}\left({\rm S}\text{\textsc{eq}}^{2}, \trianglelefteq _{2}, 1_{\alpha}\right)}$$\end{document} is provable in T = PA. \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\sf{SWP}\left( {\rm S}\text{\textsc{eq}}^{2}, \trianglelefteq _{2},1_{\varepsilon _{0}}\right)}$$\end{document} is not provable in T = PA. We conjecture that this pattern is characteristic for all \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${T\supseteq \sf{PA}}$$\end{document} under consideration and their proof-theoretical ordinals o (T ), instead of \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\varepsilon _{0}}$$\end{document}. (shrink)

Bifurcation analysis of a real-time implementation of an ART network, which is functionally similar to the generalized localist model discussed in Page's manifesto shows that it yields a phase transition from local to distributed representation owing to continuous variation of the range of inhibitory connections. Hence there appears to be a qualitative dichotomy between local and distributed representations at the level of connectionistic networks conceived of as instances of nonlinear dynamical systems.

Ideas from random graph theory are used to give an heuristic argument that associative memory structure depends discontinuously on pattern recognition ability. This argument suggests that there may be a certain minimal size for intelligent systems.

Two classic learning situations are critically reviewed and interpreted from a synergetic point of view: human learning of complex skills, and animal discrimination learning. Both show typical characteristics of nonlinear phase transitions: instability, fluctuations, critical slowing down and reorganisation. Plateaus in the acquisition curves of complex skills can be viewed as phases of arrested progress in which a reorganisation of simple skills is necessary before their integration into complex units is possible. Fluctuations and critical slowing down are expressed (...) in instances of "vicarious trial-and-error," which describe the oscillating behavior of rats at a choice point that is shown only just before discrimination learning is completed. It is concluded that education might pay more attention to the role of individual learning rhythms. (shrink)

Multiple theories of problem-solving hypothesize that there are distinct qualitative phases exhibited during effective problem-solving. However, limited research has attempted to identify when transitions between phases occur. We integrate theory on collaborative problem-solving with dynamical systems theory suggesting that when a system is undergoing a phase transition it should exhibit a peak in entropy and that entropy levels should also relate to team performance. Communications from 40 teams that collaborated on a complex problem were coded for occurrence of (...) problem-solving processes. We applied a sliding window entropy technique to each team's communications and specified criteria for identifying data points that qualify as peaks and determining which peaks were robust. We used multilevel modeling, and provide a qualitative example, to evaluate whether phases exhibit distinct distributions of communication processes. We also tested whether there was a relationship between entropy values at transition points and CPS performance. We found that a proportion of entropy peaks was robust and that the relative occurrence of communication codes varied significantly across phases. Peaks in entropy thus corresponded to qualitative shifts in teams’ CPS communications, providing empirical evidence that teams exhibit phase transitions during CPS. Also, lower average levels of entropy at the phase transition points predicted better CPS performance. We specify future directions to improve understanding of phase transitions during CPS, and collaborative cognition, more broadly. (shrink)

According to standard (quantum) statistical mechanics, the phenomenon of a phase transition, as described in classical thermodynamics, cannot be derived unless one assumes that the system under study is infinite. This is naturally puzzling since real systems are composed of a finite number of particles; consequently, a well‐known reaction to this problem was to urge that the thermodynamic definition of phase transitions (in terms of singularities) should not be “taken seriously.” This article takes singularities seriously and analyzes (...) their role by using the well‐known distinction between data and phenomena , in an attempt to better understand the origin of the puzzle. *Received April 2009; revised July 2009. †To contact the author, please write to: University of Cambridge, Department of History and Philosophy of Science, Free School Lane, Cambridge CB2 3RH, United Kingdom; e‐mail: [email protected]. (shrink)

This topic has been discussed earlier on the FOM email list in various guises. The common theme is: big numbers and long sequences associated with mathematical objects. See..

Various claims regarding intertheoretic reduction, weak and strong notions of emergence, and explanatory fictions have been made in the context of first-order thermodynamic phase transitions. By appealing to John Norton’s recent distinction between approximation and idealization, I argue that the case study of anyons and fractional statistics, which has received little attention in the philosophy of science literature, is more hospitable to such claims. In doing so, I also identify three novel roles that explanatory fictions fulfill in science. (...) Furthermore, I scrutinize the claim that anyons, as they are ostensibly manifested in the fractional quantum Hall effect, are emergent entities and urge caution. Consequently, it is suggested that a particular notion of strong emergence signals the need for the development of novel physical–mathematical research programs. (shrink)

The paradox of phase transitions raises the problem of how to reconcile the fact that we see phase transitions happen in concrete, finite systems around us, with the fact that our best theories—i.e. statistical-mechanical theories of phase transitions—tell us that phase transitions occur only in infinite systems. In this paper we aim to clarify to which extent this paradox is relative to the mathematical framework which is used in these theories, i.e. classical (...) mathematics. To this aim, we will explore the philosophical consequences of adopting constructive instead of classical mathematics in a statistical-mechanical theory of phase transitions. It will be shown that constructive mathematics forces certain ‘de-idealizations’ of such theories: talk of actually infinite systems is meaningless, there are no discontinuous functions, and—in a sense which will be clarified—constructive real numbers reflect our imperfect methods of determining the values of physical quantities. As such, so it will be argued, constructive mathematics offers a means to gain insight in the idealizations introduced in classical theories and the philosophical issues surrounding them. (shrink)

The paradox of phase transitions raises the problem of how to reconcile the fact that we see phase transitions happen in concrete, finite systems around us, with the fact that our best theories—i.e. statistical-mechanical theories of phase transitions—tell us that phase transitions occur only in infinite systems. In this paper we aim to clarify to which extent this paradox is relative to the mathematical framework which is used in these theories, i.e. classical (...) mathematics. To this aim, we will explore the philosophical consequences of adopting constructive instead of classical mathematics in a statistical-mechanical theory of phase transitions. It will be shown that constructive mathematics forces certain ‘de-idealizations’ of such theories: talk of actually infinite systems is meaningless, there are no discontinuous functions, and—in a sense which will be clarified—constructive real numbers reflect our imperfect methods of determining the values of physical quantities. As such, so it will be argued, constructive mathematics offers a means to gain insight in the idealizations introduced in classical theories and the philosophical issues surrounding them. (shrink)

It is well known that the Ackermann function can be defined via diagonalization from an iteration hierarchy which is built on a start function like the successor function. In this paper we study for a given start function g iteration hierarchies with a sub-linear modulus h of iteration. In terms of g and h we classify the phase transition for the resulting diagonal function from being primitive recursive to being Ackermannian.

Oncogenic hyperplasia is the first and inevitable stage of formation of a (solid) tumor. This stage is also the core of many other proliferative diseases. The present work proposes the first minimal model that combines homeorhesis with oncogenic hyperplasia where the latter is regarded as a genotoxically activated homeorhetic dysfunction. This dysfunction is specified as the transitions of the fluid of cells from a fluid, homeorhetic state to a solid, hyperplastic-tumor state, and back. The key part of the model (...) is a nonlinear reaction-diffusion equation (RDE) where the biochemical-reaction rate is generalized to the one in the well-known Schlögl physical theory of the non-equilibrium phase transitions. A rigorous analysis of the stability and qualitative aspects of the model, where possible, are presented in detail. This is related to the spatially homogeneous case, i.e. when the above RDE is reduced to a nonlinear ordinary differential equation. The mentioned genotoxic activation is treated as a prevention of the quiescent G0-stage of the cell cycle implemented with the threshold mechanism that employs the critical concentration of the cellular fluid and the nonquiescent-cell-duplication time. The continuous tumor morphogeny is described by a time-space-dependent cellular-fluid concentration. There are no sharp boundaries (i.e. no concentration jumps exist) between the domains of the homeorhesis- and tumor-cell populations. No presumption on the shape of a tumor is used. To estimate a tumor in specific quantities, the model provides the time-dependent tumor locus, volume, and boundary that also points out the tumor shape and size. The above features are indispensable in the quantitative development of antiproliferative drugs or therapies and strategies to prevent oncogenic hyperplasia in cancer and other proliferative diseases. The work proposes an analytical-numerical method for solving the aforementioned RDE. A few topics for future research are suggested. (shrink)

The first classification of general types of transition between phases of matter, introduced by Paul Ehrenfest in 1933, lies at a crossroads in the thermodynamical study of critical phenomena. It arose following the discovery in 1932 of a suprising new phase transition in liquid helium, the “lambda transition,” when W. H. Keesom and coworkers in Leiden, Holland observed a λhaped “jump” discontinuity in the curve giving the temperature dependence of the specific heat of helium at a critical value. This (...) apparent jump led Ehrenfest to introduce a classification of phase transitions on the basis of jumps in derivatives of the free energy function. This classification was immediately applied by A.J. Rutgers to the study of the transition from the normal to superconducting state in metals. Eduard Justi and Max von Laue soon questioned the possibility of its class of “second-order phase transitions” -- of which the “lambda transition was believed to be the arche type -- but C.J. Gorter and H.B.G. Casimir used an “order parameter to demonstrate their existence in superconductors. As a crossroads of study, the Ehrenfest classification was forced to undergo a slow, adaptive evolution during subsequent decades. During the 1940s the classification was increasingly used in discussions of liquid-gas, order-disorder, paramagnetic-ferromagnetic and normal-super-conducting phase transitions. Already in 1944 however, Lars Onsagers solution of the Ising model for two-dimensional magnets was seen to possess a derivative with a logarithmic divergence rather than a jump as the critical point was approached. In the 1950s, experiments further revealed the lambda transition in helium to exhibit similar behavior. Rather than being a prime example of an Ehrenfest phase transition, the lambda transition was seen to lie outside the Ehrenfest classification. The Ehrenfest scheme was then extended to include such singularities, most notably by A. Brain Pippard in 1957, with widespread acceptance. During the 1960s these logarithmic infinities were the focus of the investigation of “scaling” by Leo Kadanoff, B. Widom and others. By the 1970s, a radically simplified binary classification of phase transitions into “first-order” and “continuous” transitions was increasingly adopted. (shrink)

Subjective experience suggests that we continuously observe, perceive, and evaluate the environment as we make decisions and intentional actions. The percept of continuity of our cognition, however, is an illusion. In the past decades, ample experimental evidence has been accumulated indicating that cognition evolves through a sequence of discontinuities and transients, and there are discernable neural processes correlating with the cognitive sequences. These discontinuities are crucial in the intentional action-perception cycle, as they mark the cognitive 'aha' moment of deep understanding (...) and conscious insight. Walter Freeman developed a hierarchical model to describe these physiological findings, culminating in the cinematic theory of cognition. Following the traditions of metastability, transient neurodynamics, and brain chaos, discontinuities are described as phase transitions in the cortical neuropil. This approach not only leads to deep theoretical insights of neural correlates of cognition and consciousness, but it also helps to form a conceptual framework to create artificially intelligent devices that are in harmony with humans and serve peaceful development of humanity. (shrink)

Phase transitions are an important instance of putatively emergent behavior. Unlike many things claimed emergent by philosophers, the alleged emergence of phase transitions stems from both philosophical and scientific arguments. Here we focus on the case for emergence built from physics, in particular, arguments based upon the infinite idealization invoked in the statistical mechanical treatment of phase transitions. After teasing apart several challenges, we defend the idea that phase transitions are best thought (...) of as conceptually novel, but not ontologically or explanatorily irreducible to finite physics; indeed, by looking at ongoing work on “smooth phase transitions” we even suggest that they’re not even conceptually novel. In the case of renormalization group theory, consideration of infinite systems and their singular behavior provides a central theoretical tool, but this is compatible with an explanatory reduction. Phase transitions may be “emergent” in some sense of this protean term, but not in a sense that is incompatible with the reductionist project broadly construed. (shrink)