Urn models: A classical exposition (Q791516)
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 3851053
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Urn models: A classical exposition |
scientific article; zbMATH DE number 3851053 |
Statements
Urn models: A classical exposition (English)
0 references
1982
0 references
Urn models were developed by Veikko Rantala to provide a non-standard semantics for first-order logic in which the domains, over which the quantifiers range, are allowed to vary. Rantala uses game-theoretical semantics in his presentation, and the present paper is a study of urn models from a more classical, truth-conditional point of view. An axiomatic system for urn logic is set out and completeness is proved by the method of maximal consistent sets.
0 references
non-standard semantics for first-order logic
0 references
urn models
0 references
urn logic
0 references
completeness
0 references
maximal consistent sets
0 references
0.8233118057250977
0 references
0.7063632607460022
0 references
0.655408501625061
0 references
