Computability of validity and satisfiability in probability logics over finite and countable models (Q4586148)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Computability of validity and satisfiability in probability logics over finite and countable models |
scientific article; zbMATH DE number 6935522
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Computability of validity and satisfiability in probability logics over finite and countable models |
scientific article; zbMATH DE number 6935522 |
Statements
Computability of validity and satisfiability in probability logics over finite and countable models (English)
0 references
12 September 2018
0 references
0.9253777
0 references
0.9208239
0 references
0.91504955
0 references
0.91461563
0 references
0.9144287
0 references
0.9126251
0 references
0.9113481
0 references
