There is a theorem that shows that it is impossible for an algorithm to jointly satisfy the statistical fairness criteria of Calibration and Equalized Odds non-trivially. But what about the recently advocated alternative to Calibration, Base Rate Tracking? Here we show that Base Rate Tracking is strictly weaker than Calibration, and then take up the question of whether it is possible to jointly satisfy Base Rate Tracking and Equalized Odds in non-trivial scenarios. We show that it is not, thereby establishing (...) an even more general impossibility theorem. (shrink)

Some authors have claimed that ante rem structuralism has problems with structures that have indiscernible places. In response, I argue that there is no requirement that mathematical objects be individuated in a non-trivial way. Metaphysical principles and intuitions to the contrary do not stand up to ordinary mathematical practice, which presupposes an identity relation that, in a sense, cannot be defined. In complex analysis, the two square roots of –1 are indiscernible: anything true of one of them is true of (...) the other. I suggest that ‘i’ functions like a parameter in natural deduction systems. I gave an early version of this paper at a workshop on structuralism in mathematics and science, held in the Autumn of 2006, at Bristol University. Thanks to the organizers, particularly Hannes Leitgeb, James Ladyman, and Øystein Linnebo, to my commentator Richard Pettigrew, and to the audience there. The paper also benefited considerably from a preliminary session at the Arché Research Centre at the University of St Andrews. I am indebted to my colleagues Craige Roberts, for help with the linguistics literature, and Ben Caplan and Gabriel Uzquiano, for help with the metaphysics. Thanks also to Hannes Leitgeb and Jeffrey Ketland for reading an earlier version of the manuscript and making helpful suggestions. I also benefited from conversations with Richard Heck, John Mayberry, Kevin Scharp, and Jason Stanley. CiteULike Connotea Del.icio.us What's this? (shrink)

This chapter provides broad coverage of the notion of logical consequence, exploring its modal, semantic, and epistemic aspects. It develops the contrast between proof-theoretic notion of consequence, in terms of deduction, and a model-theoretic approach, in terms of truth-conditions. The main purpose is to relate the formal, technical work in logic to the philosophical concepts that underlie reasoning.

The subject of this paper is the philosophical problem of accounting for the relationship between mathematics and non-mathematical reality. The first section, devoted to the importance of the problem, suggests that many of the reasons for engaging in philosophy at all make an account of the relationship between mathematics and reality a priority, not only in philosophy of mathematics and philosophy of science, but also in general epistemology/metaphysics. This is followed by a (rather brief) survey of the major, traditional philosophies (...) of mathematics indicating how each is prepared to deal with the present problem. It is shown that (the standard formulations of) some views seem to deny outright that there is a relationship between mathematics and any non-mathematical reality; such philosophies are clearly unacceptable. Other views leave the relationship rather mysterious and, thus, are incomplete at best. The final, more speculative section provides the direction of a positive account. A structuralist philosophy of mathematics is outlined and it is proposed that mathematics applies to reality though the discovery of mathematical structures underlying the non-mathematical universe. (shrink)

The question of how the probabilistic opinions of different individuals should be aggregated to form a group opinion is controversial. But one assumption seems to be pretty much common ground: for a group of Bayesians, the representation of group opinion should itself be a unique probability distribution, 410–414, [45]; Bordley Management Science, 28, 1137–1148, [5]; Genest et al. The Annals of Statistics, 487–501, [21]; Genest and Zidek Statistical Science, 114–135, [23]; Mongin Journal of Economic Theory, 66, 313–351, [46]; Clemen and (...) Winkler Risk Analysis, 19, 187–203, [7]; Dietrich and List [14]; Herzberg Theory and Decision, 1–19, [28]). We argue that this assumption is not always in order. We show how to extend the canonical mathematical framework for pooling to cover pooling with imprecise probabilities by employing set-valued pooling functions and generalizing common pooling axioms accordingly. As a proof of concept, we then show that one IP construction satisfies a number of central pooling axioms that are not jointly satisfied by any of the standard pooling recipes on pain of triviality. Following Levi, 3–11, [39]), we also argue that IP models admit of a much better philosophical motivation as a model of rational consensus. (shrink)

There is a parallel between the debate between Gottlob Frege and David Hilbert at the turn of the twentieth century and at least some aspects of the current controversy over whether category theory provides the proper framework for structuralism in the philosophy of mathematics. The main issue, I think, concerns the place and interpretation of meta-mathematics in an algebraic or structuralist approach to mathematics. Can meta-mathematics itself be understood in algebraic or structural terms? Or is it an exception to the (...) slogan that mathematics is the science of structure? (shrink)

