A universal inductive inference machine

Journal of Symbolic Logic 56 (2):661-672 (1991)
  Copy   BIBTEX

Abstract

A paradigm of scientific discovery is defined within a first-order logical framework. It is shown that within this paradigm there exists a formal scientist that is Turing computable and universal in the sense that it solves every problem that any scientist can solve. It is also shown that universal scientists exist for no regular logics that extend first-order logic and satisfy the Löwenheim-Skolem condition

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 92,261

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Analytics

Added to PP
2009-01-28

Downloads
290 (#70,818)

6 months
42 (#95,987)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Scott Weinstein
University of Pennsylvania

Citations of this work

Reichenbach, induction, and discovery.Kevin T. Kelly - 1991 - Erkenntnis 35 (1-3):123 - 149.
Relevant consequence and empirical inquiry.Daniel N. Osherson & Scott Weinstein - 1993 - Journal of Philosophical Logic 22 (4):437 - 448.
On the danger of half-truths.Daniel Osherson & Scott Weinstein - 1995 - Journal of Philosophical Logic 24 (1):85 - 115.

Add more citations

References found in this work

Model Theory.Michael Makkai, C. C. Chang & H. J. Keisler - 1991 - Journal of Symbolic Logic 56 (3):1096.
Theory of Recursive Functions and Effective Computability.Hartley Rogers - 1971 - Journal of Symbolic Logic 36 (1):141-146.
Paradigms of truth detection.Daniel N. Osherson & Scott Weinstein - 1989 - Journal of Philosophical Logic 18 (1):1 - 42.
Inductive inference in the limit.Clark Glymour - 1985 - Erkenntnis 22 (1-3):23 - 31.

Add more references