Decidability and Undecidability in Probability Logic

DOI10.1007/978-3-540-92687-0_30MaRDI QIDQ3605546zbMATH OpenOpenAlexFDO

Authors Sebastiaan A. Terwijn

Publication date 24 February 2009

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

Full work available at URL https://doi.org/10.1007/978-3-540-92687-0_30

Mathematics Subject Classification ID

Probability and inductive logic (03B48) Paraconsistent logics (03B53)

Recommendations

• Computational hardness of validity in probability logic
• Quantification over propositional formulas in probability logic: decidability issues
• A Logic of Probability with Decidable Model Checking
• scientific article; zbMATH DE number 1948170
• Decidability and expressiveness for first-order logics of probability

Cites work

• A logic for inductive probabilistic reasoning
• scientific article; zbMATH DE number 3941493 (Why is no real title available?)
• scientific article; zbMATH DE number 515978 (Why is no real title available?)
• scientific article; zbMATH DE number 965572 (Why is no real title available?)
• scientific article; zbMATH DE number 3057871 (Why is no real title available?)
• Probabilistic Logic and Induction
• Robust logics

Cited in

(5)

• Combinatorial versus decision-theoretic components of impossibility theorems
• Computational hardness of validity in probability logic
• Computability of validity and satisfiability in probability logics over finite and countable models
• A decidable class of inferences in first-order objective Bayesian inductive logic
• Quantification over propositional formulas in probability logic: decidability issues

This page was built for publication: Decidability and Undecidability in Probability Logic

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