A growing body of empirical evidence suggests that positive emotions, engagement, relationships, meaning, and accomplishments may be a robust framework for the measurement, management and development of wellbeing. While the original PERMA framework made great headway in the past decade, its empirical and theoretical limitations were recently identified and critiqued. In response, Seligman clarified the value of PERMA as a framework for and not a theory of wellbeing and called for further research to expand the construct. To expand the framework (...) into organizational contexts, recent meta-analyses and systematic literature reviews showed that physical health, mindset, physical work environments and economic security could be seen as essential contextually relevant building blocks for work-related wellbeing and are therefore prime candidates to expand the PERMA framework for use within organizational contexts. Through expanding the original PERMA framework with these four factors, a new holistic approach to work-related wellbeing and work performance was born: the PERMA+4. As such, the purpose of this brief perspective paper is to provide a conceptual overview of PERMA+4 as holistic framework for work-related wellbeing and work performance which extends beyond the predominant componential thinking of the discipline. Specifically, we aim to do so by providing: a brief historical overview of the development of PERMA as a theory for wellbeing, a conceptual overview of PERMA+4 as a holistic framework for work-related wellbeing and work performance, empirical evidence supporting the usefulness of PERMA+4, and charting a course for the second wave of positive organizational psychological research. (shrink)

Is the pool of fair predictive algorithms fair? It depends, naturally, on both the criteria of fairness and on how we pool. We catalog the relevant facts for some of the most prominent statistical criteria of algorithmic fairness and the dominant approaches to pooling forecasts: linear, geometric, and multiplicative. Only linear pooling, a format at the heart of ensemble methods, preserves any of the central criteria we consider. Drawing on work in the social sciences and social epistemology on the theoretical (...) foundations of the wisdom of crowds, we explain how our observations present an exception to the general trend of finding tradeoffs between the accuracy and fairness of forecasts. (shrink)

The neo-logicist argues tliat standard mathematics can be derived by purely logical means from abstraction principles—such as Hume's Principle— which are held to lie 'epistcmically innocent'. We show that the second-order axiom of comprehension applied to non-instantiated properties and the standard first-order existential instantiation and universal elimination principles are essential for the derivation of key results, specifically a theorem of infinity, but have not been shown to be epistemically innocent. We conclude that the epistemic innocence of mathematics has not been (...) established by the neo-logicist. (shrink)

Graham Priest's In Contradiction (Dordrecht: Martinus Nijhoff Publishers, 1987, chapter 3) contains an argument concerning the intuitive, or ‘naïve’ notion of (arithmetic) proof, or provability. He argues that the intuitively provable arithmetic sentences constitute a recursively enumerable set, which has a Gödel sentence which is itself intuitively provable. The incompleteness theorem does not apply, since the set of provable arithmetic sentences is not consistent. The purpose of this article is to sharpen Priest's argument, avoiding reference to informal notions, consensus, or (...) Church's thesis. We add Priest's dialetheic semantics to ordinary Peano arithmetic PA, to produce a recursively axiomatized formal system PA★ that contains its own truth predicate. Whether one is a dialetheist or not, PA★ is a legitimate, rigorously defined formal system, and one can explore its proof‐theoretic properties. The system is inconsistent (but presumably non‐trivial), and it proves its own Gödel sentence as well as its own soundness. Although this much is perhaps welcome to the dialetheist, it has some untoward consequences. There are purely arithmetic (indeed, Π0) sentences that are both provable and refutable in PA★. So if the dialetheist maintains that PA★ is sound, then he must hold that there are true contradictions in the most elementary language of arithmetic. Moreover, the thorough dialetheist must hold that there is a number g which both is and is not the code of a derivation of the indicated Gödel sentence of PA★. For the thorough dialetheist, it follows ordinary PA and even Robinson arithmetic are themselves inconsistent theories. I argue that this is a bitter pill for the dialetheist to swallow. (shrink)

The purpose of this paper is to assess the prospects for a neo‐logicist development of set theory based on a restriction of Frege's Basic Law V, which we call (RV): ∀P∀Q[Ext(P) = Ext(Q) ≡ [(BAD(P) & BAD(Q)) ∨ ∀x(Px ≡ Qx)]] BAD is taken as a primitive property of properties. We explore the features it must have for (RV) to sanction the various strong axioms of Zermelo–Fraenkel set theory. The primary interpretation is where ‘BAD’ is Dummett's ‘indefinitely extensible’.1 Background: what (...) and why?2 Framework3 GOOD candidates, indefinite extensibility4 The framework of (RV) alone, or almost alone5 The axioms6 Brief closing. (shrink)

