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 [Book Review]

Bulletin of Symbolic Logic 6 (3):355-356 (2000)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.2307/421066

Links

PhilArchive



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

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

How to define a linear order on finite models.Lauri Hella, Phokion G. Kolaitis & Kerkko Luosto - 1997 - Annals of Pure and Applied Logic 87 (3):241-267.
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.
Finite generation problem and n-ary quantifiers.Lauri Hella & Kerkko Luosto - 1995 - In M. Krynicki, M. Mostowski & L. Szczerba (eds.), Quantifiers: Logics, Models and Computation. Kluwer Academic Publishers. pp. 63--104.
Almost everywhere equivalence of logics in finite model theory.Lauri Hella, Phokion G. Kolaitis & Kerkko Luosto - 1996 - Bulletin of Symbolic Logic 2 (4):422-443.
The Expressive Power of Modal Dependence Logic.Lauri Hella, Kerkko Luosto, Katsuhiko Sano & Jonni Virtema - 2014 - In Rajeev Goré, Barteld Kooi & Agi Kurucz (eds.), Advances in Modal Logic, Volume 10. CSLI Publications. pp. 294-312.
The Beth-closure of l(qα) is not finitely generated.Lauri Hella & Kerkko Luosto - 1992 - Journal of Symbolic Logic 57 (2):442 - 448.
The hierarchy theorem for generalized quantifiers.Lauri Hella, Kerkko Luosto & Jouko Väänänen - 1996 - Journal of Symbolic Logic 61 (3):802-817.
The hierarchy theorem for generalized quantifiers.Lauri Hella, Kerkko Luosto & Jouko Väänänen - 1996 - Journal of Symbolic Logic 61 (3):802-817.
Normal forms for second-order logic over finite structures, and classification of NP optimization problems.Thomas Eiter, Georg Gottlob & Yuri Gurevich - 1996 - Annals of Pure and Applied Logic 78 (1-3):111-125.
The Beth-Closure of $mathscr{L}(Q_alpha)$ is Not Finitely Generated.Lauri Hella & Kerkko Luosto - 1992 - Journal of Symbolic Logic 57 (2):442-448.
Generalized quantifiers and pebble games on finite structures.Phokion G. Kolaitis & Jouko A. Väänänen - 1995 - Annals of Pure and Applied Logic 74 (1):23-75.
On Fraïssé’s conjecture for linear orders of finite Hausdorff rank.Alberto Marcone & Antonio Montalbán - 2009 - Annals of Pure and Applied Logic 160 (3):355-367.
Characterizing all models in infinite cardinalities.Lauri Keskinen - 2013 - Annals of Pure and Applied Logic 164 (3):230-250.
Review: Phokion G. Kolaitis, Jouko A. Vaananen, Generalized Quantifiers and Pebble Games on Finite Structures. [REVIEW]I. A. Stewart - 1996 - Journal of Symbolic Logic 61 (4):1387-1388.
Finite information logic.Rohit Parikh & Jouko Väänänen - 2005 - Annals of Pure and Applied Logic 134 (1):83-93.

Analytics

Added to PP
2014-03-26

Downloads
16 (#851,323)

6 months
2 (#1,136,865)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references