Definability hierarchies of general quantifiers

Annals of Pure and Applied Logic 43 (3):235 (1989)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1016/0168-0072(89)90070-5

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 93,031

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

Lauri Hella, Phokion G. Kolaitis, and Kerkko Luosto. How to define a linear order on finite models. Annals of pure and applied logic, vol. 87 , pp. 241–267. [REVIEW]M. Otto - 2000 - Bulletin of Symbolic Logic 6 (3):355-356.
Hella, L., Kolaitis, PG and Luosto, K., How to define a linear.C. J. Ash, J. F. Knight, B. Balcar, T. Jech, J. Zapletal & D. Rubric - 1997 - Annals of Pure and Applied Logic 87:269.
Infinite combinatorics and definability.Arnold W. Miller - 1989 - Annals of Pure and Applied Logic 41 (2):179-203.
The definability of E in self-iterable mice.Farmer Schlutzenberg - 2023 - Annals of Pure and Applied Logic 174 (2):103208.
First-order definability on finite structures.M. Ajtai - 1989 - Annals of Pure and Applied Logic 45 (3):211-225.
On the definability of mad families of vector spaces.Haim Horowitz & Saharon Shelah - 2022 - Annals of Pure and Applied Logic 173 (4):103079.
Effective topological spaces I: A definability theory.Iraj Kalantari & Galen Weitkamp - 1985 - Annals of Pure and Applied Logic 29 (1):1-27.
Effective topological spaces III: Forcing and definability.Iraj Kalantari & Galen Weitkamp - 1987 - Annals of Pure and Applied Logic 36:17-27.
Frame definability in finitely valued modal logics.Guillermo Badia, Xavier Caicedo & Carles Noguera - 2023 - Annals of Pure and Applied Logic 174 (7):103273.
Henkin and function quantifiers.Michael Krynicki & Jouko Väänänen - 1989 - Annals of Pure and Applied Logic 43 (3):273-292.

Analytics

Added to PP
2014-01-16

Downloads
18 (#858,958)

6 months
5 (#711,375)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Henkin and function quantifiers.Michael Krynicki & Jouko Väänänen - 1989 - Annals of Pure and Applied Logic 43 (3):273-292.
Automata presenting structures: A survey of the finite string case.Sasha Rubin - 2008 - Bulletin of Symbolic Logic 14 (2):169-209.
Definability of polyadic lifts of generalized quantifiers.Lauri Hella, Jouko Väänänen & Dag Westerståhl - 1997 - Journal of Logic, Language and Information 6 (3):305-335.

View all 21 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.

View all 23 references / Add more references