About this topic
Summary A sentence C is independent of a theory T iff neither C, nor the negation of C is derivable from T. A theory is negation-complete iff no sentence in its language is independent of it. Some of key results in metamathematics are independence theorems. According to arithmetical incompleteness theorem, no consistent (recursively axiomatizable) extension of a relatively weak arithmetic is negation-complete. Another important independence result is the independence of the Conituum Hypothesis of the axioms of standard set theory. (There are numerous other examples in analysis, combinatorics, group theory and set theory.) Independence results seem to have impact on philosophical views on mathematical truth and mathematical knowledge. Are sentences independent of mainstream theories determinately true or false and why? If yes, how can we know, which is it? If no, what philosophical views about mathematics are consistent with this view and how are they motivated?
Key works Gödel 1931, Gödel 1940,  Gödel 1947, .Cohen 1963, Feferman manuscript and Feferman et al 1999. For an in-depth study of arithmetical incompletness, see Franzén 2003.
Introductions A great introduction to arithmetical incompleteness theorems and related issues is Smith 2007. A more advanced book is Lindstrom 2002. Franzén 2005 is invaluable. See also Feferman manuscript and Feferman manuscript. As for set-theoretic indeterminacy, see Koellner 2010 and references therein.
Related

Contents
41 found
Order:
  1. Physical Possibility and Determinate Number Theory.Sharon Berry - manuscript
    It's currently fashionable to take Putnamian model theoretic worries seriously for mathematics, but not for discussions of ordinary physical objects and the sciences. But I will argue that (under certain mild assumptions) merely securing determinate reference to physical possibility suffices to rule out nonstandard models of our talk of numbers. So anyone who accepts realist reference to physical possibility should not reject reference to the standard model of the natural numbers on Putnamian model theoretic grounds.
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  2. The construction of transfinite equivalence algorithms.Han Geurdes - manuscript
    Context: Consistency of mathematical constructions in numerical analysis and the application of computerized proofs in the light of the occurrence of numerical chaos in simple systems. Purpose: To show that a computer in general and a numerical analysis in particular can add its own peculiarities to the subject under study. Hence the need of thorough theoretical studies on chaos in numerical simulation. Hence, a questioning of what e.g. a numerical disproof of a theorem in physics or a prediction in numerical (...)
    Remove from this list   Direct download  
     
    Export citation  
     
    Bookmark  
  3. Ultimate V.Sam Roberts - manuscript
    Potentialism is the view that the universe of sets is inherently potential. It comes in two main flavours: height-potentialism and width-potentialism. It is natural to think that height and width potentialism are just aspects of a broader phenomenon of potentialism, that they might both be true. The main result of this paper is that this is mistaken: height and width potentialism are jointly inconsistent. Indeed, I will argue that height potentialism is independently committed to an ultimate background universe of sets, (...)
    Remove from this list   Direct download  
     
    Export citation  
     
    Bookmark  
  4. Mathematical Modality: An Investigation of Set Theoretic Contingency.Andrew Bacon - forthcoming - Journal of Philosophical Logic.
    An increasing amount of contemporary philosophy of mathematics posits, and theorizes in terms of special kinds of mathematical modality. The goal of this paper is to bring recent work on higher-order metaphysics to bear on the investigation of these modalities. The main focus of the paper will be views that posit mathematical contingency or indeterminacy about statements that concern the `width' of the set theoretic universe, such as Cantor's continuum hypothesis. Within a higher-order framework I show that contingency about the (...)
    Remove from this list   Direct download  
     
    Export citation  
     
    Bookmark  
  5. Weyl and Two Kinds of Potential Domains.Laura Crosilla & Øystein Linnebo - forthcoming - Noûs.
    According to Weyl, “‘inexhaustibility’ is essential to the infinite”. However, he distinguishes two kinds of inexhaustible, or merely potential, domains: those that are “extensionally determinate” and those that are not. This article clarifies Weyl's distinction and explains its enduring logical and philosophical significance. The distinction sheds lights on the contemporary debate about potentialism, which in turn affords a deeper understanding of Weyl.
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  6. Modelling Afthairetic Modality.Giorgio Venturi & Pedro Yago - forthcoming - Journal of Philosophical Logic.
    Despite their controversial ontological status, the discussion on arbitrary objects has been reignited in recent years. According to the supporting views, they present interesting and unique qualities. Among those, two define their nature: their assuming of values, and the way in which they present properties. Leon Horsten has advanced a particular view on arbitrary objects which thoroughly describes the earlier, arguing they assume values according to a sui generis modality, which he calls afthairetic. In this paper, we offer a general (...)
    Remove from this list   Direct download (4 more)  
     
    Export citation  
     
    Bookmark  
  7. Divergent Potentialism: A Modal Analysis With an Application to Choice Sequences.Ethan Brauer, Øystein Linnebo & Stewart Shapiro - 2022 - Philosophia Mathematica 30 (2):143-172.
    Modal logic has been used to analyze potential infinity and potentialism more generally. However, the standard analysis breaks down in cases of divergent possibilities, where there are two or more possibilities that can be individually realized but which are jointly incompatible. This paper has three aims. First, using the intuitionistic theory of choice sequences, we motivate the need for a modal analysis of divergent potentialism and explain the challenges this involves. Then, using Beth–Kripke semantics for intuitionistic logic, we overcome those (...)
    Remove from this list   Direct download (3 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  8. Mathematical Internal Realism.Tim Button - 2022 - In Sanjit Chakraborty & James Ferguson Conant (eds.), Engaging Putnam. Berlin, Germany: De Gruyter. pp. 157-182.
    In “Models and Reality” (1980), Putnam sketched a version of his internal realism as it might arise in the philosophy of mathematics. Here, I will develop that sketch. By combining Putnam’s model-theoretic arguments with Dummett’s reflections on Gödelian incompleteness, we arrive at (what I call) the Skolem-Gödel Antinomy. In brief: our mathematical concepts are perfectly precise; however, these perfectly precise mathematical concepts are manifested and acquired via a formal theory, which is understood in terms of a computable system of proof, (...)
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark   5 citations  
  9. On Number-Set Identity: A Study.Sean C. Ebels-Duggan - 2022 - Philosophia Mathematica 30 (2):223-244.
    Benacerraf’s 1965 multiple-reductions argument depends on what I call ‘deferential logicism’: his necessary condition for number-set identity is most plausible against a background Quineanism that allows autonomy of the natural number concept. Steinhart’s ‘folkist’ sufficient condition on number-set identity, by contrast, puts that autonomy at the center — but fails for not taking the folk perspective seriously enough. Learning from both sides, we explore new conditions on number-set identity, elaborating a suggestion from Wright.
    Remove from this list   Direct download (3 more)  
     
    Export citation  
     
    Bookmark   4 citations  
  10. The Price of Mathematical Scepticism.Paul Blain Levy - 2022 - Philosophia Mathematica 30 (3):283-305.
    This paper argues that, insofar as we doubt the bivalence of the Continuum Hypothesis or the truth of the Axiom of Choice, we should also doubt the consistency of third-order arithmetic, both the classical and intuitionistic versions. -/- Underlying this argument is the following philosophical view. Mathematical belief springs from certain intuitions, each of which can be either accepted or doubted in its entirety, but not half-accepted. Therefore, our beliefs about reality, bivalence, choice and consistency should all be aligned.
    Remove from this list   Direct download (4 more)  
     
    Export citation  
     
    Bookmark  
  11. Generality Explained.Øystein Linnebo - 2022 - Journal of Philosophy 119 (7):349-379.
    What explains the truth of a universal generalization? Two types of explanation can be distinguished. While an ‘instance-based explanation’ proceeds via some or all instances of the generalization, a ‘generic explanation’ is independent of the instances, relying instead on completely general facts about the properties or operations involved in the generalization. This intuitive distinction is analyzed by means of a truthmaker semantics, which also sheds light on the correct logic of quantification. On the most natural version of the semantics, this (...)
    Remove from this list   Direct download (3 more)  
     
    Export citation  
     
    Bookmark   4 citations  
  12. Computational indeterminacy and explanations in cognitive science.Philippos Papayannopoulos, Nir Fresco & Oron Shagrir - 2022 - Biology and Philosophy 37 (6):1-30.
    Computational physical systems may exhibit indeterminacy of computation (IC). Their identified physical dynamics may not suffice to select a unique computational profile. We consider this phenomenon from the point of view of cognitive science and examine how computational profiles of cognitive systems are identified and justified in practice, in the light of IC. To that end, we look at the literature on the underdetermination of theory by evidence and argue that the same devices that can be successfully employed to confirm (...)
    Remove from this list   Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  13. Pluralities as Nothing Over and Above.Sam Roberts - 2022 - Journal of Philosophy 119 (8):405-424.
    This paper develops an account of pluralities based on the following simple claim: some things are nothing over and above the individual things they comprise. For some, this may seem like a mysterious statement, perhaps even meaningless; for others, like a truism, trivial and inferentially inert. I show that neither reaction is correct: the claim is both tractable and has important consequences for a number of debates in philosophy.
    Remove from this list   Direct download (4 more)  
     
    Export citation  
     
    Bookmark   7 citations  
  14. Arithmetic is Determinate.Zachary Goodsell - 2021 - Journal of Philosophical Logic 51 (1):127-150.
    Orthodoxy holds that there is a determinate fact of the matter about every arithmetical claim. Little argument has been supplied in favour of orthodoxy, and work of Field, Warren and Waxman, and others suggests that the presumption in its favour is unjustified. This paper supports orthodoxy by establishing the determinacy of arithmetic in a well-motivated modal plural logic. Recasting this result in higher-order logic reveals that even the nominalist who thinks that there are only finitely many things should think that (...)
    Remove from this list   Direct download (4 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  15. There May Be Many Arithmetical Gödel Sentences.Kaave Lajevardi & Saeed Salehi - 2021 - Philosophia Mathematica 29 (2):278–287.
    We argue that, under the usual assumptions for sufficiently strong arithmetical theories that are subject to Gödel’s First Incompleteness Theorem, one cannot, without impropriety, talk about *the* Gödel sentence of the theory. The reason is that, without violating the requirements of Gödel’s theorem, there could be a true sentence and a false one each of which is provably equivalent to its own unprovability in the theory if the theory is unsound.
    Remove from this list   Direct download (3 more)  
     
    Export citation  
     
    Bookmark   4 citations  
  16. Carnap and Beth on the Limits of Tolerance.Benjamin Marschall - 2021 - Canadian Journal of Philosophy 51 (4):282–300.
    Rudolf Carnap’s principle of tolerance states that there is no need to justify the adoption of a logic by philosophical means. Carnap uses the freedom provided by this principle in his philosophy of mathematics: he wants to capture the idea that mathematical truth is a matter of linguistic rules by relying on a strong metalanguage with infinitary inference rules. In this paper, I give a new interpretation of an argument by E. W. Beth, which shows that the principle of tolerance (...)
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  17. Categoricity by convention.Julien Murzi & Brett Topey - 2021 - Philosophical Studies 178 (10):3391-3420.
    On a widespread naturalist view, the meanings of mathematical terms are determined, and can only be determined, by the way we use mathematical language—in particular, by the basic mathematical principles we’re disposed to accept. But it’s mysterious how this can be so, since, as is well known, minimally strong first-order theories are non-categorical and so are compatible with countless non-isomorphic interpretations. As for second-order theories: though they typically enjoy categoricity results—for instance, Dedekind’s categoricity theorem for second-order PA and Zermelo’s quasi-categoricity (...)
    Remove from this list   Direct download (4 more)  
     
    Export citation  
     
    Bookmark   6 citations  
  18. The Key to Complexity.Ilexa Yardley - 2021 - Https://Medium.Com/the-Circular-Theory/.
    Complexity is dependent on the circular-linear relationship between an individual and a group, meaning we cannot use 'observation' to tell us what we need to know (to explain complexity).
    Remove from this list   Direct download  
     
    Export citation  
     
    Bookmark  
  19. Descriptivism about the Reference of Set-Theoretic Expressions: Revisiting Putnam’s Model-Theoretic Arguments.Zeynep Soysal - 2020 - The Monist 103 (4):442-454.
    Putnam’s model-theoretic arguments for the indeterminacy of reference have been taken to pose a special problem for mathematical languages. In this paper, I argue that if one accepts that there are theory-external constraints on the reference of at least some expressions of ordinary language, then Putnam’s model-theoretic arguments for mathematical languages don’t go through. In particular, I argue for a kind of descriptivism about mathematical expressions according to which their reference is “anchored” in the reference of expressions of ordinary language. (...)
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  20. A Metasemantic Challenge for Mathematical Determinacy.Jared Warren & Daniel Waxman - 2020 - Synthese 197 (2):477-495.
    This paper investigates the determinacy of mathematics. We begin by clarifying how we are understanding the notion of determinacy before turning to the questions of whether and how famous independence results bear on issues of determinacy in mathematics. From there, we pose a metasemantic challenge for those who believe that mathematical language is determinate, motivate two important constraints on attempts to meet our challenge, and then use these constraints to develop an argument against determinacy and discuss a particularly popular approach (...)
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark   12 citations  
  21. Supertasks and Arithmetical Truth.Jared Warren & Daniel Waxman - 2020 - Philosophical Studies 177 (5):1275-1282.
    This paper discusses the relevance of supertask computation for the determinacy of arithmetic. Recent work in the philosophy of physics has made plausible the possibility of supertask computers, capable of running through infinitely many individual computations in a finite time. A natural thought is that, if supertask computers are possible, this implies that arithmetical truth is determinate. In this paper we argue, via a careful analysis of putative arguments from supertask computations to determinacy, that this natural thought is mistaken: supertasks (...)
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  22. Indeterminism in Physics, Classical Chaos and Bohmian Mechanics: Are Real Numbers Really Real?Nicolas Gisin - 2019 - Erkenntnis 86 (6):1469-1481.
    It is usual to identify initial conditions of classical dynamical systems with mathematical real numbers. However, almost all real numbers contain an infinite amount of information. I argue that a finite volume of space can’t contain more than a finite amount of information, hence that the mathematical real numbers are not physically relevant. Moreover, a better terminology for the so-called real numbers is “random numbers”, as their series of bits are truly random. I propose an alternative classical mechanics, which is (...)
    Remove from this list   Direct download (4 more)  
     
    Export citation  
     
    Bookmark   7 citations  
  23. The semantic plights of the ante-rem structuralist.Bahram Assadian - 2018 - Philosophical Studies 175 (12):1-20.
    A version of the permutation argument in the philosophy of mathematics leads to the thesis that mathematical terms, contrary to appearances, are not genuine singular terms referring to individual objects; they are purely schematic or variables. By postulating ‘ante-rem structures’, the ante-rem structuralist aims to defuse the permutation argument and retain the referentiality of mathematical terms. This paper presents two semantic problems for the ante- rem view: (1) ante-rem structures are themselves subject to the permutation argument; (2) the ante-rem structuralist (...)
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark   6 citations  
  24. Philosophy and Model Theory.Tim Button & Sean P. Walsh - 2018 - Oxford, UK: Oxford University Press. Edited by Sean Walsh & Wilfrid Hodges.
    Philosophy and model theory frequently meet one another. Philosophy and Model Theory aims to understand their interactions -/- Model theory is used in every ‘theoretical’ branch of analytic philosophy: in philosophy of mathematics, in philosophy of science, in philosophy of language, in philosophical logic, and in metaphysics. But these wide-ranging appeals to model theory have created a highly fragmented literature. On the one hand, many philosophically significant mathematical results are found only in mathematics textbooks: these are aimed squarely at mathematicians; (...)
    Remove from this list   Direct download (3 more)  
     
    Export citation  
     
    Bookmark   53 citations  
  25. Concrete Mathematical Incompleteness: Basic Emulation Theory.Harvey Friedman - 2018 - In John Burgess (ed.), Hilary Putnam on Logic and Mathematics. Cham: Springer Verlag.
    there are mathematical statements that cannot be proved or refuted using the usual axioms and rules of inference of mathematics.
    Remove from this list  
     
    Export citation  
     
    Bookmark  
  26. Structure and Categoricity: Determinacy of Reference and Truth Value in the Philosophy of Mathematics.Tim Button & Sean Walsh - 2016 - Philosophia Mathematica 24 (3):283-307.
    This article surveys recent literature by Parsons, McGee, Shapiro and others on the significance of categoricity arguments in the philosophy of mathematics. After discussing whether categoricity arguments are sufficient to secure reference to mathematical structures up to isomorphism, we assess what exactly is achieved by recent ‘internal’ renditions of the famous categoricity arguments for arithmetic and set theory.
    Remove from this list   Direct download (7 more)  
     
    Export citation  
     
    Bookmark   11 citations  
  27. Can the Cumulative Hierarchy Be Categorically Characterized?Luca Incurvati - 2016 - Logique Et Analyse 59 (236):367-387.
    Mathematical realists have long invoked the categoricity of axiomatizations of arithmetic and analysis to explain how we manage to fix the intended meaning of their respective vocabulary. Can this strategy be extended to set theory? Although traditional wisdom recommends a negative answer to this question, Vann McGee (1997) has offered a proof that purports to show otherwise. I argue that one of the two key assumptions on which the proof rests deprives McGee's result of the significance he and the realist (...)
    Remove from this list   Direct download  
     
    Export citation  
     
    Bookmark   4 citations  
  28. The Search for New Axioms in the Hyperuniverse Programme.Claudio Ternullo & Sy-David Friedman - 2016 - In Francesca Boccuni & Andrea Sereni (eds.), Objectivity, Realism, and Proof. FilMat Studies in the Philosophy of Mathematics. Cham, Switzerland: Springer International Publishing. pp. 165-188.
    The Hyperuniverse Programme, introduced in Arrigoni and Friedman (2013), fosters the search for new set-theoretic axioms. In this paper, we present the procedure envisaged by the programme to find new axioms and the conceptual framework behind it. The procedure comes in several steps. Intrinsically motivated axioms are those statements which are suggested by the standard concept of set, i.e. the `maximal iterative concept', and the programme identi fies higher-order statements motivated by the maximal iterative concept. The satisfaction of these statements (...)
    Remove from this list   Direct download  
     
    Export citation  
     
    Bookmark   1 citation  
  29. Models and Computability.W. Dean - 2014 - Philosophia Mathematica 22 (2):143-166.
    Computationalism holds that our grasp of notions like ‘computable function’ can be used to account for our putative ability to refer to the standard model of arithmetic. Tennenbaum's Theorem has been repeatedly invoked in service of this claim. I will argue that not only do the relevant class of arguments fail, but that the result itself is most naturally understood as having the opposite of a reference-fixing effect — i.e., rather than securing the determinacy of number-theoretic reference, Tennenbaum's Theorem points (...)
    Remove from this list   Direct download (5 more)  
     
    Export citation  
     
    Bookmark   9 citations  
  30. The Philosophical Significance of Tennenbaum’s Theorem.T. Button & P. Smith - 2012 - Philosophia Mathematica 20 (1):114-121.
    Tennenbaum's Theorem yields an elegant characterisation of the standard model of arithmetic. Several authors have recently claimed that this result has important philosophical consequences: in particular, it offers us a way of responding to model-theoretic worries about how we manage to grasp the standard model. We disagree. If there ever was such a problem about how we come to grasp the standard model, then Tennenbaum's Theorem does not help. We show this by examining a parallel argument, from a simpler model-theoretic (...)
    Remove from this list   Direct download (9 more)  
     
    Export citation  
     
    Bookmark   12 citations  
  31. What is Absolute Undecidability?†.Justin Clarke-Doane - 2012 - Noûs 47 (3):467-481.
    It is often supposed that, unlike typical axioms of mathematics, the Continuum Hypothesis (CH) is indeterminate. This position is normally defended on the ground that the CH is undecidable in a way that typical axioms are not. Call this kind of undecidability “absolute undecidability”. In this paper, I seek to understand what absolute undecidability could be such that one might hope to establish that (a) CH is absolutely undecidable, (b) typical axioms are not absolutely undecidable, and (c) if a mathematical (...)
    Remove from this list   Direct download (3 more)  
     
    Export citation  
     
    Bookmark   14 citations  
  32. The Metamathematics of Putnam’s Model-Theoretic Arguments.Tim Button - 2011 - Erkenntnis 74 (3):321-349.
    Putnam famously attempted to use model theory to draw metaphysical conclusions. His Skolemisation argument sought to show metaphysical realists that their favourite theories have countable models. His permutation argument sought to show that they have permuted models. His constructivisation argument sought to show that any empirical evidence is compatible with the Axiom of Constructibility. Here, I examine the metamathematics of all three model-theoretic arguments, and I argue against Bays (2001, 2007) that Putnam is largely immune to metamathematical challenges.
    Remove from this list   Direct download (7 more)  
     
    Export citation  
     
    Bookmark   6 citations  
  33. Seeing negation as always dependent frees mathematical logic from paradox, incompleteness, and undecidability-- and opens the door to its positive possibilities.Daniel A. Cowan - 2008 - San Mateo, CA: Joseph Publishing Company.
  34. Math anxiety.Aden Evens - 2000 - Angelaki 5 (3):105 – 115.
    This article presents an explication of the references to the history of the calculus in the first few pages of Chapter 4 of Deleuze's _Difference and Repetition_. In those pages, Deleuze uses anachronistic readings of the calculus to explain his theory of ontogenesis, beginning with the differential, dx, that is strictly nothing by itself but that establishes singular points in relation to other differentials. He builds from the differential to power series, showing a corresponding process of determination in the ontogenesis (...)
    Remove from this list   Direct download (3 more)  
     
    Export citation  
     
    Bookmark   8 citations  
  35. Set theory and the continuum problem.Raymond Smullyan - 1996 - Clarendon Press.
    A lucid, elegant, and complete survey of set theory, this three-part treatment explores axiomatic set theory, the consistency of the continuum hypothesis, and forcing and independence results. 1996 edition.
    Remove from this list   Direct download  
     
    Export citation  
     
    Bookmark   9 citations  
  36. On the most open question in the history of mathematics: A discussion of Maddy.Adrian Riskin - 1994 - Philosophia Mathematica 2 (2):109-121.
    In this paper, I argue against Penelope Maddy's set-theoretic realism by arguing (1) that it is perfectly consistent with mathematical Platonism to deny that there is a fact of the matter concerning statements which are independent of the axioms of set theory, and that (2) denying this accords further that many contemporary Platonists assert that there is a fact of the matter because they are closet foundationalists, and that their brand of foundationalism is in radical conflict with actual mathematical practice.
    Remove from this list   Direct download (6 more)  
     
    Export citation  
     
    Bookmark   12 citations  
  37. The Independence of the Continuum Hypothesis II.Paul Cohen - 1964 - Proc. Nat. Acad. Sci. USA 51 (1):105-110.
    Remove from this list   Direct download  
     
    Export citation  
     
    Bookmark   28 citations  
  38. The independence of the continuum hypothesis.Paul Cohen - 1963 - Proc. Nat. Acad. Sci. USA 50 (6):1143-1148.
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark   54 citations  
  39. Les limitations internes des formalismes.Jean Ladrière - 1957 - Louvain,: E. Nauwelaerts.
  40. Is the Continuum Hypothesis a definite mathematical problem?Solomon Feferman - manuscript
    The purpose of this article is to explain why I believe that the Continuum Hypothesis (CH) is not a definite mathematical problem. My reason for that is that the concept of arbitrary set essential to its formulation is vague or underdetermined and there is no way to sharpen it without violating what it is supposed to be about. In addition, there is considerable circumstantial evidence to support the view that CH is not definite.
    Remove from this list   Direct download  
     
    Export citation  
     
    Bookmark   9 citations  
  41. Flawless Disagreement in Mathematics.Justin Clarke-Doane - unknown
    A disagrees with B with respect to a proposition, p, flawlessly just in case A believes p and B believes not-p, or vice versa, though neither A nor B is guilty of a cognitive shortcoming – i.e. roughly, neither A nor B is being irrational, lacking evidence relevant to p, conceptually incompetent, insufficiently imaginative, etc.
    Remove from this list   Direct download  
     
    Export citation  
     
    Bookmark