Switch to: References

Add citations

You must login to add citations.
  1. Scanlon's contractualism and the redundancy objection.Philip Stratton–Lake - 2003 - Analysis 63 (1):70-76.
    Ebbhinghaus, H., J. Flum, and W. Thomas. 1984. Mathematical Logic. New York, NY: Springer-Verlag. Forster, T. Typescript. The significance of Yablo’s paradox without self-reference. Available from http://www.dpmms.cam.ac.uk. Gold, M. 1965. Limiting recursion. Journal of Symbolic Logic 30: 28–47. Karp, C. 1964. Languages with Expressions of Infinite Length. Amsterdam.
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark   13 citations  
  • Philosophy, theology and patristic thought.Michael Craig Rhodes - 2016 - International Journal of Philosophy and Theology 77 (4-5):219-236.
    ABSTRACTThe common way of speaking of patristic thought is as theology. Disuse of the appellation ‘patristic philosophy’ is the result of separationist taxonomies in both philosophy and theology. Returning to the meanings of the terms theologia and philosophia in ancient and late ancient thought, this paper argues, with an eye toward Orthodox thought, for the reasonableness of speaking of patristic thought as philosophy.
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  • Psychoneural reduction: a perspective from neural circuits.David Parker - 2019 - Biology and Philosophy 34 (4):44.
    Psychoneural reduction has been debated extensively in the philosophy of neuroscience. In this article I will evaluate metascientific approaches that claim direct molecular and cellular explanations of cognitive functions. I will initially consider the issues involved in linking cellular properties to behaviour from the general perspective of neural circuits. These circuits that integrate the molecular and cellular components underlying cognition and behaviour, making consideration of circuit properties relevant to reductionist debates. I will then apply this general perspective to specific systems (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  • The Spaces of Knowledge: Bertrand Russell, Logical Construction, and the Classification of the Sciences.Omar W. Nasim - 2012 - British Journal for the History of Philosophy 20 (6):1163-1182.
    What Russell regarded to be the ‘chief outcome’ of his 1914 Lowell Lectures at Harvard can only be fully appreciated, I argue, if one embeds the outcome back into the ‘classificatory problem’ that many at the time were heavily engaged in. The problem focused on the place and relationships between the newly formed or recently professionalized disciplines such as psychology, Erkenntnistheorie, physics, logic and philosophy. The prime metaphor used in discussions about the classificatory problem by British philosophers was a spatial (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  • Medicine is not science.Clifford Miller & Donald W. Miller - 2014 - European Journal for Person Centered Healthcare 2 (2):144-153.
    ABSTRACT: Abstract Most modern knowledge is not science. The physical sciences have successfully validated theories to infer they can be used universally to predict in previously unexperienced circumstances. According to the conventional conception of science such inferences are falsified by a single irregular outcome. And verification is by the scientific method which requires strict regularity of outcome and establishes cause and effect. -/- Medicine, medical research and many “soft” sciences are concerned with individual people in complex heterogeneous populations. These populations (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   5 citations  
  • Do Accelerating Turing Machines Compute the Uncomputable?B. Jack Copeland & Oron Shagrir - 2011 - Minds and Machines 21 (2):221-239.
    Accelerating Turing machines have attracted much attention in the last decade or so. They have been described as “the work-horse of hypercomputation” (Potgieter and Rosinger 2010: 853). But do they really compute beyond the “Turing limit”—e.g., compute the halting function? We argue that the answer depends on what you mean by an accelerating Turing machine, on what you mean by computation, and even on what you mean by a Turing machine. We show first that in the current literature the term (...)
    Direct download (14 more)  
     
    Export citation  
     
    Bookmark   13 citations  
  • Accelerating Turing machines.B. Jack Copeland - 2002 - Minds and Machines 12 (2):281-300.
    Accelerating Turing machines are Turing machines of a sort able to perform tasks that are commonly regarded as impossible for Turing machines. For example, they can determine whether or not the decimal representation of contains n consecutive 7s, for any n; solve the Turing-machine halting problem; and decide the predicate calculus. Are accelerating Turing machines, then, logically impossible devices? I argue that they are not. There are implications concerning the nature of effective procedures and the theoretical limits of computability. Contrary (...)
    Direct download (14 more)  
     
    Export citation  
     
    Bookmark   24 citations