Henkin Quantifiers and Complete Problems

&
Annals of Pure and Applied Logic 32:1--16 (1986)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1016/0168-0072(86)90040-0

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 101,795

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

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.
Equilibrium semantics of languages of imperfect information.Merlijn Sevenster & Gabriel Sandu - 2010 - Annals of Pure and Applied Logic 161 (5):618-631.
Henkin Quantifiers.M. Krynicki & M. Mostowski - 1995 - In Michał Krynicki, Marcin Mostowski & Lesław W. Szczerba (eds.), Quantifiers: Logics, Models and Computation: Volume Two: Contributions. Dordrecht, Netherland: Kluwer Academic Publishers. pp. 193--263.
Computational complexity of the semantics of some natural language constructions.Marcin Mostowski & Dominika Wojtyniak - 2004 - Annals of Pure and Applied Logic 127 (1-3):219--227.
Henkin and function quantifiers.Michael Krynicki & Jouko Väänänen - 1989 - Annals of Pure and Applied Logic 43 (3):273-292.
Decidability problems in languages with Henkin quantifiers.Michał Krynicki & Marcin Mostowski - 1992 - Annals of Pure and Applied Logic 58 (2):149-172.
Compact extensions of L(Q).Menachem Magidor & Jerome Malitz - 1977 - Annals of Mathematical Logic 11 (2):217--261.
On branching quantifiers in English.Jon Barwise - 1979 - Journal of Philosophical Logic 8 (1):47 - 80.
Ramsey theory is needed for solving definability problems of generalized quantifiers.K. Luosto - 1999 - In Jouko A. Vaananen (ed.), European Summer School in Logic, Language and Information: ESSLLI 1997: Generalized Quantifiers and Computation. Springer. pp. 121--134.
Ambigous quantifiers.M. Krynicki & M. Mostowski - 1999 - In E. Orłowska (ed.), Logic at Work. Heidelberg. pp. 548--565.

Analytics

Added to PP
2012-03-18

Downloads
49 (#451,983)

6 months
15 (#214,286)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Generalized quantifiers.Dag Westerståhl - 2008 - Stanford Encyclopedia of Philosophy.
Aspects of compositionality.Gabriel Sandu & Jaakko Hintikka - 2001 - Journal of Logic, Language and Information 10 (1):49-61.
Equilibrium semantics of languages of imperfect information.Merlijn Sevenster & Gabriel Sandu - 2010 - Annals of Pure and Applied Logic 161 (5):618-631.
Henkin and function quantifiers.Michael Krynicki & Jouko Väänänen - 1989 - Annals of Pure and Applied Logic 43 (3):273-292.

View all 23 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.
Characterizing Second Order Logic with First Order Quantifiers.David Harel - 1979 - Mathematical Logic Quarterly 25 (25‐29):419-422.

View all 6 references / Add more references