Decidability and expressiveness for first-order logics of probability
From MaRDI portal
Publication:1327387
DOI10.1006/inco.1994.1049zbMath0799.03017MaRDI QIDQ1327387
Martín Abadi, Joseph Y. Halpern
Publication date: 12 July 1994
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/818ec4509f5188bc28cd446781b68cc6c02983e2
complexity; possible worlds; models; axiomatization; domain; relative expressiveness; validity problem; associating probabilities with first-order languages
03D35: Undecidability and degrees of sets of sentences
03B48: Probability and inductive logic
03B25: Decidability of theories and sets of sentences
60A05: Axioms; other general questions in probability
Related Items
PROBABILISTIC ROLE MODELS AND THE GUARDED FRAGMENT, Probabilistic Logic over Paths, A note on definability in fragments of arithmetic with free unary predicates, Collapsing probabilistic hierarchies. I, The well-designed logical robot: learning and experience from observations to the Situation Calculus, Learning to assign degrees of belief in relational domains, Some first-order probability logics, Reasoning about probabilistic sequential programs, Assembling a consistent set of sentences in relational probabilistic logic with stochastic independence, Weakly complete axiomatization of exogenous quantum propositional logic, A logic for inductive probabilistic reasoning, The probability nesting game
