Bayesian reverse-engineering is a research strategy for developing three-level explanations of behavior and cognition. Starting from a computational-level analysis of behavior and cognition as optimal probabilistic inference, Bayesian reverse-engineers apply numerous tweaks and heuristics to formulate testable hypotheses at the algorithmic and implementational levels. In so doing, they exploit recent technological advances in Bayesian artificial intelligence, machine learning, and statistics, but also consider established principles from cognitive psychology and neuroscience. Although these tweaks and heuristics are highly pragmatic in character and (...) are often deployed unsystematically, Bayesian reverse-engineering avoids several important worries that have been raised about the explanatory credentials of Bayesian cognitive science: the worry that the lower levels of analysis are being ignored altogether; the challenge that the mathematical models being developed are unfalsifiable; and the charge that the terms ‘optimal’ and ‘rational’ have lost their customary normative force. But while Bayesian reverse-engineering is therefore a viable and productive research strategy, it is also no fool-proof recipe for explanatory success. (shrink)

Perceptual learning can be defined as practice-induced improvement in the ability to perform specific perceptual tasks. We previously proposed the Reverse Hierarchy Theory as a unifying concept that links behavioral findings of visual learning with physiological and anatomical data. Essentially, it asserts that learning is a top-down guided process, which begins at high-level areas of the visual system, and when these do not suffice, progresses backwards to the input levels, which have a better signal-to-noise ratio. This simple concept has proved (...) powerful in explaining a broad range of findings, including seemingly contradicting data. We now extend this concept to describe the dynamics of skill acquisition and interpret recent behavioral and electrophysiological findings. (shrink)

