Kolmogorov and mathematical logic

Journal of Symbolic Logic 57 (2):385-412 (1992)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.2307/2275276

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 103,302

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

Vladimir A. Uspensky. Godel's incompleteness theorem. A reprint of LV 889 with minor corrections. Theoretical computer science, vol. 130 , pp. 239–319. [REVIEW]H. B. Enderton - 1995 - Journal of Symbolic Logic 60 (4):1320.
Yu. L. Ershov and E. A. Palyutin. Mathematical logic. Revised English translation by Vladimir Shokurov of the preceding. Mir Publishers, Moscow1984, 303 pp. [REVIEW]Elliott Mendelson - 1986 - Journal of Symbolic Logic 51 (3):829-829.
Non-Factive Kolmogorov Conditionalization.Michael Rescorla - forthcoming - Review of Symbolic Logic:1-46.
Kolmogorov complexity and characteristic constants of formal theories of arithmetic.Shingo Ibuka, Masato Kikuchi & Hirotaka Kikyo - 2011 - Mathematical Logic Quarterly 57 (5):470-473.
Kolmogorov complexity and the second incompleteness theorem.Makoto Kikuchi - 1997 - Archive for Mathematical Logic 36 (6):437-443.
Prefix and plain Kolmogorov complexity characterizations of 2-randomness: simple proofs.Bruno Bauwens - 2015 - Archive for Mathematical Logic 54 (5-6):615-629.
Publications of Vladimir Alexandrovich Smirnov.[author unknown] - 2000 - Studia Logica 66 (2):215-225.
Kolmogorov and glivenko's papers about inturnonistic logic1.Jacek K. Kabzinski - 1973 - In Stanisław J. Surma, Studies in the history of mathematical logic. Wrocław,: Zakład Narodowy im. Ossolinskich. pp. 81.
Complexity of complexity and strings with maximal plain and prefix Kolmogorov complexity.B. Bauwens & A. Shen - 2014 - Journal of Symbolic Logic 79 (2):620-632.
A dutch book theorem and converse dutch book theorem for Kolmogorov conditionalization.Michael Rescorla - 2018 - Review of Symbolic Logic 11 (4):705-735.

Analytics

Added to PP
2009-01-28

Downloads
56 (#401,341)

6 months
13 (#197,488)

Historical graph of downloads
How can I increase my 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.
Paper machines.Daniele Mundici & Wilfried Seig - 1995 - Philosophia Mathematica 3 (1):5-30.

View all 6 citations / 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.
On the Concept of a Random Sequence.Alonzo Church - 1940 - Bulletin of the American Mathematical Society 46 (2):130--135.

View all 9 references / Add more references