Chair of Mathematical Logic and Theory of Algorithms

DOI10.3103/S0027132225700196MaRDI QIDQ6960551zbMATH OpenFDO

Authors A. L. Semenov, Maxim Babenko, A. Ya Belov, Nikolai K. Vereshchagin, M. E. Vishnikin, Evgeni E. Zolin, Vladimir Nikolaevich Krupskiĭ, Stepan Kuznetsov, Vassily Lyubetsky, A. A. Onoprienko, Mati Pentus, S. F. Soprunov, A. A. Sorokin, Valentin Shehtman, T. L. Yavorskaya

Publication date 11 July 2025

Published in Moscow University Mathematics Bulletin (Search for Journal in Brave)

Full work available at URL https://doi.org/10.3103/S0027132225700196

zbMATH Keywords

Lomonosov Moscow State UniversityChair of Mathematical Logic and Theory of Algorithms

Mathematics Subject Classification ID

History of mathematics at specific universities (01A73)

Cites work

• scientific article; zbMATH DE number 3648683 (Why is no real title available?)
• scientific article; zbMATH DE number 3427210 (Why is no real title available?)
• scientific article; zbMATH DE number 5605130 (Why is no real title available?)
• scientific article; zbMATH DE number 3902609 (Why is no real title available?)
• scientific article; zbMATH DE number 3976994 (Why is no real title available?)
• scientific article; zbMATH DE number 3985203 (Why is no real title available?)
• scientific article; zbMATH DE number 4010488 (Why is no real title available?)
• scientific article; zbMATH DE number 4087623 (Why is no real title available?)
• scientific article; zbMATH DE number 3685452 (Why is no real title available?)
• scientific article; zbMATH DE number 3504474 (Why is no real title available?)
• scientific article; zbMATH DE number 1297597 (Why is no real title available?)
• scientific article; zbMATH DE number 1341927 (Why is no real title available?)
• scientific article; zbMATH DE number 1995184 (Why is no real title available?)
• scientific article; zbMATH DE number 1499108 (Why is no real title available?)
• scientific article; zbMATH DE number 2174391 (Why is no real title available?)
• scientific article; zbMATH DE number 1567831 (Why is no real title available?)
• scientific article; zbMATH DE number 7585723 (Why is no real title available?)
• A survey of predicate realizability logic
• Algorithmic statistics: forty years later
• An improvement of Kolmogorov's estimates related to random number generators and a definition of randomness in terms of complexity
• Bitopological models of intuitionistic epistemic logic
• Combinatorial interpretation of Kolmogorov complexity
• Conditional complexity and codes
• Construction of finitely presented infinite nil-semigroups.
• Constructive proof theory and nonstandard analysis. Edited by G. E. Mints
• Derivational modal logics with the difference modality
• Explicit provability and constructive semantics
• Finite quantifier hierarchies in relational algebras
• Hypergraph Lambek grammars
• INTUITIONISTIC EPISTEMIC LOGIC
• Inequalities for Shannon entropy and Kolmogorov complexity
• Justification logic. Reasoning with reasons
• Kripke semantics for the logic of problems and propositions
• LOGICAL THEORIES OF ONE-PLACE FUNCTIONS ON THE SET OF NATURAL NUMBERS
• Lambek calculus is NP-complete
• Lattice of definability (of reducts) for integers with successor
• Logic of proofs
• Logic of proofs and provability
• Logical foundations of computer science. International symposium, LFCS 2013, San Diego, CA, USA, January 6--8, 2013. Proceedings
• Mathematical metaphysics of randomness
• Modal Logics of Regions and Minkowski Spacetime
• Monoid automata for displacement context-free languages
• NON–WELL-FOUNDED DERIVATIONS IN THE GÖDEL-LÖB PROVABILITY LOGIC
• ON CERTAIN EXTENSIONS OF THE ARITHMETIC OF ADDITION OF NATURAL NUMBERS
• On almost periodicity of morphic sequences
• On joint conditional complexity (entropy)
• On sharp and single-conclusion justification models
• On the role of the law of large numbers in the theory of randomness
• On the ‘definability of definable’ problem of Alfred Tarski, Part II
• Outer billiards outside regular polygons: tame case
• Partitioning multi-dimensional sets in a small number of ``uniform parts
• Periodicity of morphic words
• Presburgerness of predicates regular in two number systems
• Products of modal logics, part 1
• Propositional primal logic with disjunction
• Referential logic of proofs
• Reflection principles and provability algebras in formal arithmetic
• Sequences close to periodic
• Shannon Entropy vs. Kolmogorov Complexity
• THE COMPLEXITY OF FINITE OBJECTS AND THE DEVELOPMENT OF THE CONCEPTS OF INFORMATION AND RANDOMNESS BY MEANS OF THE THEORY OF ALGORITHMS
• The Jacobian conjecture is stably equivalent to the Dixmier conjecture.
• The definable criterion for definability in Presburger arithmetic and its applications.
• The lattice of definability. Origins, recent developments, and further directions
• The local finite basis property and local representability of varieties of associative rings.
• The worm principle
• Topological completeness of the provability logic GLP
• Upper semi-lattice of binary strings with the relation ``\(x\) is simple conditional to \(y\)

This page was built for publication: Chair of Mathematical Logic and Theory of Algorithms

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