Results for 'P. D. Welch'

(not author) ( search as author name )
1000+ found
Order:
  1.  84
    Global Reflection Principles.P. D. Welch - 2017 - In I. Niiniluoto, H. Leitgeb, P. Seppälä & E. Sober (eds.), Logic, Methodology and Philosophy of Science - Proceedings of the 15th International Congress, 2015. College Publications.
    Reflection Principles are commonly thought to produce only strong axioms of infinity consistent with V = L. It would be desirable to have some notion of strong reflection to remedy this, and we have proposed Global Reflection Principles based on a somewhat Cantorian view of the universe. Such principles justify the kind of cardinals needed for, inter alia , Woodin’s Ω-Logic.
    Direct download  
     
    Export citation  
     
    Bookmark   8 citations  
  2.  28
    Weak systems of determinacy and arithmetical quasi-inductive definitions.P. D. Welch - 2011 - Journal of Symbolic Logic 76 (2):418 - 436.
    We locate winning strategies for various ${\mathrm{\Sigma }}_{3}^{0}$ -games in the L-hierarchy in order to prove the following: Theorem 1. KP+Σ₂-Comprehension $\vdash \exists \alpha L_{\alpha}\ models"\Sigma _{2}-{\bf KP}+\Sigma _{3}^{0}-\text{Determinacy}."$ Alternatively: ${\mathrm{\Pi }}_{3}^{1}\text{\hspace{0.17em}}-{\mathrm{C}\mathrm{A}}_{0}\phantom{\rule{0ex}{0ex}}$ "there is a β-model of ${\mathrm{\Delta }}_{3}^{1}-{\mathrm{C}\mathrm{A}}_{0}\text{\hspace{0.17em}}\text{\hspace{0.17em}}+\text{\hspace{0.17 em}}{\mathrm{\Sigma }}_{3}^{0}$ -Determinacy." The implication is not reversible. (The antecedent here may be replaced with ${\mathrm{\Pi }}_{3}^{1}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\left({\mathrm{\Pi }}_{3}^{1}\right)-{\mathrm{C}\mathrm{A}}_{0}:\text{\hspace{0.17em}}{\mathrm{\Pi }}_{3}^{1}$ instances of Comprehension with only ${\mathrm{\Pi }}_{3}^{1}$ -lightface definable parameters—or even weaker theories.) Theorem 2. KP +Δ₂-Comprehension +Σ₂-Replacement + ${\mathrm{\Sigma }}_{3}^{0}\phantom{\rule{0ex}{0ex}}$ -Determinacy. (Here AQI (...)
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark   11 citations  
  3. Games for truth.P. D. Welch - 2009 - Bulletin of Symbolic Logic 15 (4):410-427.
    We represent truth sets for a variety of the well known semantic theories of truth as those sets consisting of all sentences for which a player has a winning strategy in an infinite two person game. The classifications of the games considered here are simple, those over the natural model of arithmetic being all within the arithmetical class of $\Sum_{3}^{0}$.
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark   15 citations  
  4.  67
    On Gupta-Belnap revision theories of truth, Kripkean fixed points, and the next stable set.P. D. Welch - 2001 - Bulletin of Symbolic Logic 7 (3):345-360.
    We consider various concepts associated with the revision theory of truth of Gupta and Belnap. We categorize the notions definable using their theory of circular definitions as those notions universally definable over the next stable set. We give a simplified account of varied revision sequences-as a generalised algorithmic theory of truth. This enables something of a unification with the Kripkean theory of truth using supervaluation schemes.
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark   18 citations  
  5.  61
    On revision operators.P. D. Welch - 2003 - Journal of Symbolic Logic 68 (2):689-711.
    We look at various notions of a class of definability operations that generalise inductive operations, and are characterised as “revision operations”. More particularly we: (i) characterise the revision theoretically definable subsets of a countable acceptable structure; (ii) show that the categorical truth set of Belnap and Gupta’s theory of truth over arithmetic using \emph{fully varied revision} sequences yields a complete \Pi13 set of integers; (iii) the set of \emph{stably categorical} sentences using their revision operator ψ is similarly \Pi13 and which (...)
    Direct download (9 more)  
     
    Export citation  
     
    Bookmark   14 citations  
  6.  9
    Characterising Subsets of $\omega_1$ Constructible from a Real.P. D. Welch - 1994 - Journal of Symbolic Logic 59 (4):1420-1432.
    A small large cardinal upper bound in $V$ for proving when certain subsets of $\omega_1$ are precisely those constructible from a real is given. In the core model we find an exact equivalence in terms of the length of the mouse order; we show that $\forall B \subseteq \omega_1 \lbrack B$ is universally Baire $\Leftrightarrow B \in L\lbrack r \rbrack$ for some real $r\rbrack$ is preserved under set-sized forcing extensions if and only if there are arbitrarily large "admissibly measurable" cardinals.
    Direct download  
     
    Export citation  
     
    Bookmark   2 citations  
  7.  35
    Rethinking Revision.P. D. Welch - 2019 - Journal of Philosophical Logic 48 (1):137-154.
    We sketch a broadening of the Gupta-Belnap notion of a circular or revision theoretic definition into that of a more generalized form incorporating ideas of Kleene’s generalized or higher type recursion. This thereby connects the philosophically motivated, and derived, notion of a circular definition with an older form of definition by recursion using functionals, that is functions of functions, as oracles. We note that Gupta and Belnap’s notion of ‘categorical in L’ can be formulated in at least one of these (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  8.  71
    Truth, logical validity and determinateness: A commentary on field’s saving truth from paradox.P. D. Welch - 2011 - Review of Symbolic Logic 4 (3):348-359.
    We consider notions of truth and logical validity defined in various recent constructions of Hartry Field. We try to explicate his notion of determinate truth by clarifying the path-dependent hierarchies of his determinateness operator.
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark   4 citations  
  9. On elementary embeddings from an inner model to the universe.J. Vickers & P. D. Welch - 2001 - Journal of Symbolic Logic 66 (3):1090-1116.
    We consider the following question of Kunen: Does Con(ZFC + ∃M a transitive inner model and a non-trivial elementary embedding j: M $\longrightarrow$ V) imply Con (ZFC + ∃ a measurable cardinal)? We use core model theory to investigate consequences of the existence of such a j: M → V. We prove, amongst other things, the existence of such an embedding implies that the core model K is a model of "there exists a proper class of almost Ramsey cardinals". Conversely, (...)
    Direct download (7 more)  
     
    Export citation  
     
    Bookmark   6 citations  
  10.  27
    On unfoldable cardinals, ω-closed cardinals, and the beginning of the inner model hierarchy.P. D. Welch - 2004 - Archive for Mathematical Logic 43 (4):443-458.
    Let κ be a cardinal, and let H κ be the class of sets of hereditary cardinality less than κ ; let τ (κ) > κ be the height of the smallest transitive admissible set containing every element of {κ}∪H κ . We show that a ZFC-definable notion of long unfoldability, a generalisation of weak compactness, implies in the core model K, that the mouse order restricted to H κ is as long as τ. (It is known that some weak (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   4 citations  
  11.  6
    Games and induction on reals.J. P. Aguilera & P. D. Welch - 2021 - Journal of Symbolic Logic 86 (4):1676-1690.
    It is shown that the determinacy of $G_{\delta \sigma }$ games of length $\omega ^2$ is equivalent to the existence of a transitive model of ${\mathsf {KP}} + {\mathsf {AD}} + \Pi _1\textrm {-MI}_{\mathbb {R}}$ containing $\mathbb {R}$. Here, $\Pi _1\textrm {-MI}_{\mathbb {R}}$ is the axiom asserting that every monotone $\Pi _1$ operator on the real numbers has an inductive fixpoint.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  12.  17
    Determinacy in the difference hierarchy of co-analytic sets.P. D. Welch - 1996 - Annals of Pure and Applied Logic 80 (1):69-108.
  13.  76
    Ultimate truth vis- à- vis stable truth.P. D. Welch - 2008 - Review of Symbolic Logic 1 (1):126-142.
    We show that the set of ultimately true sentences in Hartry Field's Revenge-immune solution model to the semantic paradoxes is recursively isomorphic to the set of stably true sentences obtained in Hans Herzberger's revision sequence starting from the null hypothesis. We further remark that this shows that a substantial subsystem of second-order number theory is needed to establish the semantic values of sentences in Field's relative consistency proof of his theory over the ground model of the standard natural numbers: -CA0 (...)
    Direct download (9 more)  
     
    Export citation  
     
    Bookmark   26 citations  
  14.  50
    Some observations on truth hierarchies.P. D. Welch - 2014 - Review of Symbolic Logic 7 (1):1-30.
    We show how in the hierarchies${F_\alpha }$of Fieldian truth sets, and Herzberger’s${H_\alpha }$revision sequence starting from any hypothesis for${F_0}$ that essentially each${H_\alpha }$ carries within it a history of the whole prior revision process.As applications we provide a precise representation for, and a calculation of the length of, possiblepath independent determinateness hierarchiesof Field’s construction with a binary conditional operator. We demonstrate the existence of generalized liar sentences, that can be considered as diagonalizing past the determinateness hierarchies definable in Field’s recent (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   12 citations  
  15.  87
    The extent of computation in malament–hogarth spacetimes.P. D. Welch - 2008 - British Journal for the Philosophy of Science 59 (4):659-674.
    We analyse the extent of possible computations following Hogarth ([2004]) conducted in Malament–Hogarth (MH) spacetimes, and Etesi and Németi ([2002]) in the special subclass containing rotating Kerr black holes. Hogarth ([1994]) had shown that any arithmetic statement could be resolved in a suitable MH spacetime. Etesi and Németi ([2002]) had shown that some relations on natural numbers that are neither universal nor co-universal, can be decided in Kerr spacetimes, and had asked specifically as to the extent of computational limits there. (...)
    Direct download (10 more)  
     
    Export citation  
     
    Bookmark   10 citations  
  16.  40
    The Complexity of the Dependence Operator.P. D. Welch - 2015 - Journal of Philosophical Logic 44 (3):337-340.
    We show that Leitgeb’s dependence operator of Leitgeb is a \-operator and that this is best possible.
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   5 citations  
  17.  57
    Eventually infinite time Turing machine degrees: Infinite time decidable reals.P. D. Welch - 2000 - Journal of Symbolic Logic 65 (3):1193-1203.
    We characterise explicitly the decidable predicates on integers of Infinite Time Turing machines, in terms of admissibility theory and the constructible hierarchy. We do this by pinning down ζ, the least ordinal not the length of any eventual output of an Infinite Time Turing machine (halting or otherwise); using this the Infinite Time Turing Degrees are considered, and it is shown how the jump operator coincides with the production of mastercodes for the constructible hierarchy; further that the natural ordinals associated (...)
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark   10 citations  
  18.  12
    Some Open Problems in Mutual Stationarity Involving Inner Model Theory: A Commentary.P. D. Welch - 2005 - Notre Dame Journal of Formal Logic 46 (3):375-379.
    We discuss some of the relationships between the notion of "mutual stationarity" of Foreman and Magidor and measurability in inner models. The general thrust of these is that very general mutual stationarity properties on small cardinals, such as the ℵns, is a large cardinal property. A number of open problems, theorems, and conjectures are stated.
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  19.  76
    Greatly Erdős cardinals with some generalizations to the Chang and Ramsey properties.I. Sharpe & P. D. Welch - 2011 - Annals of Pure and Applied Logic 162 (11):863-902.
    • We define a notion of order of indiscernibility type of a structure by analogy with Mitchell order on measures; we use this to define a hierarchy of strong axioms of infinity defined through normal filters, the α-weakly Erdős hierarchy. The filters in this hierarchy can be seen to be generated by sets of ordinals where these indiscernibility orders on structures dominate the canonical functions.• The limit axiom of this is that of greatly Erdős and we use it to calibrate (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   11 citations  
  20.  14
    Generalisations of stationarity, closed and unboundedness, and of Jensen's □.H. Brickhill & P. D. Welch - 2023 - Annals of Pure and Applied Logic 174 (7):103272.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  21.  8
    Review: William J. Mitchell, John R. Steel, Fine Structure and Iteration Trees. [REVIEW]P. D. Welch - 1997 - Journal of Symbolic Logic 62 (4):1491-1493.
  22. Pf= NPf almost everywhere.J. D. Hamkins & P. D. Welch - 2003 - Mathematical Logic Quarterly 49 (5):536-540.
    No categories
     
    Export citation  
     
    Bookmark  
  23.  41
    Countable unions of simple sets in the core model.P. D. Welch - 1996 - Journal of Symbolic Logic 61 (1):293-312.
    We follow [8] in asking when a set of ordinals $X \subseteq \alpha$ is a countable union of sets in K, the core model. We show that, analogously to L, and X closed under the canonical Σ 1 Skolem function for K α can be so decomposed provided K is such that no ω-closed filters are put on its measure sequence, but not otherwise. This proviso holds if there is no inner model of a weak Erdős-type property.
    Direct download (7 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  24. Eventually Infinite Time Turing Machine Degrees: Infinite Time Decidable Reals.P. D. Welch - 2000 - Journal of Symbolic Logic 65 (3):1193-1203.
    We characterise explicitly the decidable predicates on integers of Infinite Time Turing machines, in terms of admissibility theory and the constructible hierarchy. We do this by pinning down $\zeta$, the least ordinal not the length of any eventual output of an Infinite Time Turing machine ; using this the Infinite Time Turing Degrees are considered, and it is shown how the jump operator coincides with the production of mastercodes for the constructible hierarchy; further that the natural ordinals associated with the (...)
     
    Export citation  
     
    Bookmark   3 citations  
  25. Characterising subsets of ω1 constructible from a real.P. D. Welch - 1994 - Journal of Symbolic Logic 59 (4):1420 - 1432.
    A small large cardinal upper bound in V for proving when certain subsets of ω 1 (including the universally Baire subsets) are precisely those constructible from a real is given. In the core model we find an exact equivalence in terms of the length of the mouse order; we show that $\forall B \subseteq \omega_1 \lbrack B$ is universally Baire $\Leftrightarrow B \in L\lbrack r \rbrack$ for some real r] is preserved under set-sized forcing extensions if and only if there (...)
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  26.  67
    Large Cardinals, Inner Models, and Determinacy: An Introductory Overview.P. D. Welch - 2015 - Notre Dame Journal of Formal Logic 56 (1):213-242.
    The interaction between large cardinals, determinacy of two-person perfect information games, and inner model theory has been a singularly powerful driving force in modern set theory during the last three decades. For the outsider the intellectual excitement is often tempered by the somewhat daunting technicalities, and the seeming length of study needed to understand the flow of ideas. The purpose of this article is to try and give a short, albeit rather rough, guide to the broad lines of development.
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  27.  34
    Some descriptive set theory and core models.P. D. Welch - 1988 - Annals of Pure and Applied Logic 39 (3):273-290.
  28.  39
    Determinacy in strong cardinal models.P. D. Welch - 2011 - Journal of Symbolic Logic 76 (2):719 - 728.
    We give limits defined in terms of abstract pointclasses of the amount of determinacy available in certain canonical inner models involving strong cardinals. We show for example: Theorem A. $\mathrm{D}\mathrm{e}\mathrm{t}\text{\hspace{0.17em}}({\mathrm{\Pi }}_{1}^{1}-\mathrm{I}\mathrm{N}\mathrm{D})$ ⇒ there exists an inner model with a strong cardinal. Theorem B. Det(AQI) ⇒ there exist type-1 mice and hence inner models with proper classes of strong cardinals. where ${\mathrm{\Pi }}_{1}^{1}-\mathrm{I}\mathrm{N}\mathrm{D}\phantom{\rule{0ex}{0ex}}$ (AQI) is the pointclass of boldface ${\mathrm{\Pi }}_{1}^{1}$ -inductive (respectively arithmetically quasi-inductive) sets of reals.
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark  
  29.  15
    William J. Mitchell and John R. Steel. Fine structure and iteration trees. Lecture notes in logic, no. 3. Springer-Verlag, Berlin, Heidelberg, New York, etc., 1994, v + 130 pp. [REVIEW]P. D. Welch - 1997 - Journal of Symbolic Logic 62 (4):1491-1493.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  30.  21
    Ramsey-like cardinals II.Victoria Gitman & P. D. Welch - 2011 - Journal of Symbolic Logic 76 (2):541-560.
  31.  25
    Hypermachines.Sy-David Friedman & P. D. Welch - 2011 - Journal of Symbolic Logic 76 (2):620 - 636.
    The Infinite Time Turing Machine model [8] of Hamkins and Kidder is, in an essential sense, a "Σ₂-machine" in that it uses a Σ₂ Liminf Rule to determine cell values at limit stages of time. We give a generalisation of these machines with an appropriate Σ n rule. Such machines either halt or enter an infinite loop by stage ζ(n) = df μζ(n)[∃Σ(n) > ζ(n) L ζ(n) ≺ Σn L Σ(n) ], again generalising precisely the ITTM case. The collection of (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   4 citations  
  32. On Elementary Embeddings from an Inner Model to the Universe.J. Vickers & P. D. Welch - 2001 - Journal of Symbolic Logic 66 (3):1090-1116.
    We consider the following question of Kunen: Does Con imply Con? We use core model theory to investigate consequences of the existence of such a j : M $\rightarrow$ V. We prove, amongst other things, the existence of such an embedding implies that the core model K is a model of "there exists a proper class of almost Ramsey cardinals". Conversely, if On is Ramsey, then such a j, M are definable. We construe this as a negative answer to the (...)
     
    Export citation  
     
    Bookmark   3 citations  
  33.  42
    On successors of Jónsson cardinals.J. Vickers & P. D. Welch - 2000 - Archive for Mathematical Logic 39 (6):465-473.
    We show that, like singular cardinals, and weakly compact cardinals, Jensen's core model K for measures of order zero [4] calculates correctly the successors of Jónsson cardinals, assuming $O^{Sword}$ does not exist. Namely, if $\kappa$ is a Jónsson cardinal then $\kappa^+ = \kappa^{+K}$ , provided that there is no non-trivial elementary embedding $j:K \longrightarrow K$ . There are a number of related results in ZFC concerning $\cal{P}(\kappa)$ in V and inner models, for $\kappa$ a Jónsson or singular cardinal.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  34.  17
    The “Organization centre”.P. D. Nieuwkoop - 1967 - Acta Biotheoretica 17 (4):178-194.
    Experimental evidence strongly supports the view that the subdivision of organ anlagen into smaller structural units is an autonomous process. Dalcq &Pasteels' hypothesis which says that the boundaries between the different areas into which a morphogenetic field differentiates are determined by “Threshold values” in the “potential” of the field in question, is inconsistent with our present knowledge of biochemical reaction systems. Threshold values may only be used indescribing the spatial differentiation of a morphogenetic field. It is suggested that the latter (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  35.  25
    The “organization centre”.P. D. Nieuwkoop - 1967 - Acta Biotheoretica 17 (4):151-177.
    Experimental evidence strongly supports the view that the subdivision of organ anlagen into smaller structural units is an autonomous process. Dalcq &Pasteels' hypothesis which says that the boundaries between the different areas into which a morphogenetic field differentiates are determined by “Threshold values” in the “potential” of the field in question, is inconsistent with our present knowledge of biochemical reaction systems. Threshold values may only be used indescribing the spatial differentiation of a morphogenetic field. It is suggested that the latter (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  36.  26
    The “organization centre”.P. D. Nieuwkoop - 1962 - Acta Biotheoretica 16 (1):57-68.
    Experimental evidence strongly supports the view that the subdivision of organ anlagen into smaller structural units is an autonomous process. Dalcq &Pasteels' hypothesis which says that the boundaries between the different areas into which a morphogenetic field differentiates are determined by “Threshold values” in the “potential” of the field in question, is inconsistent with our present knowledge of biochemical reaction systems. Threshold values may only be used indescribing the spatial differentiation of a morphogenetic field. It is suggested that the latter (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  37.  32
    On the possibility, or otherwise, of hypercomputation.Philip D. Welch - 2004 - British Journal for the Philosophy of Science 55 (4):739-746.
    We claim that a recent article of P. Cotogno ([2003]) in this journal is based on an incorrect argument concerning the non-computability of diagonal functions. The point is that whilst diagonal functions are not computable by any function of the class over which they diagonalise, there is no ?logical incomputability? in their being computed over a wider class. Hence this ?logical incomputability? regrettably cannot be used in his argument that no hypercomputation can compute the Halting problem. This seems to lead (...)
    Direct download (9 more)  
     
    Export citation  
     
    Bookmark   6 citations  
  38.  14
    Closed and unbounded classes and the härtig quantifier model.Philip D. Welch - 2022 - Journal of Symbolic Logic 87 (2):564-584.
    We show that assuming modest large cardinals, there is a definable class of ordinals, closed and unbounded beneath every uncountable cardinal, so that for any closed and unbounded subclasses $P, Q, {\langle L[P],\in,P \rangle }$ and ${\langle L[Q],\in,Q \rangle }$ possess the same reals, satisfy the Generalised Continuum Hypothesis, and moreover are elementarily equivalent. Examples of such P are Card, the class of uncountable cardinals, I the uniform indiscernibles, or for any n the class $C^{n}{=_{{\operatorname {df}}}}\{ \lambda \, | \, (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  39.  26
    S. Barry Cooper and Andrew Hodges , The Once and Future Turing: Computing the World. Cambridge University Press, 2016. xviii + 379 pp.— therein: - Martin Davis. Algorithms, Equations, and Logic. pp. 4–19. - J.M.E. Hyland. The Forgotten Turing. pp. 20–33. - Andrew R. Booker. Turing and the Primes. pp. 34–52. - Ueli Maurer. Cryptography and Computation after Turing. pp. 53–77. - Kanti V. Mardia and S. Barry Cooper. Alan Turing and Enigmatic Statistics. pp. 78–89. - Stephen Wolfram. What Alan Turing Might Have Discovered. pp. 92–105. - Christof Teuscher. Designed versus Intrinsic Computation. pp. 106–116. - Solomon Feferman. Turing’s ‘Oracle’: From Absolute to Relative Computability and Back. pp. 300–334. - P.D. Welch. Turing Transcendent: Beyond the Event Horizon. pp. 335–360. - Roger Penrose. On Attempting to Model the Mathematical Mind. pp. 361–378. [REVIEW]Alasdair Urquhart - 2016 - Bulletin of Symbolic Logic 22 (3):354-356.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  40.  12
    Review: A. Beller, R. Jensen, P. Welch, Coding the Universe. [REVIEW]Sy D. Friedman - 1985 - Journal of Symbolic Logic 50 (4):1081-1081.
  41.  24
    Beller A., Jensen R., and Welch P.. Coding the universe. London Mathematical Society lecture note series, no. 47. Cambridge University Press, Cambridge etc. 1982, 353 pp. [REVIEW]Sy D. Friedman - 1985 - Journal of Symbolic Logic 50 (4):1081-1081.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  42. Taxonomy, ontology, and natural kinds.P. D. Magnus - 2018 - Synthese 195 (4):1427-1439.
    When we ask what natural kinds are, there are two different things we might have in mind. The first, which I’ll call the taxonomy question, is what distinguishes a category which is a natural kind from an arbitrary class. The second, which I’ll call the ontology question, is what manner of stuff there is that realizes the category. Many philosophers have systematically conflated the two questions. The confusion is exhibited both by essentialists and by philosophers who pose their accounts in (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   9 citations  
  43. Distributed Cognition and the Task of Science.P. D. Magnus - 2007 - Social Studies of Science 37 (2):297--310.
    This paper gives a characterization of distributed cognition (d-cog) and explores ways that the framework might be applied in studies of science. I argue that a system can only be given a d-cog description if it is thought of as performing a task. Turning our attention to science, we can try to give a global d-cog account of science or local d-cog accounts of particular scientific projects. Several accounts of science can be seen as global d-cog accounts: Robert Merton's sociology (...)
    Direct download  
     
    Export citation  
     
    Bookmark   11 citations  
  44. forall x (UBC Edition).P. D. Magnus & Jonathan Jenkins Ichikawa - 2020 - Creative Commons: Attribution-ShareAlike 3.0.
    This is an open-access introductory logic textbook, prepared by Jonathan Ichikawa, based on P.D. Magnus's forallx. This (v2.0, July 2020) is intended as a stable, ready-for-teaching edition.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  45. Drakes, seadevils, and similarity fetishism.P. D. Magnus - 2011 - Biology and Philosophy 26 (6):857-870.
    Homeostatic property clusters (HPCs) are offered as a way of understanding natural kinds, especially biological species. I review the HPC approach and then discuss an objection by Ereshefsky and Matthen, to the effect that an HPC qua cluster seems ill-fitted as a description of a polymorphic species. The standard response by champions of the HPC approach is to say that all members of a polymorphic species have things in common, namely dispositions or conditional properties. I argue that this response fails. (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   21 citations  
  46. Historical Individuals Like Anas platyrhynchos and 'Classical Gas'.P. D. Magnus - 2013 - In Christy Mag Uidhir (ed.), Art and Abstract Objects. Oxford University Press. pp. 108.
    In this paper, I explore and defend the idea that musical works are historical individuals. Guy Rohrbaugh (2003) proposes this for works of art in general. Julian Dodd (2007) objects that the whole idea is outré metaphysics, that it is too far beyond the pale to be taken seriously. Their disagreement could be seen as a skirmish in the broader war between revisionists and reactionaries, a conflict about which of metaphysics and art should trump the other when there is a (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   5 citations  
  47. Reid's defense of common sense.P. D. Magnus - 2008 - Philosophers' Imprint 8:1-14.
    Thomas Reid is often misread as defending common sense, if at all, only by relying on illicit premises about God or our natural faculties. On these theological or reliabilist misreadings, Reid makes common sense assertions where he cannot give arguments. This paper attempts to untangle Reid's defense of common sense by distinguishing four arguments: (a) the argument from madness, (b) the argument from natural faculties, (c) the argument from impotence, and (d) the argument from practical commitment. Of these, (a) and (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   4 citations  
  48. Proceedings of the British Academy, Volume 161, Biographical Memoirs of Fellows, VIII.P. D. A. Garnsey - 2009
    No categories
     
    Export citation  
     
    Bookmark  
  49. William James on Risk, Efficacy, and Evidentialism.P. D. Magnus - 2022 - Episteme 19 (1):146-158.
    William James’ argument against William Clifford in The Will to Believe is often understood in terms of doxastic efficacy, the power of belief to influence an outcome. Although that is one strand of James’ argument, there is another which is driven by ampliative risk. The second strand of James’ argument, when applied to scientific cases, is tantamount to what is now called the Argument from Inductive Risk. Either strand of James’ argument is sufficient to rebut Clifford's strong evidentialism and show (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  50.  3
    Ideas of the Good in Buddhist Philosophy.P. D. Premasiri - 2017 - In Eliot Deutsch & Ron Bontekoe (eds.), A Companion to World Philosophies. Oxford, UK: Blackwell. pp. 347–359.
    One of the problems usually encountered in comparative studies on systems of thought belonging to cultures far removed in space and time is the difference in the manner in which they conceptualize their experience. This difference in conceptualization is reflected in the difference in the words and other linguistic forms adopted in articulating their experience. Studying the thought of a specific social group involves studying the concepts special and peculiar to that group through the language that mirrors their mode of (...)
    No categories
    Direct download  
     
    Export citation  
     
    Bookmark  
1 — 50 / 1000