Access

You are not currently logged in.

Access your personal account or get JSTOR access through your library or other institution:

login

Log in to your personal account or through your institution.

Urn Models: A Classical Exposition

Max J. Cresswell
Studia Logica: An International Journal for Symbolic Logic
Vol. 41, No. 2/3, Proceedings of the 1981 Annual Conference of the Australasian Association of Symbolic Logic (1982), pp. 109-130
Published by: Springer
Stable URL: http://www.jstor.org/stable/20015048
Page Count: 22
  • Download ($43.95)
  • Cite this Item
Urn Models: A Classical Exposition
Preview not available

Abstract

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.

Page Thumbnails

  • Thumbnail: Page 
[109]
    [109]
  • Thumbnail: Page 
110
    110
  • Thumbnail: Page 
111
    111
  • Thumbnail: Page 
112
    112
  • Thumbnail: Page 
113
    113
  • Thumbnail: Page 
114
    114
  • Thumbnail: Page 
115
    115
  • Thumbnail: Page 
116
    116
  • Thumbnail: Page 
117
    117
  • Thumbnail: Page 
118
    118
  • Thumbnail: Page 
119
    119
  • Thumbnail: Page 
120
    120
  • Thumbnail: Page 
121
    121
  • Thumbnail: Page 
122
    122
  • Thumbnail: Page 
123
    123
  • Thumbnail: Page 
124
    124
  • Thumbnail: Page 
125
    125
  • Thumbnail: Page 
126
    126
  • Thumbnail: Page 
127
    127
  • Thumbnail: Page 
128
    128
  • Thumbnail: Page 
129
    129
  • Thumbnail: Page 
130
    130