Pages that link to "Item:Q2254552"
From MaRDI portal
The following pages link to Probabilization of logics: completeness and decidability (Q2254552):
Displaying 15 items.
- Decidability of finite probabilistic propositional dynamic logics (Q809069) (← links)
- An algebraic synthesis of the foundations of logic and probability (Q1096615) (← links)
- Probabilistic semantics for Delgrande's conditional logic and a counterexample to his default logic (Q1274292) (← links)
- On consistency in probabilistic logic for logical formulas represented by \(B\)-hypertrees (Q1296806) (← links)
- Soundness and completeness results for LEA and probability semantics (Q2151410) (← links)
- On standard completeness and finite model property for a probabilistic logic on Łukasiewicz events (Q2237146) (← links)
- Towards classifying propositional probabilistic logics (Q2250552) (← links)
- Epistemic logics with structured knowledge (Q2333672) (← links)
- Combining probability and logic: papers from Progic 2011 (Q2446668) (← links)
- Possibilistic logic: Complexity and algorithms (Q2752126) (← links)
- (Q3197354) (← links)
- (Q4271923) (← links)
- Complexity Results for Probabilistic Datalog (Q4576254) (← links)
- Computability of validity and satisfiability in probability logics over finite and countable models (Q4586148) (← links)
- Barwise Completeness Theorems for Some Biprobability Logics (Q4724599) (← links)