Henkin and function quantifiers

&
Annals of Pure and Applied Logic 43 (3):273-292 (1989)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1016/0168-0072(89)90071-7

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 100,865

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

Kolaitis Phokion G. and Väänänen Jouko A.. Generalized quantifiers and pebble games on finite structures. Annals of pure and applied logic, vol. 74 pp. 23–75. [REVIEW]I. A. Stewart - 1996 - Journal of Symbolic Logic 61 (4):1387-1388.
Decidability problems in languages with Henkin quantifiers.Michał Krynicki & Marcin Mostowski - 1992 - Annals of Pure and Applied Logic 58 (2):149-172.
Henkin Quantifiers and Complete Problems.Andreas Blass & Yuri Gurevich - 1986 - Annals of Pure and Applied Logic 32:1--16.
ASH, CJ, Stability of recursive structures in arithmetical degrees BLASS, A. and GUREVICH, Y., Henkin quantifiers and complete problems BUCHHOLZ, W., A new system of proof-theoretic ordinal functions. [REVIEW]H. Friedman & Rc Flagg - 1986 - Annals of Pure and Applied Logic 32 (C):299.
Henkin Quantifiers,[w:] Krynicki M., Mostowski M., Szczerba LW (red.).M. Krynicki - 1995 - In Michał Krynicki, Marcin Mostowski & Lesław W. Szczerba (eds.), Quantifiers: Logics, Models and Computation: Volume Two: Contributions. Dordrecht, Netherland: Kluwer Academic Publishers.
Henkin sentences and local reflection principles for Rosser provability.Taishi Kurahashi - 2016 - Annals of Pure and Applied Logic 167 (2):73-94.
A Radio Interview with Jouko Väänänen.Andrés Villaveces, Roman Kossak, Juha Kontinen & Åsa Hirvonen - 2015 - In Asa Hirvonen, Juha Kontinen, Roman Kossak & Andres Villaveces (eds.), Logic Without Borders: Essays on Set Theory, Model Theory, Philosophical Logic and Philosophy of Mathematics. Boston: De Gruyter. pp. 417-422.
Jouko Väänänen, A hierarchy theorem for Lindstrom quantifiers, Logic and abstraction, Essays dedicated to Per Lindström on his fiftieth birthday, edited by Mats Furberg, Thomas Wetterström, and Claes Åberg, Acta philosophica Gothoburgensia, no. 1, Acta Universitatis Gothobargensis, Göteborg1986, pp. 317–323. [REVIEW]Juha Oikkonen - 1989 - Journal of Symbolic Logic 54 (2):631-631.

Analytics

Added to PP
2014-01-16

Downloads
57 (#375,538)

6 months
9 (#477,108)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Jouko A Vaananen
University of Helsinki

Citations of this work

Definability hierarchies of general quantifiers.Lauri Hella - 1989 - Annals of Pure and Applied Logic 43 (3):235.
Generalized quantifiers.Dag Westerståhl - 2008 - Stanford Encyclopedia of Philosophy.
Complexity of syntactical tree fragments of Independence-Friendly logic.Fausto Barbero - 2021 - Annals of Pure and Applied Logic 172 (1):102859.
Decidability problems in languages with Henkin quantifiers.Michał Krynicki & Marcin Mostowski - 1992 - Annals of Pure and Applied Logic 58 (2):149-172.

View all 8 citations / Add more citations

References found in this work

Some remarks on infinitely long formulas.L. Henkin - 1961 - Journal of Symbolic Logic 30 (1):167--183.
Finite partially-ordered quantification.Wilbur John Walkoe Jr - 1970 - Journal of Symbolic Logic 35 (4):535-555.
Finite Partially‐Ordered Quantifiers.Herbert B. Enderton - 1970 - Mathematical Logic Quarterly 16 (8):393-397.
Finite partially-ordered quantification.Wilbur John Walkoe - 1970 - Journal of Symbolic Logic 35 (4):535-555.

View all 12 references / Add more references