Kolmogorov and mathematical logic

DOI10.2307/2275276zbMath0767.03003OpenAlexW2139913735MaRDI QIDQ4032626

Vladimir A. Uspensky

Publication date: 1 April 1993

Published in: Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/2275276

zbMATH Keywords

information theoryintuitionistic logicprobability theorymathematical logicalgorithm theoryKolmogorov

Mathematics Subject Classification ID

History of mathematics in the 20th century (01A60) History of mathematical logic and foundations (03-03)

Related Items (10)

Essential structure of proofs as a measure of complexity ⋮ Towards Slime Mould Based Computer ⋮ PHYSARUM SPATIAL LOGIC ⋮ Semantics-to-Syntax Analyses of Algorithms ⋮ Explicit Provability and Constructive Semantics ⋮ Programmable reconfiguration of Physarum machines ⋮ Kolmogorov complexity and non-determinism ⋮ From reaction-diffusion to physarum computing ⋮ An intuitionist reasoning upon formal intuitionist logic: logical analysis of Kolmogorov's 1932 paper ⋮ The Developments of the Concept of Machine Computability from 1936 to the 1960s

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Zur Deutung der intuitionistischen Logik
• Probability theory and mathematical statistics. Proceedings of the Fourth USSR - Japan Symposium, held at Tbilisi, USSR, August 23-29, 1982
• Process complexity and effective random tests
• Storage Modification Machines
• A New Interpretation of the von Mises' Concept of Random Sequence
• Logical basis for information theory and probability theory
• The definition of random sequences
• A formal theory of inductive inference. Part I
• On the concept of a random sequence
• [Russian Text Ignored]

This page was built for publication: Kolmogorov and mathematical logic