Recent impossibility theorems for fair risk assessment extend to the domain of epistemic justice. We translate the relevant model, demonstrating that the problems of fair risk assessment and just credibility assessment are structurally the same. We motivate the fairness criteria involved in the theorems as also being appropriate in the setting of testimonial justice. Any account of testimonial justice that implies the fairness/justice criteria must be abandoned, on pain of triviality.

§1. Overview. Philosophers and mathematicians have drawn lots of conclusions from Gödel's incompleteness theorems, and related results from mathematical logic. Languages, minds, and machines figure prominently in the discussion. Gödel's theorems surely tell us something about these important matters. But what?A descriptive title for this paper would be “Gödel, Lucas, Penrose, Turing, Feferman, Dummett, mechanism, optimism, reflection, and indefinite extensibility”. Adding “God and the Devil” would probably be redundant. Despite the breath-taking, whirlwind tour, I have the modest aim of forging (...) connections between different parts of this literature and clearing up some confusions, together with the less modest aim of not introducing any more confusions.I propose to focus on three spheres within the literature on incompleteness. The first, and primary, one concerns arguments that Gödel's theorem refutes the mechanistic thesis that the human mind is, or can be accurately modeled as, a digital computer or a Turing machine. The most famous instance is the much reprinted J. R. Lucas [18]. To summarize, suppose that a mechanist provides plans for a machine,M, and claims that the output ofMconsists of all and only the arithmetic truths that a human, or the totality of human mathematicians, will ever or can ever know. We assume that the output ofMis consistent. (shrink)

In the face of an impossibility result, some assumption must be relaxed. The Mere Addition Paradox is an impossibility result in population ethics. Here, I explore substantially weakening the decision-theoretic assumptions involved. The central finding is that the Mere Addition Paradox persists even in the general framework of choice functions when we assume Path Independence as a minimal decision-theoretic constraint. Choice functions can be thought of either as generalizing the standard axiological assumption of a binary “betterness” relation, or as providing (...) a general framework for a normative (rather than axiological) theory of population ethics. Path Independence, a weaker assumption than typically (implicitly) made in population ethics, expresses the idea that, in making a choice from a set of alternatives, the order in which options are assessed or considered is ethically arbitrary and should not affect the final choice. Since the result establishes a conflict between the relevant ethical principles and even very weak decision-theoretic principles, we have more reason to doubt the ethical principles. (shrink)

The evolution of life on Earth has produced an organism that is beginning to model and understand its own evolution and the possible future evolution of life in the universe. These models and associated evidence show that evolution on Earth has a trajectory. The scale over which living processes are organized cooperatively has increased progressively, as has its evolvability. Recent theoretical advances raise the possibility that this trajectory is itself part of a wider developmental process. According to these theories, the (...) developmental process has been shaped by a yet larger evolutionary dynamic that involves the reproduction of universes. This evolutionary dynamic has tuned the key parameters of the universe to increase the likelihood that life will emerge and produce outcomes that are successful in the larger process (e.g. a key outcome may be to produce life and intelligence that intentionally reproduces the universe and tunes the parameters of ‘offspring’ universes). Theory suggests that when life emerges on a planet, it moves along this trajectory of its own accord. However, at a particular point evolution will continue to advance only if organisms emerge that decide to advance the developmental process intentionally. The organisms must be prepared to make this commitment even though the ultimate nature and destination of the process is uncertain, and may forever remain unknown. Organisms that complete this transition to intentional evolution will drive the further development of life and intelligence in the universe. Humanity’s increasing understanding of the evolution of life in the universe is rapidly bringing it to the threshold of this major evolutionary transition. (shrink)

The articles in this volume represent a part of the philosophical literature on higher-order logic and the Skolem paradox. They ask the question what is second-order logic? and examine various interpretations of the Lowenheim-Skolem theorem.

This article presents narratives from 13 Indigenous early career academics (ECAs) at one university in Auckland, New Zealand. These experiences are likely to represent those of Indigenous Māori and Pasifika ECAs nationally, given the small, centralised nature of the national academy of Aotearoa New Zealand. The narratives contain testimony, fictionalised vignettes of experience, and poetic expressions. Meeting the demands of an academic role in one’s first years of working at a university is a big deal for anyone; the extra pressures (...) and challenges for Indigenous Māori and Pacific staff are immense, yet little understood by White ‘others.’ A writing workshop was the initial catalyst of this collective writing project. Through these insider narratives, this article presents a collective description of, and response to, the experience of Māori and Pasifika early career academics. (shrink)

