- 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
Kolmogorov and mathematical logic
Journal of Symbolic Logic 57 (2):385-412 (1992)
Abstract
This article has no associated abstract. (fix it)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
Dictionary of symbols of mathematical logic.Robert Feys (ed.) - 1969 - Amsterdam,: North-Holland Pub. Co..
Kolmogorov complexity and information theory. With an interpretation in terms of questions and answers.Peter D. Grünwald & Paul M. B. Vitányi - 2003 - Journal of Logic, Language and Information 12 (4):497-529.
Kolmogorov complexity and symmetric relational structures.W. L. Fouché & P. H. Potgieter - 1998 - Journal of Symbolic Logic 63 (3):1083-1094.
Kolmogorov complexity for possibly infinite computations.Verónica Becher & Santiago Figueira - 2005 - Journal of Logic, Language and Information 14 (2):133-148.
Every 2-random real is Kolmogorov random.Joseph S. Miller - 2004 - Journal of Symbolic Logic 69 (3):907-913.
A course in mathematical logic.J. L. Bell - 1977 - New York: sole distributors for the U.S.A. and Canada American Elsevier Pub. Co.. Edited by Moshé Machover.
The Kolmogorov-Loveland stochastic sequences are not closed under selecting subsequences.Wolfgang Merkle - 2003 - Journal of Symbolic Logic 68 (4):1362-1376.
Analytics
Added to PP
2009-01-28
Downloads
32 (#488,786)
6 months
19 (#130,686)
2009-01-28
Downloads
32 (#488,786)
6 months
19 (#130,686)
Historical graph of downloads
Citations of this work
Explicit provability and constructive semantics.Sergei N. Artemov - 2001 - Bulletin of Symbolic Logic 7 (1):1-36.
Explication as a Three-Step Procedure: the case of the Church-Turing Thesis.Matteo De Benedetto - 2021 - European Journal for Philosophy of Science 11 (1):1-28.
Foundational analyses of computation.Yuri Gurevich - 2012 - In S. Barry Cooper (ed.), How the World Computes. pp. 264--275.
Constructivity and Computability in Historical and Philosophical Perspective.Jacques Dubucs & Michel Bourdeau (eds.) - 2014 - Dordrecht, Netherland: Springer.
References found in this work
Theory of Recursive Functions and Effective Computability.Hartley Rogers - 1971 - Journal of Symbolic Logic 36 (1):141-146.
On the Concept of a Random Sequence.Alonzo Church - 1940 - Bulletin of the American Mathematical Society 46 (2):130--135.
Rekursive Funktionen.Raphael M. Robinson & Rozsa Peter - 1951 - Journal of Symbolic Logic 16 (4):280.
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-pp8v9 uwo