More about plausibility orderings
type: Item
instance of: scholarly article
title: More about plausibility orderings
zbMATH Open document ID: 0569.90002
DOI: 10.1007/BF00485826
author: Ronald A. Heiner
author: Dennis J. Packard
published in: Synthese
publication date: 1983-01-01T00:00:00Z
review text: 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.
Mathematics Subject Classification ID: 91B08
zbMATH DE Number: 3910076
zbMATH Keywords: plausibility
zbMATH Keywords: orderings
MaRDI profile type: Publication
full work available at URL: https://doi.org/10.1007/bf00485826
OpenAlex ID: W1976807717
description: scientific article; zbMATH DE number 3910076