More about plausibility orderings (Q1060937)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 3910076
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | More about plausibility orderings |
scientific article; zbMATH DE number 3910076 |
Statements
More about plausibility orderings (English)
0 references
1983
0 references
Let S be a finite set of statements, with A and B subsets. Let \(\geq\) be a binary relation over the power set of S, which is connected, transitive, and independent. \(A\geq B\) means A is at least as plausible as B. This paper extends \(\geq\) to implausible statements, i.e. statements less plausible than the empty set.
0 references
plausibility
0 references
orderings
0 references
0.7808958888053894
0 references
0.7745398283004761
0 references
0.7347402572631836
0 references
0.7318965792655945
0 references
