Hostname: page-component-6bf8c574d5-rwnhh Total loading time: 0 Render date: 2025-02-17T13:27:20.415Z Has data issue: false hasContentIssue false
  • English
  • Français

Kelly Kevin T. and Oliver Schulte. The computable testability of theories making uncomputable predictions. Erkenntnis, vol. 43 (1995), pp. 29–66.

Review products

Kelly Kevin T. and Oliver Schulte. The computable testability of theories making uncomputable predictions. Erkenntnis, vol. 43 (1995), pp. 29–66.

Published online by Cambridge University Press:  12 March 2014

Stephen Leeds
Get access Rights & Permissions [Opens in a new window]

Abstract

An abstract is not available for this content so a preview has been provided. Please use the Get access link above for information on how to access this content.
Image of the first page of this content. For PDF version, please use the ‘Save PDF’ preceeding this image.'
Type
Reviews
Information
The Journal of Symbolic Logic , Volume 61 , Issue 3 , September 1996 , pp. 1049
Copyright
Copyright © Association for Symbolic Logic 1996

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)