On the decision problem for quantified probability logics

DOI10.4213/IM9652EMaRDI QIDQ6970366zbMATH OpenFDO

Authors S. O. Speranskij

Publication date 18 June 2025

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

Full work available at URL https://doi.org/10.4213/IM9652E

zbMATH Keywords

decidabilityelementary theoriesprefix fragmentsprobability logic

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25) Probability and inductive logic (03B48)

Cites work

• A logic for reasoning about probabilities
• A note on hereditarily Π10- and Σ10-complete sets of sentences
• A Probabilistic Logic with Polynomial Weight Formulas
• An `elementary' perspective on reasoning about probability spaces
• An analysis of first-order logics of probability
• Decidability and expressiveness for first-order logics of probability
• scientific article; zbMATH DE number 965572 (Why is no real title available?)
• scientific article; zbMATH DE number 3068536 (Why is no real title available?)
• Probability logics. Probability-based formalization of uncertain reasoning
• Probing the Quantitative-Qualitative Divide in Probabilistic Reasoning
• Quantification over propositional formulas in probability logic: decidability issues
• Quantifying over events in probability logic: an introduction
• Sharpening complexity results in quantified probability logic
• Some new results on decidability for elementary algebra and geometry
• Undecidable fragments of elementary theories

Cited in

(2)

• On hereditarily undecidable fragments of basic elementary theories
• Infinitary calculus for first-order logic of probability with distribution on the domain

This page was built for publication: On the decision problem for quantified probability logics

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6970366)