Dmitri Mendeleev’s detailed prediction in 1871 of the properties of three as yet unknown elements earned him enormous prestige. Eleven other predictions, thrown off without elaboration, were less uniformly successful, thanks mainly his unbending adherence to the structure of his table and his failure to account for the lanthanides. At the end of his life he returned to his table without making the required changes, and added a theoretical discussion of elements lighter than hydrogen. The overall balance of success and (...) failure is nevertheless in his favour. There may now be a similar failure to understand the ultra-heavy elements because of adherence to the pattern of chemical groups. (shrink)

Around the turn of the century, Poincare and Hilbert each published an account of geometry that took the discipline to be an implicit definition of its concepts. The terms ‘point’, ‘line’, and ‘plane’ can be applied to any system of objects that satisfies the axioms. Each mathematician found spirited opposition from a different logicist—Russell against Poincare' and Frege against Hilbert— who maintained the dying view that geometry essentially concerns space or spatial intuition. The debates illustrate the emerging idea of mathematics (...) as the science of structure. The article closes with some remarks on structuralist and nonstructuralist themes in Frege's own development of arithmetic. (shrink)

cannot understand the language.”[1] This is not intended to cover (easily imaginable) cases of recording one's experiences in a personal code, for such a code, however obscure in fact, could in principle be deciphered. What Wittgenstein had in mind is a language conceived as necessarily comprehensible only to its single originator because the things which define its vocabulary are necessarily inaccessible to others.

In this paper, I develop a noncausal view of agency. I defend the thesis that choices are uncaused mental actions and maintain, contrary to causal theorists of action, that choices differ intrinsically or inherently from nonactions. I explain how they do by placing them in an ontology favored by causal agency theorists (agent-causationists). This ontology is one of powers and liabilities.After explicating how a choice is an uncaused event, I explain how an adequate account of freedom involves the concept of (...) choosing for a reason. Choosing for a reason is a teleological notion, and I set forth what is involved in making a choice for a purpose. (shrink)

is true, there is a truth-maker (e.g., a fact) with which it is identical and the truth of the former consists in its identity with the latter. The theory is best understood as a reaction to the correspondence theory, according to which the relation of truth-bearer to truth-maker is correspondence. A correspondence theory is vulnerable to the nagging suspicion that if the best we can do is make statements that merely correspond to the truth, then we inevitably fail to capture (...) the reality they are about and thus fall short of the truth we aim at. An identity theory is designed to overcome this suspicion. (shrink)

This paper generalizes rationalizability of a choice function by a single acyclic binary relation to rationalizability by a set of such relations. Rather than selecting those options in a menu that are maximal with respect to a single binary relation, a weakly pseudo-rationalizable choice function selects those options that are maximal with respect to at least one binary relation in a given set. I characterize the class of weakly pseudo-rationalizable choice functions in terms of simple functional properties. This result also (...) generalizes Aizerman and Malishevski's characterization of pseudo-rationalizable choice functions, that is, choice functions rationalizable by a set of total orders. (shrink)

The purpose of this paper is to apply Crispin Wright’s criteria and various axes of objectivity to mathematics. I test the criteria and the objectivity of mathematics against each other. Along the way, various issues concerning general logic and epistemology are encountered.

Sections 3.16 and 3.23 of Roger Penrose's Shadows of the mind (Oxford, Oxford University Press, 1994) contain a subtle and intriguing new argument against mechanism, the thesis that the human mind can be accurately modeled by a Turing machine. The argument, based on the incompleteness theorem, is designed to meet standard objections to the original Lucas-Penrose formulations. The new argument, however, seems to invoke an unrestricted truth predicate (and an unrestricted knowability predicate). If so, its premises are inconsistent. The usual (...) ways of restricting the predicates either invalidate Penrose's reasoning or require presuppositions that the mechanist can reject. (shrink)

The answers to the questions in the title depend on the kind of pluralism one is talking about. We will focus here on our own views. The purpose of this article is to trace out some possible connections between these kinds of pluralism. We show how each of them might bear on the other, depending on how certain open questions are resolved.

Argues against naturalism, or the idea that natural physical processes explain everything, the mind and soul do not exist, and consciousness and causality may have no basis, and suggests that it does not account for human--or any--action.

Saul Kripke once noted that there is a tight connection between computation and de re knowledge of whatever the computation acts upon. For example, the Euclidean algorithm can produce knowledge of which number is the greatest common divisor of two numbers. Arguably, algorithms operate directly on syntactic items, such as strings, and on numbers and the like only via how the numbers are represented. So we broach matters of notation. The purpose of this article is to explore the relationship between (...) the notations acceptable for computation, the usual idealizations involved in theories of computability, flowing from Alan Turing’s monumental work, and de re propositional attitudes toward numbers and other mathematical objects. (shrink)