Spectra of formulae with Henkin quantifiers

&
In A. Rojszczak, J. Cachro & G. Kurczewski (eds.), Philosophical Dimensions of Logic and Science. Kluwer Academic Publishers. pp. 29-45 (2003)
  Copy   BIBTEX

Abstract

It is known that various complexity-theoretical problems can be translated into some special spectra problems. Thus, questions about complexity classes are translated into questions about the expressive power of some languages. In this paper we investigate the spectra of some logics with Henkin quantifiers in the empty vocabulary.

Categories

Keywords

Reprint years

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,783

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

Relativized logspace and generalized quantifiers over finite ordered structures.Georg Gottlob - 1997 - Journal of Symbolic Logic 62 (2):545-574.
Henkin Quantifiers.M. Krynicki & M. Mostowski - 1995 - In M. Krynicki, M. Mostowski & L. Szczerba (eds.), Quantifiers: Logics, Models and Computation. Kluwer Academic Publishers. pp. 193--263.
Henkin Quantifiers and Complete Problems.Andreas Blass & Yuri Gurevich - 1986 - Annals of Pure and Applied Logic 32:1--16.
Ways of branching quantifers.Gila Sher - 1990 - Linguistics and Philosophy 13 (4):393 - 422.
Henkin quantifiers and the definability of truth.Tapani Hyttinen & Gabriel Sandu - 2000 - Journal of Philosophical Logic 29 (5):507-527.
Quantifiers, some Problems and Ideas.M. Krynicki & M. Mostowski - 1995 - In M. Krynicki, M. Mostowski & L. Szczerba (eds.), Quantifiers: Logics, Models and Computation. Kluwer Academic Publishers. pp. 1--21.
Quantifiers in Questions.Manfred Krifka - 2003 - Korean Journal of English Language and Linguistics 3:499-526.
A Computational Approach to Quantifiers as an Explanation for Some Language Impairments in Schizophrenia.Marcin Zajenkowski, Rafał Styła & Jakub Szymanik - 2011 - Journal of Communication Disorder 44:2011.
Quantifiers Definable by Second Order Means.M. Mostowski - 1995 - In M. Krynicki, M. Mostowski & L. Szczerba (eds.), Quantifiers: Logics, Models and Computation. Kluwer Academic Publishers. pp. 181--214.
Computable quantifiers and logics over finite structures.J. Makowsky & Y. Pnueli - 1995 - In M. Krynicki, M. Mostowski & L. Szczerba (eds.), Quantifiers: Logics, Models and Computation. Kluwer Academic Publishers. pp. 313--357.
Self-commuting quantifiers.Dag Westerståhl - 1996 - Journal of Symbolic Logic 61 (1):212-224.
Almost All Complex Quantifiers are Simple.Jakub Szymanik - 2010 - In C. Ebert, G. Jäger, M. Kracht & J. Michaelis (eds.), Mathematics of Language 10/11, Lecture Notes in Computer Science 6149. Springer.
On the expressive power of monotone natural language quantifiers over finite models.Jouko Väänänen & Dag Westerståhl - 2002 - Journal of Philosophical Logic 31 (4):327-358.
Computational complexity of some Ramsey quantifiers in finite models.Marcin Mostowski & Jakub Szymanik - 2007 - Bulletin of Symbolic Logic 13:281--282.

Analytics

Added to PP
2013-02-16

Downloads
157 (#121,024)

6 months
4 (#783,478)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Joanna Golinska-Pilarek
University of Warsaw

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references