Hella, L., Kolaitis, PG and Luosto, K., How to define a linear

Annals of Pure and Applied Logic 87:269 (1997)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Links

PhilArchive



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

External links

  • This entry has no external links. Add one.
Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

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.
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.
The Beth-closure of l(qα) is not finitely generated.Lauri Hella & Kerkko Luosto - 1992 - Journal of Symbolic Logic 57 (2):442 - 448.
On Interpretability of Almost Linear Orderings.Akito Tsuboi & Kentaro Wakai - 1998 - Notre Dame Journal of Formal Logic 39 (3):325-331.
A recursion principle for linear orderings.Juha Oikkonen - 1992 - Journal of Symbolic Logic 57 (1):82-96.

Analytics

Added to PP
2014-03-24

Downloads
0

6 months
0

Historical graph of downloads

Sorry, there are not enough data points to plot this chart.
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