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.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
K. J. J. Hintikka, Logic, Language Games and Information, Oxford, Clarendon Press, 1973.
—,Impossible possible worlds vindicated, Journal of Philosophical Logic 4 (1975), pp. 475–484.
G. E. Hughes and M. J. Cresswell, An Introduction to Modal Logic, London, Methuen, 1968.
P. N. Johnson-Laird and M. Steedman, The psychology of syllogisms, Cognitive Psychology 10 (1978), pp. 64–99.
P. Olin, Urn models and categoricity, Journal of Philosophical Logic 7 (1978), pp. 331–345.
V. Rantala, Urn models: A new kind of non-standard models for first-order logic, ibidem 4 (1975) pp. 455–474.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Cresswell, M.J. Urn models: A classical exposition. Stud Logica 41, 109–130 (1982). https://doi.org/10.1007/BF00370339
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF00370339