scientific article; zbMATH DE number 3557755

zbMATH Open0358.02033MaRDI QIDQ4133604FDOQ4133604

Authors: Leonid A. Levin 

Publication date: 1976

Title of this publication is not available (Why is that?)

Recommendations

• The information in intuitionistic logic
• On the logic of informational independence and its applications
• On the semantics of informational independence
• Randomness conservation inequalities; information and independence in mathematical theories
• Logical information theory: new logical foundations for information theory
• Information and \(\sigma\)-algebras
• The logic of informational independence and finite models
• A generalization of a conservativity theorem for classical versus intuitionistic arithmetic
• The logic of \(\Pi_ 1\)-conservativity

Mathematics Subject Classification ID

Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Intuitionistic mathematics (03F55)

Cited In (6)

• Conditional Kolmogorov complexity and universal probability
• The time separation principle and the analysis of a class of quasifinite plausible reasonings (in terms of the Cantor uncountability theorem)
• Computational depth and reducibility
• Gacs-Kucera theorem
• Computational depth and reducibility
• Pure quantum states are fundamental, mixtures (composite states) are mathematical constructions: An argument using algorithmic information theory

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4133604)