Richard Feynman has claimed that anti-particles are nothing but particles `propagating backwards in time'; that time reversing a particle state always turns it into the corresponding anti-particle state. According to standard quantum field theory textbooks this is not so: time reversal does not turn particles into anti-particles. Feynman's view is interesting because, in particular, it suggests a nonstandard, and possibly illuminating, interpretation of the CPT theorem. In this paper, we explore a classical analog of Feynman's view, in the context (...) of the recent debate between David Albert and David Malament over time reversal in classical electromagnetism. (shrink)

'The arrow of time' refers to the curious asymmetry that distinguishes the future from the past. Reversing the Arrow of Time argues that there is an intimate link between the symmetries of 'time itself' and time reversal symmetry in physical theories, which has wide-ranging implications for both physics and its philosophy. This link helps to clarify how we can learn about the symmetries of our world, how to understand the relationship between symmetries and what is real, and how to (...) overcome pervasive illusions about the direction of time. Roberts explains the significance of time reversal in a way that intertwines physics and philosophy, to establish what the arrow of time means and how we can come to know it. This book is both mathematically and philosophically rigorous yet remains accessible to advanced undergraduates in physics and the philosophy of physics. This title is also available as Open Access on Cambridge Core. (shrink)

A theory is usually said to be time reversible if whenever a sequence of states S 1 , S 2 , S 3 is possible according to that theory, then the reverse sequence of time reversed states S 3 T , S 2 T , S 1 T is also possible according to that theory; i.e., one normally not only inverts the sequence of states, but also operates on the states with a time reversal operator T . David Albert (...) and Paul Horwich have suggested that one should not allow such time reversal operations T on states. I will argue that time reversal operations on fundamental states should be allowed. I will furthermore argue that the form that time reversal operations take is determined by the type of fundamental geometric quantities that occur in nature and that we have good reason to believe that the fundamental geometric quantities that occur in nature correspond to irreducible representations of the Lorentz transformations. Finally, I will argue that we have good reason to believe that space-time has a temporal orientation. (shrink)

The phenomenon of disagreement has recently been brought into focus by the debate between contextualists and relativist invariantists about epistemic expressions such as ‘might’, ‘probably’, indicative conditionals, and the deontic ‘ought’. Against the orthodox contextualist view, it has been argued that an invariantist account can better explain apparent disagreements across contexts by appeal to the incompatibility of the propositions expressed in those contexts. This paper introduces an important and underappreciated phenomenon associated with epistemic expressions — a phenomenon that we call (...) reversibility. We argue that the invariantist account of disagreement is incompatible with reversibility, and we go on to show that reversible sentences cast doubt on the putative data about disagreement, even without assuming invariantism. Our argument therefore undermines much of the motivation for invariantism, and provides a new source for constraints on the proper explanation of purported data about disagreement. (shrink)

Reverse mathematics is a program in mathematical logic that seeks to give precise answers to the question of which axioms are necessary in order to prove theorems of "ordinary mathematics": roughly speaking, those concerning structures that are either themselves countable, or which can be represented by countable "codes". This includes many fundamental theorems of real, complex, and functional analysis, countable algebra, countable infinitary combinatorics, descriptive set theory, and mathematical logic. This entry aims to give the reader a broad introduction to (...) the history, methodology, and results of the reverse mathematics program, with a particular focus on its connections to foundational programs such as finitism, constructivism, and predicativism. (shrink)

This book presents reverse mathematics to a general mathematical audience for the first time. Reverse mathematics is a new field that answers some old questions. In the two thousand years that mathematicians have been deriving theorems from axioms, it has often been asked: which axioms are needed to prove a given theorem? Only in the last two hundred years have some of these questions been answered, and only in the last forty years has a systematic approach been developed. In Reverse (...) Mathematics, John Stillwell gives a representative view of this field, emphasizing basic analysis--finding the "right axioms" to prove fundamental theorems--and giving a novel approach to logic. Stillwell introduces reverse mathematics historically, describing the two developments that made reverse mathematics possible, both involving the idea of arithmetization. The first was the nineteenth-century project of arithmetizing analysis, which aimed to define all concepts of analysis in terms of natural numbers and sets of natural numbers. The second was the twentieth-century arithmetization of logic and computation. Thus arithmetic in some sense underlies analysis, logic, and computation. Reverse mathematics exploits this insight by viewing analysis as arithmetic extended by axioms about the existence of infinite sets. Remarkably, only a small number of axioms are needed for reverse mathematics, and, for each basic theorem of analysis, Stillwell finds the "right axiom" to prove it. By using a minimum of mathematical logic in a well-motivated way, Reverse Mathematics will engage advanced undergraduates and all mathematicians interested in the foundations of mathematics. (shrink)

Reverse analyses of three proofs of the Sylvester-Gallai theorem lead to three different and incompatible axiom systems. In particular, we show that proofs respecting the purity of the method, using only notions considered to be part of the statement of the theorem to be proved, are not always the simplest, as they may require axioms which proofs using extraneous predicates do not rely upon.

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)

This article deals with the question of what time reversal means. It begins with a presentation of the standard account of time reversal, with plenty of examples, followed by a popular non-standard account. I argue that, in spite of recent commentary to the contrary, the standard approach to the meaning of time reversal is the only one that is philosophically and physically viable. The article concludes with a few open research problems about time reversal.

In this paper, we propose a weak regularity principle which is similar to both weak König's lemma and Ramsey's theorem. We begin by studying the computational strength of this principle in the context of reverse mathematics. We then analyze different ways of generalizing this principle.

The AGM (Alchourrón-Gärdenfors-Makinson) model of belief change is extended to cover changes on sets of beliefs that are not closed under logical consequence (belief bases). Three major types of change operations, namely contraction, internal revision, and external revision are axiomatically characterized, and their interrelations are studied. In external revision, the Levi identity is reversed in the sense that one first adds the new belief to the belief base, and afterwards contracts its negation. It is argued that external revision represents an (...) intuitively plausible way of revising one's beliefs. Since it typically involves the temporary acceptance of an inconsistent set of beliefs, it can only be used in belief representations that distinguish between different inconsistent sets of belief. (shrink)

We investigate the reverse-mathematical status of several theorems to the effect that the natural number system is second-order categorical. One of our results is as follows. Define a system to be a triple A,i,f such that A is a set and i∈A and f:A→A. A subset X⊆A is said to be inductive if i∈X and ∀a ∈X). The system A,i,f is said to be inductive if the only inductive subset of A is A itself. Define a Peano system to be (...) an inductive system such that f is one-to-one and i∉the range of f. The standard example of a Peano system is N,0,S where N={0,1,2,…,n,…}=the set of natural numbers and S:N→N is given by S=n+1 for all n∈N. Consider the statement that all Peano systems are isomorphic to N,0,S. We prove that this statement is logically equivalent to WKL0 over RCA0⁎ source. From this and similar equivalences we draw some foundational/philosophical consequences. (shrink)

We study theorems of ordered groups from the perspective of reverse mathematics. We show that suffices to prove Hölder's Theorem and give equivalences of both (the orderability of torsion free nilpotent groups and direct products, the classical semigroup conditions for orderability) and (the existence of induced partial orders in quotient groups, the existence of the center, and the existence of the strong divisible closure).

Reverse inference in cognitive neuropsychology has been characterized as inference to ‘psychological processes’ from ‘patterns of activation’ revealed by functional magnetic resonance or other scanning techniques. Several arguments have been provided against the possibility. Focusing on Machery’s presentation, we attempt to clarify the issues, rebut the impossibility arguments, and propose and illustrate a strategy for reverse inference. 1 The Problem of Reverse Inference in Cognitive Neuropsychology2 The Arguments2.1 The anti-Bayesian argument3 Patterns of Activation4 Reverse Inference Practiced5 Seek and Ye Shall (...) Find, Maybe6 Conclusion. (shrink)

In the last decade, experimental philosophers have documented systematic asymmetries in the attributions of mental attitudes to agents who produce different types of side effects. We argue that this effect is driven not simply by the violation of a norm, but by salient-norm violation. As evidence for this hypothesis, we present two new studies in which two conflicting norms are present, and one or both of them is raised to salience. Expanding one’s view to these additional cases presents, we argue, (...) a fuller conception of the side-effect effect, which can be reversed by reversing which norm is salient. (shrink)

This paper begins by raising a puzzle about what function our use of the word ‘rational’ could serve. To solve the puzzle, I introduce a view I call Epistemic Communism: we use epistemic evaluations to promote coordination among our basic belief-forming rules, and the function of this is to make the acquisition of knowledge by testimony more efficient.

This paper is essentially a quantum philosophical challenge: starting from simple assumptions, we argue about an ontological approach to quantum mechanics. In this paper, we will focus only on the assumptions. While these assumptions seems to solve the ontological aspect of theory many others epistemological problems arise. For these reasons, in order to prove these assumptions, we need to find a consistent mathematical context (i.e. time reverse problem, quantum entanglement, implications on quantum fields, Schr¨odinger cat states, the role of observer, (...) the role of mind ). (shrink)

Reverse mathematics studies which subsystems of second order arithmetic are equivalent to key theorems of ordinary, non-set-theoretic mathematics. The main philosophical application of reverse mathematics proposed thus far is foundational analysis, which explores the limits of different foundations for mathematics in a formally precise manner. This paper gives a detailed account of the motivations and methodology of foundational analysis, which have heretofore been largely left implicit in the practice. It then shows how this account can be fruitfully applied in the (...) evaluation of major foundational approaches by a careful examination of two case studies: a partial realization of Hilbert’s program due to Simpson [1988], and predicativism in the extended form due to Feferman and Schütte. -/- Shore [2010, 2013] proposes that equivalences in reverse mathematics be proved in the same way as inequivalences, namely by considering only omega-models of the systems in question. Shore refers to this approach as computational reverse mathematics. This paper shows that despite some attractive features, computational reverse mathematics is inappropriate for foundational analysis, for two major reasons. Firstly, the computable entailment relation employed in computational reverse mathematics does not preserve justification for the foundational programs above. Secondly, computable entailment is a Pi-1-1 complete relation, and hence employing it commits one to theoretical resources which outstrip those available within any foundational approach that is proof-theoretically weaker than Pi-1-1-CA0. (shrink)

The extraordinary parallel between the psychological theory of reversals (Apter, 1982) and the anthropological theory of anti-structure (Turner, 1982)-- both derived independently and almost simultaneously from entirely different kinds of evidence and research-- would seem to point to something profound and universal in human experience which has been curiously neglected in the behavioural sciences and entirely ignored in consciousness studies. What I will do here is to introduce reversal theory, show how it applies to ritual, and then compare it (...) with Victor Turner's well-known approach to the very same topic. Reversal theory has in fact been used to elucidate many diverse social phenomena, for example criminal violence, military combat, sexual behaviour, family relationships, soccer hooliganism, organizational culture, leadership, team sports, social advocacy and classroom management (see review in Apter, 2001a). The present paper extends these ideas to ritual for the first time, and makes reference especially to the work of Turner and his idea of cultural inversions (Turner, 1969). Reversal theory is also about inversions, but the inversions in this case (i.e. reversals) occur at the level of individual psychology and are identified initially as experiential rather than behavioural or social. This paper will explore the relationship between these two kinds of reversal, psychological and anthropological. (shrink)

This paper aims to clarify Merleau-Ponty’s difficult concept of “reversibility” by interpreting it as resuming the dialectical critique of the rationalist and empiricist tradition that informs Merleau-Ponty’s earlier work. The focus is on reversibility in “Eye and Mind,” as dismantling the traditional dualism of activity and passivity. This clarification also puts reversibility in continuity with the Phenomenology’s appropriation of Kant, letting us note an affiliation between Merleau-Ponty’s reversibility and Heidegger’s Ereignis: in each case being itself already performs the operation that (...) Kant had located in the imagination. Reversibility discovers this Kantian imagination moving in place, Ereignis discovers it in temporality. (shrink)

We initiate the reverse mathematics of general topology. We show that a certain metrization theorem is equivalent to Π2 1 comprehension. An MF space is defined to be a topological space of the form MF(P) with the topology generated by $\lbrace N_p \mid p \in P \rbrace$ . Here P is a poset, MF(P) is the set of maximal filters on P, and $N_p = \lbrace F \in MF(P) \mid p \in F \rbrace$ . If the poset P is countable, (...) the space MF(P) is said to be countably based. The class of countably based MF spaces can be defined and discussed within the subsystem ACA0 of second order arithmetic. One can prove within ACA0 that every complete separable metric space is homeomorphic to a countably based MF space which is regular. We show that the converse statement, "every countably based MF space which is regular is homeomorphic to a complete separable metric space," is equivalent to Π2 1-CA0. The equivalence is proved in the weaker system Π1 1-CA0. This is the first example of a theorem of core mathematics which is provable in second order arithmetic and implies Π2 1 comprehension. (shrink)

We initiate the reverse mathematics of general topology. We show that a certain metrization theorem is equivalent to Π12 comprehension. An MF space is defined to be a topological space of the form MF with the topology generated by {Np ∣ p ϵ P}. Here P is a poset, MF is the set of maximal filters on P, and Np = {F ϵ MF ∣ p ϵ F }. If the poset P is countable, the space MF is said to (...) be countably based. The class of countably based MF spaces can be defined and discussed within the subsystem ACA0 of second order arithmetic. One can prove within ACA0 that every complete separable metric space is homeomorphic to a countably based MF space which is regular. We show that the converse statement, “every countably based MF space which is regular is homeomorphic to a complete separable metric space,” is equivalent to. The equivalence is proved in the weaker system. This is the first example of a theorem of core mathematics which is provable in second order arithmetic and implies Π12 comprehension. (shrink)

Modal ontological arguments argue from the possible existence of a perfect being to the actual (necessary) existence of a perfect being. But modal ontological arguments have a problem of symmetry; they can be run in both directions. Reverse ontological arguments argue from the possible nonexistence of a perfect being to the actual (necessary) nonexistence of a perfect being. Some familiar points about the necessary a posteriori, however, show that the symmetry can be broken in favour of the ontological argument.

A theory is usually said to be time reversible if whenever a sequence of states S 1, S 2, S 3 is possible according to that theory, then the reverse sequence of time reversed states S 3 T, S 2 T, S 1 T is also possible according to that theory; i.e., one normally not only inverts the sequence of states, but also operates on the states with a time reversal operator T. David Albert and Paul Horwich have suggested (...) that one should not allow such time reversal operations T on states. I will argue that time reversal operations on fundamental states should be allowed. I will furthermore argue that the form that time reversal operations take is determined by the type of fundamental geometric quantities that occur in nature and that we have good reason to believe that the fundamental geometric quantities that occur in nature correspond to irreducible representations of the Lorentz transformations. Finally, I will argue that we have good reason to believe that space-time has a temporal orientation. (shrink)

What would it be for a process to happen backwards in time? Would such a process involve different causal relations? It is common to understand the time-reversal invariance of a physical theory in causal terms, such that whatever can happen forwards in time can also happen backwards in time. This has led many to hold that time-reversal symmetry is incompatible with the asymmetry of cause and effect. This article critiques the causal reading of time reversal. First, I (...) argue that the causal reading requires time-reversal-related models to be understood as representing distinct possible worlds and, on such a reading, causal relations are compatible with time-reversal symmetry. Second, I argue that the former approach does, however, raise serious sceptical problems regarding the causal relations of paradigm causal processes and as a consequence there are overwhelming reasons to prefer a non-causal reading of time reversal, whereby time reversal leaves causal relations invariant. On the non-causal reading, time-reversal symmetry poses no significant conceptual nor epistemological problems for causation. _1_ Introduction _1.1_ The directionality argument _1.2_ Time reversal _2_ What Does Time Reversal Reverse? _2.1_ The B- and C-theory of time _2.2_ Time reversal on the C-theory _2.3_ Answers _3_ Does Time Reversal Reverse Causal Relations? _3.1_ Causation, billiards, and snooker _3.2_ The epistemology of causal direction _3.3_ Answers _4_ Is Time-Reversal Symmetry Compatible with Causation? _4.1_ Incompatibilism _4.2_ Compatibilism _4.3_ Answers _5_ Outlook. (shrink)

In his remarkable paper Formalism 64, Robinson defends his eponymous position concerning the foundations of mathematics, as follows:Any mention of infinite totalities is literally meaningless.We should act as if infinite totalities really existed. Being the originator of Nonstandard Analysis, it stands to reason that Robinson would have often been faced with the opposing position that ‘some infinite totalities are more meaningful than others’, the textbook example being that of infinitesimals. For instance, Bishop and Connes have made such claims regarding infinitesimals, (...) and Nonstandard Analysis in general, going as far as calling the latter respectively a debasement of meaning and virtual, while accepting as meaningful other infinite totalities and the associated mathematical framework. We shall study the critique of Nonstandard Analysis by Bishop and Connes, and observe that these authors equate ‘meaning’ and ‘computational content’, though their interpretations of said content vary. As we will see, Bishop and Connes claim that the presence of ideal objects in Nonstandard Analysis yields the absence of meaning. We will debunk the Bishop–Connes critique by establishing the contrary, namely that the presence of ideal objects in Nonstandard Analysis yields the ubiquitous presence of computational content. In particular, infinitesimals provide an elegant shorthand for expressing computational content. To this end, we introduce a direct translation between a large class of theorems of Nonstandard Analysis and theorems rich in computational content, similar to the ‘reversals’ from the foundational program Reverse Mathematics. The latter also plays an important role in gauging the scope of this translation. (shrink)

This paper is essentially the author's Gödel Lecture at the ASL Logic Colloquium '09 in Sofia extended and supplemented by material from some other papers. After a brief description of traditional reverse mathematics, a computational approach to is presented. There are then discussions of some interactions between reverse mathematics and the major branches of mathematical logic in terms of the techniques they supply as well as theorems for analysis. The emphasis here is on ones that lie outside the usual main (...) systems of reverse mathematics. While retaining the usual base theory and working still within second order arithmetic, theorems are described that range from those far below the usual systems to ones far above. (shrink)

Reverse mathematics is a program in the foundations of mathematics founded by Friedman and developed extensively by Simpson and others. The aim of RM is to find the minimal axioms needed to prove a theorem of ordinary, that is, non-set-theoretic, mathematics. As suggested by the title, this paper deals with the study of the topological notions of dimension and paracompactness, inside Kohlenbach’s higher-order RM. As to splittings, there are some examples in RM of theorems A, B, C such that A (...) ↔, that is, A can be split into two independent parts B and C, and the aforementioned topological notions give rise to a number of splittings involving highly natural A, B, C. Nonetheless, the higher-order picture is markedly different from the second-one: in terms of comprehension axioms, the proof in higher-order RM of, for example, the paracompactness of the unit interval requires full second-order arithmetic, while the second-order/countable version of paracompactness of the unit interval is provable in the base theory RCA 0. We obtain similarly “exceptional” results for the Urysohn identity, the Lindelöf lemma, and partitions of unity. We show that our results exhibit a certain robustness, in that they do not depend on the exact definition of cover, even in the absence of the axiom of choice. (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 will overview the results in an informal approach to constructive reverse mathematics, that is reverse mathematics in Bishop’s constructive mathematics, especially focusing on compactness properties and continuous properties.

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.

The relationship of Grundy and chromatic numbers of graphs in the context of Reverse Mathematics is investi-gated.

Suppose that we develop a medically safe and affordable means of enhancing human intelligence. For concreteness, we shall assume that the technology is genetic engineering (either somatic or germ line), although the argument we will present does not depend on the technological implementation. For simplicity, we shall speak of enhancing “intelligence” or “cognitive capacity,” but we do not presuppose that intelligence is best conceived of as a unitary attribute. Our considerations could be applied to specific cognitive abilities such as verbal (...) fluency, memory, abstract reasoning, social intelligence, spatial cognition, numerical ability, or musical talent. It will emerge that the form of argument that we use can be applied much more generally to help assess other kinds of enhancement technologies as well as other kinds of reform. However, to give a detailed illustration of how the argument form works, we will focus on the prospect of cognitive enhancement. (shrink)

We will overview the results in an informal approach to constructive reverse mathematics, that is reverse mathematics in Bishop’s constructive mathematics, especially focusing on compactness properties and continuous properties.

The paper offers the concept of reversing the medical humanities. In agreement with the call from Kristeva et al. to recognise the bidirectionality of the medical humanities, I propose moving beyond debates of attitude and aptitude in the application and engagement (either friendly or critical) of humanities to/in medicine, by considering a reversal of the directions of epistemic movement (a reversal of the flow of knowledge). I situate my proposal within existing articulations of the field found in the (...) medical humanities meta-literature, pointing to a gap in the current terrain. I then develop the proposal by unfolding three reasons why we might gain something from exploring a reversed knowledge flow. First, a reversed knowledge flow seems to be an inherent—but still to be articulated—possibility in medical humanities and thus provides an opportunity for more knowledge. Second, the current unidirectionality of the field is founded on an inconsistency in the depiction of the connection between medicine and humanities, which risks creating the very divide that medical humanities set out to bridge. Practising a reversal may help avoid this divide. And third, a reversal might help rebalance the internal epistemic power, so as to motivate less external scepticism and in turn displace more external epistemic power towards medical humanities. I end the paper with a remark on precursors for a reversal, and ideas for where to go from here. (shrink)

The larger project broached here is to look at the generally sentence “if X is well-ordered then f is well-ordered”, where f is a standard proof-theoretic function from ordinals to ordinals. It has turned out that a statement of this form is often equivalent to the existence of countable coded ω-models for a particular theory Tf whose consistency can be proved by means of a cut elimination theorem in infinitary logic which crucially involves the function f. To illustrate this theme, (...) we prove in this paper that the statement “if X is well-ordered then εX is well-ordered” is equivalent to . This was first proved by Marcone and Montalban [Alberto Marcone, Antonio Montalbán, The epsilon function for computability theorists, draft, 2007] using recursion-theoretic and combinatorial methods. The proof given here is principally proof-theoretic, the main techniques being Schütte’s method of proof search [Kurt Schütte, Proof Theory, Springer-Verlag, Berlin, Heidelberg, 1977] and cut elimination for a fragment of. (shrink)

Total utilitarianism implies Parfit's repugnant conclusion. For any world containing ten billion very happy people, there is a better world where a vast number of people have lives barely worth living. One common response is to claim that life in Parfit's Z is better than he suggests, and thus that his conclusion is not repugnant. This paper shows that this strategy cannot succeeed. Total utilitarianism also implies a reverse repugnant conclusion. For any world where ten billion people have lives of (...) excruciating agony, there is a worse world where a vast number of people have lives almost worth living. This reverse repugnant conclusion is at least as repugnant as Parfit's original. If we avoid the latter by raising the zero level, then the former becomes more repugnant. We cannot save total utilitarianism by tinkering with the zero level. (shrink)

To answer foundational questions in physics, physicists turn more and more to abstract advanced mathematics, even though its physical significance may not be immediately clear. What if we started to borrow ideas and approaches, with appropriate modifications, from the foundations of mathematics? In this paper we explore this route. In reverse mathematics one starts from theorems and finds the minimum set of axioms required for their derivation. In reverse physics we want to start from laws or more specific results, and (...) find the physical concepts and starting points that recover them. We want to understand what physical results are implied by which physical assumptions. As an example of the technique, we will see six different characterizations of classical mechanics, show that the uncertainty principle depends only on the entropy bound on pure states and recast the third law of thermodynamics in terms of the entropy of an empty system. We believe the approach can provide greater insights into both current and new physical theories, put the physical concepts at the forefront of the discussion and provide a more unified view of physics by highlighting common patterns and ideas across different physical theories. (shrink)

The paper will show how one may rationalize one-boxing in Newcomb's problem and drinking the toxin in the Toxin puzzle within the confines of causal decision theory by ascending to so-called reflexive decision models which reflect how actions are caused by decision situations (beliefs, desires, and intentions) represented by ordinary unreflexive decision models.

Bostrom and Ord’s reversal test has been appealed to by many philosophers to substantiate the charge that preferences for status quo options are motivated by status quo bias. I argue that their characterization of the reversal test needs to be modified, and that their description of the burden of proof it imposes needs to be clarified. I then argue that there is a way to meet that burden of proof which Bostrom and Ord fail to recognize. I also (...) argue that the range of circumstances in which the reversal test can be usefully applied is narrower than they recognize. (shrink)

In this paper, we investigate the logical strength of completeness theorems for intuitionistic logic along the program of reverse mathematics. Among others we show that is equivalent over to the strong completeness theorem for intuitionistic logic: any countable theory of intuitionistic predicate logic can be characterized by a single Kripke model.

The idea of ‘reversion’ or ‘atavism’ has a peculiar history. For many authors in the latenineteenth and early-twentieth centuries – including Darwin, Galton, Pearson, Weismann, and Spencer, among others – reversion was one of the central phenomena which a theory of heredity ought to explain. By only a few decades later, however, Fisher and others could look back upon reversion as a historical curiosity, a non-problem, or even an impediment to clear theorizing. I explore various reasons that reversion might have (...) appeared to be a central problem for this first group of figures, focusing on their commitment to a variety of conceptual features of evolutionary theory; discuss why reversion might have then ceased to be an interesting phenomenon; and, finally, close with some more general thoughts about the death of scientific problems. (shrink)