Computational Hardness of Validity in Probability Logic

DOI10.1007/978-3-642-35722-0_18zbMath1437.03098OpenAlexW26570199MaRDI QIDQ3455849

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

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

Related Items (1)

Computability of validity and satisfiability in probability logics over finite and countable models

Cites Work

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

This page was built for publication: Computational Hardness of Validity in Probability Logic