- New
-
Topics
- All Categories
- Metaphysics and Epistemology
- Value Theory
- Science, Logic, and Mathematics
- Science, Logic, and Mathematics
- Logic and Philosophy of Logic
- Philosophy of Biology
- Philosophy of Cognitive Science
- Philosophy of Computing and Information
- Philosophy of Mathematics
- Philosophy of Physical Science
- Philosophy of Social Science
- Philosophy of Probability
- General Philosophy of Science
- Philosophy of Science, Misc
- History of Western Philosophy
- Philosophical Traditions
- Philosophy, Misc
- Other Academic Areas
- Journals
- Submit material
- More
The computable testability of theories making uncomputable predictions
Erkenntnis 43 (1):29 - 66 (1995)
Abstract
This article has no associated abstract. (fix it)Author Profiles
Links
PhilArchive
External links
(no proxy)
Setup an account with your affiliations in order to access resources via your University's proxy server
Through your library
- Sign in / register and customize your OpenURL resolver
- Configure custom resolver
My notes
Similar books and articles
Interpretive praxis and theory-networks.L. E. E. Sangwon - 2006 - Pacific Philosophical Quarterly 87 (2):213–230.
Dynamics of Theory Change: The Role of Predictions.Stephen G. Brush - 1994 - PSA: Proceedings of the Biennial Meeting of the Philosophy of Science Association 1994:133 - 145.
Prediction, explanation, and testability as criteria for judging statistical theories.Brown Grier - 1975 - Philosophy of Science 42 (4):373-383.
The computable dimension of trees of infinite height.Russell Miller - 2005 - Journal of Symbolic Logic 70 (1):111-141.
Small Group Predictions on an Uncertain Outcome: The Effect of Nondiagnostic Information.George R. Young II, Kenneth H. Price & Cynthia Claybrook - 2001 - Theory and Decision 50 (2):149-167.
Reflections on Peirce's Concepts of Testability and the Economy of Research.Jeff Foss - 1984 - PSA: Proceedings of the Biennial Meeting of the Philosophy of Science Association 1984:28 - 39.
The Block Relation in Computable Linear Orders.Michael Moses - 2011 - Notre Dame Journal of Formal Logic 52 (3):289-305.
Church's Thesis and the Conceptual Analysis of Computability.Michael Rescorla - 2007 - Notre Dame Journal of Formal Logic 48 (2):253-280.
Analytics
Added to PP
2009-01-28
Downloads
84 (#193,846)
6 months
31 (#100,497)
2009-01-28
Downloads
84 (#193,846)
6 months
31 (#100,497)
Historical graph of downloads
Author Profiles
Citations of this work
Contemporary debates in philosophy of science.Christopher Hitchcock (ed.) - 2004 - Malden, MA: Blackwell.
Means-ends epistemology.O. Schulte - 1999 - British Journal for the Philosophy of Science 50 (1):1-31.
After Popper, Kuhn and Feyerabend: Recent Issues in Theories of Scientific Method.Robert Nola & Howard Sankey (eds.) - 2000 - Boston: Kluwer Academic Publishers.
The logic of reliable and efficient inquiry.Oliver Schulte - 1999 - Journal of Philosophical Logic 28 (4):399-438.
References found in this work
The logic of scientific discovery.Karl Raimund Popper - 1934 - New York: Routledge. Edited by Hutchinson Publishing Group.
Collected Papers of Charles Sanders Peirce: Pragmatism and pragmaticism and Scientific metaphysics.Charles Sanders Peirce - 1960 - Cambridge: Belknap Press.
Theory of recursive functions and effective computability.Hartley Rogers - 1987 - Cambridge, Mass.: MIT Press.
The Logic of Scientific Discovery.K. Popper - 1959 - British Journal for the Philosophy of Science 10 (37):55-57.
PhilPapers logo by Andrea Andrews and Meghan Driscoll.
This site uses cookies and Google Analytics (see our terms & conditions for details regarding the privacy implications). Use of this site is subject to terms & conditions.
All rights reserved by The PhilPapers Foundation
Server: philpapers-web-7c76586df8-5tf24 uwo