• A
  • A
  • A
  • АБВ
  • АБВ
  • АБВ
  • A
  • A
  • A
  • A
  • A
Обычная версия сайта
  • RU
  • EN
  • HSE University
  • Publications
  • Book chapter
  • Algorithmic complexity of monadic multimodal predicate logics with equality over finite Kripke frames
  • RU
  • EN
Расширенный поиск
Высшая школа экономики
Национальный исследовательский университет
Priority areas
  • business informatics
  • economics
  • engineering science
  • humanitarian
  • IT and mathematics
  • law
  • management
  • mathematics
  • sociology
  • state and public administration
by year
  • 2028
  • 2027
  • 2026
  • 2025
  • 2024
  • 2023
  • 2022
  • 2021
  • 2020
  • 2019
  • 2018
  • 2017
  • 2016
  • 2015
  • 2014
  • 2013
  • 2012
  • 2011
  • 2010
  • 2009
  • 2008
  • 2007
  • 2006
  • 2005
  • 2004
  • 2003
  • 2002
  • 2001
  • 2000
  • 1999
  • 1998
  • 1997
  • 1996
  • 1995
  • 1994
  • 1993
  • 1992
  • 1991
  • 1990
  • 1989
  • 1988
  • 1987
  • 1986
  • 1985
  • 1984
  • 1983
  • 1982
  • 1981
  • 1980
  • 1979
  • 1978
  • 1977
  • 1976
  • 1975
  • 1974
  • 1973
  • 1972
  • 1971
  • 1970
  • 1969
  • 1968
  • 1967
  • 1966
  • 1965
  • 1964
  • 1963
  • 1958
  • More
Subject
News
September 21, 2026
Researchers Develop Methodology to Assess the Quality of Legal Representation in Criminal Proceedings
Having a good defence attorney in criminal proceedings can largely determine whether a defendant retains their freedom, health and good name. Researchers at HSE University propose a method for predicting an attorney’s performance based on the outcomes of their previous cases. The methodology takes into account the severity of the charges, the complexity of the cases, and the most likely outcome, drawing on judicial statistics.
September 21, 2026
Algebra, Geometry, and AI: Russian and Vietnamese Mathematicians Discuss Current Research
A delegation of scientists from Hanoi visited the HSE Faculty of Computer Science and then took part in a Russian-Vietnamese conference in St Petersburg. The events were part of the three-year project ‘Flexibility and Computational Methods.’ Over the course of the project, the researchers have prepared joint publications and obtained new mathematical results.
September 18, 2026
When Pictures Hinder Understanding: Illustrations May Impede Learning of Abstract Ideas
Illustrations can help remember specific actions but do not always make abstract ideas easier to learn. Researchers from HSE University and Humboldt University compared how people learn from texts with different levels of abstractness. They found that participants remembered illustrations better and performed better on related tasks after reading a multimedia text about yoga asanas than after reading an abstract text about the Nash equilibrium. The findings could help improve the selection of illustrations for educational and informational materials. The study has been published in Learning and Instruction.

 

Have you spotted a typo?
Highlight it, click Ctrl+Enter and send us a message. Thank you for your help!

Publications
  • Books
  • Articles
  • Chapters of books
  • Working papers
  • Report a publication
  • Research at HSE

?

Algorithmic complexity of monadic multimodal predicate logics with equality over finite Kripke frames

P. 13–17.
Agadzhanian I., Rybakov M., Shkatov D.
Language: English
Full text
Keywords: modal predicate logicmultimodal logic
Publication based on the results of:
Доказательства и модели (2023)

In book

