Abstract
We report a recent Tarski-style semantics for a language which includes the branching quantifiers on which Andrzej Ehrenfeucht made the first breakthrough in 1958. The semantics is equivalent to Henkin's game-theoretic semantics, but unlike Henkin's it is compositional. We use second-order formulas to give a new (and with any luck, more manageable) description of this Tarski-style semantics. Finally we apply the new description to present a compositional and fully abstract semantics for the slightly more limited syntax of Hintikka and Sandu, answering a question of Sandu.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Barwise, J., Etchemendy, J.: Tarski's world 3.0. CSLI/SRI International, Menlo Park CA, 1991.
Enderton, H. B.: Finite partially ordered quantifiers. Zeitschrift für Math. Logic und Grundlagen der Math. 16 (1970) 393–397.
Gronendieck, J., Stokhof, M.: Dynamic predicate logic. Linguistics and Philosophy 14 (1991) 39–100.
Henkin, L.: Some remarks on infinitely long formulas. Infinitistic methods, Pergamon Press, Oxford and PAN, Warsaw 1961, pp. 167–183.
Hintikka, J.: Logic, language-games and information. Clarendon Press, Oxford 1973.
Hintikka, J.: The principles of mathematics revisited. Cambridge University Press, Cambridge 1996.
Hintikka, J., Sandu, G.: Game-theoretical semantics. Handbook of logic and language, ed. van Benthem, J., ter Meulen, A., Elsevier 1996, pp. 361–410.
Hodges, W.: Compositional semantics for a language of imperfect information. Logic Journal of the IGPL (1997), to appear.
Lang, S.: Diophantine geometry. John Wiley and Sons, New York 1962.
Walkoe, W. J.: Finite partially-ordered quantification. Journal of Symbolic Logic 35 (1970) 535–555.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Hodges, W. (1997). Some strange quantifiers. In: Mycielski, J., Rozenberg, G., Salomaa, A. (eds) Structures in Logic and Computer Science. Lecture Notes in Computer Science, vol 1261. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-63246-8_4
Download citation
DOI: https://doi.org/10.1007/3-540-63246-8_4
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-63246-7
Online ISBN: 978-3-540-69242-3
eBook Packages: Springer Book Archive