Probabilistic Versus Deterministic Inductive Inference in Nonstandard Numberings

, &
Mathematical Logic Quarterly 34 (6):531-539 (1988)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1002/malq.19880340605

Other Versions

reprint Freivalds, Rüsinš; Kinber, Efim B.; Wiehagen, Rolf (1988) "Probabilistic Versus Deterministic Inductive Inference in Nonstandard Numberings". Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 34(6):531-539

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 101,139

External links

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

Through your library

My notes

Similar books and articles

Inductive Inference and Computable One‐One Numberings.Rsinš Freivalds, Efim B. Kinber & Rolf Wiehagen - 1982 - Mathematical Logic Quarterly 28 (27‐32):463-479.
Topological aspects of numberings.Wolfram Menzel & Frank Stephan - 2003 - Mathematical Logic Quarterly 49 (2):129-149.
A definable nonstandard enlargement.Frederik Herzberg - 2008 - Mathematical Logic Quarterly 54 (2):167-175.
The Independence of Control Structures in Programmable Numberings of the Partial Recursive Functions.Gregory A. Riccardi - 1982 - Mathematical Logic Quarterly 28 (20-21):285-296.
Connections between identifying functionals, standardizing operations, and computable numberings.Rüsinš Freivalds, Efim B. Kinber & Rolf Wiehagen - 1984 - Mathematical Logic Quarterly 30 (9‐11):145-164.
On btt‐Degrees of Sets of Minimal Numbers in Gödel Numberings.Jefim Kinber - 1976 - Mathematical Logic Quarterly 23 (13‐15):201-212.
The Independence of Control Structures in Programmable Numberings of the Partial Recursive Functions.Gregory A. Riccardi - 1982 - Mathematical Logic Quarterly 28 (20‐21):285-296.
A Logic For Inductive Probabilistic Reasoning.Manfred Jaeger - 2005 - Synthese 144 (2):181-248.

Analytics

Added to PP
2013-12-01

Downloads
22 (#975,058)

6 months
4 (#1,252,858)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

Theory of Recursive Functions and Effective Computability.Hartley Rogers - 1971 - Journal of Symbolic Logic 36 (1):141-146.

Add more references