Loading [MathJax]/jax/output/CommonHTML/jax.js
Algebra i logika
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Impact factor

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS


Algebra Logika:
Year:
Volume:
Issue:
Page:
Find




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

Algebra i logika, 2011, Volume 50, Number 4, Pages 533–546 (Mi al500)  
This article is cited in 6 scientific papers (total in 6 papers)

Quantification over propositional formulas in probability logic: decidability issues

S. O. Speranskii

Novosibirsk State University, Novosibirsk, Russia
Full-text PDF (195 kB) Citations (6)
References:
PDF
HTML
Abstract: A language for reasoning about probability is generalized by adding quantifiers over propositional formulas to the language. Then relevant decidability issues are considered. In particular, the results presented demonstrate that a rather weak fragment of the new language has an undecidable validity problem. On the other hand, it is stated that a restricted version of the validity problem is decidable for ∀∃-sentences.
Keywords: probability logic, quantification over propositions, decidability.
Received: 26.01.2011
Revised: 29.03.2011
English version:
Algebra and Logic, 2011, Volume 50, Issue 4, Pages 365–374
DOI: https://doi.org/10.1007/s10469-011-9148-3
Bibliographic databases:
Document Type: Article
UDC: 510.647+510.5
Language: Russian
Citation: S. O. Speranskii, “Quantification over propositional formulas in probability logic: decidability issues”, Algebra Logika, 50:4 (2011), 533–546; Algebra and Logic, 50:4 (2011), 365–374
Citation in format AMSBIB
\Bibitem{Spe11}
\by S.~O.~Speranskii
\paper Quantification over propositional formulas in probability logic: decidability issues
\jour Algebra Logika
\yr 2011
\vol 50
\issue 4
\pages 533--546
\mathnet{http://mi.mathnet.ru/al500}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=2893587}
\zmath{https://zbmath.org/?q=an:06116201}
\transl
\jour Algebra and Logic
\yr 2011
\vol 50
\issue 4
\pages 365--374
\crossref{https://doi.org/10.1007/s10469-011-9148-3}
\isi{https://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=Publons&SrcAuth=Publons_CEL&DestLinkType=FullRecord&DestApp=WOS_CPL&KeyUT=000295735600006}
\scopus{https://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-80053926466}
Linking options:
  • https://www.mathnet.ru/eng/al500
  • https://www.mathnet.ru/eng/al/v50/i4/p533
    • This publication is cited in the following 6 articles:
    1. Stanislav O Speranski, “Sharpening complexity results in quantified probability logic”, Logic Journal of the IGPL, 2024  crossref
    2. S. O. Speranski, “Elementary invariants for quantified probability logic”, Dokl. Math., 107:2 (2023), 93–96  mathnet  crossref  crossref  mathscinet  elib
    3. S. O. Speranski, “Quantifying over events in probability logic: an introduction”, Math. Struct. Comput. Sci., 27:8 (2017), 1581–1600  crossref  mathscinet  zmath  isi  scopus
    4. S. O. Speranski, “A note on hereditarily $\Pi_1^0$- and $\Sigma_1^0$-complete sets of sentences”, J. Logic Comput., 26:5 (2016), 1729–1741  crossref  mathscinet  zmath  isi  scopus
    5. S. O. Speranskii, “Collapsing probabilistic hierarchies. I”, Algebra and Logic, 52:2 (2013), 159–171  mathnet  crossref  mathscinet  isi
    6. S. O. Speranski, “Complexity for probability logic with quantifiers over propositions”, Journal of Logic and Computation, 23:5 (2013), 1035  crossref
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Алгебра и логика Algebra and Logic
    Statistics & downloads:
    Abstract page:509
    Full-text PDF :134
    References:98
    First page:23
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2025