?
Соответствие на счетных структурах и запросы к теориям
С. 24–26.
Zolin E.
Publication based on the results of:
In book
М.: Современные тетради, 2019.
Rybakov M., Логические исследования 2023 Т. 29 № 1 С. 114–146
Tiling problems are a convenient tool for studying algorithmic complexity of problems arising in various branches of mathematics, including logic. The paper describes modelling of domino problems using the first-order language, as well as some additional language constructs, some of which are not elementary. This enables us both to obtain simple proofs of known facts about undecidability of satisfiability problems for ...
Added: July 7, 2023
Zapryagaev A., / Series arXiv "math". 2022.
Added: December 7, 2022
Matushkin A. D., Popova S., Discrete Mathematics 2022 Vol. 345 No. 6 Article 112835
In this work we describe the spectra of all rational numbers that could be a density of a strictly balanced uniform hypergraph. We also introduce some specific constructions of strictly balanced uniform hypergraphs, and exploit them to generalize some results about Zero-One Law and Zero-One k-Law to the case of random uniform hypergraphs. ...
Added: June 29, 2022
Rybakov M., Shkatov D., Studia Logica 2021
Added: January 24, 2022
Rybakov M., Shkatov D., Logical Investigations 2021 Vol. 27 No. 2 P. 93–120
Доказывается неразрешимость логи QCTL и QLTL в языке с двумя переменными и одной одноместной предикатной буквой. ...
Added: January 24, 2022
Rybakov M., Котикова Е. А., Logical Investigations 2015 Vol. 21 No. 1 P. 86–99
For an infinite class of calculi containing CTL and QCL, it is proved that they are Kripke incomplete. ...
Added: July 20, 2020
Nabebin A. A., М.: Научный мир, 2010.
Излагаются основные понятия дискретной математики: модулярная арифметика и ее использование в криптографии, элементы комбинаторики, алгебра логики и логика предикатов, теория графов, конечные автоматы. ...
Added: May 28, 2012