Elementary invariants for quantified probability logic

DOI10.1134/s1064562423700667OpenAlexW4386288092MaRDI QIDQ6095192

Stanislav O. Speranski

Publication date: 7 September 2023

Published in: Doklady Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1134/s1064562423700667

zbMATH Keywords

complexityprobability logicelementary invariantsquantification over events

Mathematics Subject Classification ID

General logic (03Bxx) Computability and recursion theory (03Dxx) Model theory (03Cxx)

Cites Work

• A note on definability in fragments of arithmetic with free unary predicates
• Quantification over propositional formulas in probability logic: decidability issues
• Some new results on decidability for elementary algebra and geometry
• An analysis of first-order logics of probability
• Minimally generated Boolean algebras
• Decidability and expressiveness for first-order logics of probability
• A logic for reasoning about probabilities
• Complexity for probability logic with quantifiers over propositions
• Presburger arithmetic with unary predicates is Π₁¹ complete
• Quantifying over events in probability logic: an introduction
• Unnamed Item
• Unnamed Item

This page was built for publication: Elementary invariants for quantified probability logic