Computational hardness of validity in probability logic

DOI10.1007/978-3-642-35722-0_18MaRDI QIDQ3455849zbMATH OpenOpenAlexFDO

Authors Rutger Kuyper

Publication date 11 December 2015

Published in Logical Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-35722-0_18

Mathematics Subject Classification ID

Probability and inductive logic (03B48) Undecidability and degrees of sets of sentences (03D35) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Recommendations

• Computability of validity and satisfiability in probability logics over finite and countable models
• Complexity for probability logic with quantifiers over propositions
• Decidability and Undecidability in Probability Logic
• Decidability and expressiveness for first-order logics of probability

Cites work

• Decidability and Undecidability in Probability Logic
• Probabilistic Logic and Induction
• Probability logic
• Robust logics

Cited in

(4)

• Complexity for probability logic with quantifiers over propositions
• Decidability and Undecidability in Probability Logic
• Collapsing probabilistic hierarchies. I
• Computability of validity and satisfiability in probability logics over finite and countable models

This page was built for publication: Computational hardness of validity in probability logic

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