SCAN 2023 Semantical and Computational Aspects of Non-Classical Logics: Moscow + Online, June 13–17, 2023. Abstracts
SCAN 2023 Semantical and Computational Aspects of Non-Classical Logics: Moscow + Online, June 13–17, 2023. Abstracts
M.: ., 2023.
Similar publications
Non-axiomatizability of modal predicate logics of Dedekind-complete linear orders with constant domains
Rybakov M., Shkatov D., Journal of Logic and Computation 2026 Vol. 36 No. 6 Article exag026
We prove Pi-1-1-hardness, and thus lack of recursive axiomatizability, of constant-domain modal predicate logics defined by a class of Dedekind complete linear Kripke frames containing a frame with an infinitely increasing chain of worlds. The result holds even for the language with one unary predicate letter, one propositional letter, and two individual variables. ...
Added: September 1, 2026
Recursive inseparability of classical theories of a binary predicate and non-classical logics of a unary predicate
Rybakov M., / Series arXiv "math". 2025. No. 2505.00524.
The paper considers algorithmic properties of classical and non-classical first-order logics and theories in bounded languages. The main idea is to prove the undecidability of various fragments of classical and non-classical first-order logics and theories indirectly — by extracting it as a consequence of the recursive inseparability of special problems associated with them. First, we ...
Added: May 21, 2025
Algorithmic complexity of monadic multimodal predicate logics with equality over finite Kripke frames
Агаджанян И. А., Rybakov M., Шкатов Д. П., / Series arXiv "math". 2023.
The paper investigates algorithmic complexity of monadic multimodal predicate logics with equality over finite Kripke frames or classes of finite Kripke frames. Precise complexity bounds for monadic logics of classes of Kripke frames with finitely many possible worlds are obtained. ...
Added: July 7, 2023
On Kripke completeness of modal predicate logics around quantified K5
Valentin Shehtman, Annals of Pure and Applied Logic 2023 Vol. 174 No. 2 Article 103202
The paper studies completeness and incompleteness of modal predicate logics in Kripke semantics, especially for logics of the form QL, minimal predicate extensions of modal propositional logics. We show that QL is incomplete for a continual family of logics  above K + \Box(\Box p \rigtharrow p), in particular for well-known K5 and K45. On the other hand, in some cases ...
Added: January 30, 2023
Algorithmic properties of first-order modal logics of finite Kripke frames in restricted languages
Rybakov M., Shkatov D., Journal of Logic and Computation 2020 Vol. 30 No. 7 P. 1305–1329
We study the effect of restricting the number of individual variables, as well as the number and arity of predicate letters, in languages of first-order predicate modal logics of finite Kripke frames on the logics’ algorithmic properties. A finite frame is a frame with a finite set of possible worlds. The languages we consider have ...
Added: August 27, 2020
On Kripke completeness of some modal predicate logics with the density axiom
Shehtman V. B., , in: Advances in Modal LogicVol. 12.: College Publications, 2018. P. 559–575.
We prove completeness for some normal modal predicate logics in the standard Kripke semantics with expanding domains. We consider quantified versions of propositional logics with the axiom of density plus some others (transitivity, confluence). The method of proof modifies the technique developed for other cases  (without density) by S. Ghilardi, G. Corsi and D. Skvorstov; but now we arrange the ...
Added: September 20, 2018
  • About
  • About
  • Key Figures & Facts
  • Sustainability at HSE University
  • Faculties & Departments
  • International Partnerships
  • Faculty & Staff
  • HSE Buildings
  • HSE University for Persons with Disabilities
  • Public Enquiries
  • Studies
  • Admissions
  • Programme Catalogue
  • Undergraduate
  • Graduate
  • Exchange Programmes
  • Summer University
  • Summer Schools
  • Semester in Moscow
  • Business Internship
  • Research
  • International Laboratories
  • Research Centres
  • Research Projects
  • Monitoring Studies
  • Conferences & Seminars
  • Academic Jobs
  • Yasin (April) International Academic Conference on Economic and Social Development
  • Media & Resources
  • Publications by staff
  • HSE Journals
  • Publishing House
  • iq.hse.ru: commentary by HSE experts
  • Library
  • Economic & Social Data Archive
  • Video
  • HSE Repository of Socio-Economic Information
  • HSE1993–2026
  • Contacts
  • Copyright
  • Privacy Policy
  • Site Map
Edit