scientific article; zbMATH DE number 7139948

MaRDI QIDQ5204596zbMATH OpenFDO

Authors Gerhard Lischke

Publication date 4 December 2019

Mathematics Subject Classification ID

History of mathematics in the 19th century (01A55) History of mathematics in the 20th century (01A60) History of mathematical logic and foundations (03-03) Complexity of computation (including implicit computational complexity) (03D15)

Recommendations

• Propositional complexity and the Frege-Geach point
• Natural complexity, computational complexity and depth
• scientific article; zbMATH DE number 1341929
• Intrinsic theories and computational complexity
• Publication:3483265
• Axiomatizing Kolmogorov complexity
• The axiomatic power of Kolmogorov complexity
• The Kolmogorov expression complexity of logics
• scientific article; zbMATH DE number 3274717
• Sur la complexité du principe de Tarski-Seidenberg

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 Q5204596)