Matematicheskie Zametki
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Forthcoming papers
Archive
Impact factor
Subscription
Guidelines for authors
License agreement
Submit a manuscript

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS



Mat. Zametki:
Year:
Volume:
Issue:
Page:
Find






Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register


Mat. Zametki, 2005, Volume 77, Issue 2, Pages 291–302 (Mi mz2481)  

Finite problems and the logic of the weak law of excluded middle

A. V. Chernov

M. V. Lomonosov Moscow State University

Abstract: A new characteristic of propositional formulas as operations on finite problems, the cardinality of a sufficient solution set, is defined. It is proved that if a formula is deducible in the logic of the weak law of excluded middle, then the cardinality of a sufficient solution set is bounded by a constant depending only on the number of variables; otherwise, the accessible cardinality of a sufficient solution set is close to (greater than the nth root of) its trivial upper bound. This statement is an analog of the authors result about the algorithmic complexity of sets obtained as values of propositional formulas, which was published previously. Also, we introduce the notion of Kolmogorov complexity of finite problems and obtain similar results.

DOI: https://doi.org/10.4213/mzm2481

Full text: PDF file (220 kB)
References: PDF file   HTML file

English version:
Mathematical Notes, 2005, 77:2, 263–272

Bibliographic databases:

UDC: 510.52
Received: 12.11.2003

Citation: A. V. Chernov, “Finite problems and the logic of the weak law of excluded middle”, Mat. Zametki, 77:2 (2005), 291–302; Math. Notes, 77:2 (2005), 263–272

Citation in format AMSBIB
\Bibitem{Che05}
\by A.~V.~Chernov
\paper Finite problems and the logic of the weak law of excluded middle
\jour Mat. Zametki
\yr 2005
\vol 77
\issue 2
\pages 291--302
\mathnet{http://mi.mathnet.ru/mz2481}
\crossref{https://doi.org/10.4213/mzm2481}
\mathscinet{http://www.ams.org/mathscinet-getitem?mr=2157096}
\zmath{https://zbmath.org/?q=an:1074.03005}
\elib{https://elibrary.ru/item.asp?id=14466483}
\transl
\jour Math. Notes
\yr 2005
\vol 77
\issue 2
\pages 263--272
\crossref{https://doi.org/10.1007/s11006-005-0025-z}
\isi{http://gateway.isiknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=PARTNER_APP&SrcAuth=LinksAMR&DestLinkType=FullRecord&DestApp=ALL_WOS&KeyUT=000227418800025}
\scopus{https://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-20144362969}


Linking options:
  • http://mi.mathnet.ru/eng/mz2481
  • https://doi.org/10.4213/mzm2481
  • http://mi.mathnet.ru/eng/mz/v77/i2/p291

    SHARE: VKontakte.ru FaceBook Twitter Mail.ru Livejournal Memori.ru


    Citing articles on Google Scholar: Russian citations, English citations
    Related articles on Google Scholar: Russian articles, English articles
  • Математические заметки Mathematical Notes
    Number of views:
    This page:421
    Full text:161
    References:53
    First page:2

     
    Contact us:
     Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2021