How to define a linear order on finite models

We describe on a systematic investigation of the definability of linear order on classes of finite rigid structures. We obtain upper and lower bounds for the expressibility of linear order in various logics that have been studied extensively in finite model theory such as fixpoint logic (FP), partial fixpoint logic (PFP), infinitary logic /spl Lscrsub /spl infin/wsup w/ with a finite number of variables, as well as the closures of these logics under implicit definitions. Moreover, we show that the upper and lower bounds established here can not be improved dramatically, unless outstanding conjectures in complexity theory are resolved at the same time.<<ETX>>

[1]  B. Heap.  THE PRODUCTION OF GRAPHS BY COMPUTER , 1972 .

[2]  Larry J. Stockmeyer,et al.  The Polynomial-Time Hierarchy , 1976, Theor. Comput. Sci..

[3]  Ronald Fagin,et al.  Probabilities on finite models , 1976, Journal of Symbolic Logic.

[4]  Leslie G. Valiant,et al.  Relative Complexity of Checking and Evaluating , 1976, Inf. Process. Lett..

[5]  Paul Erdös,et al.  Random Graph Isomorphism , 1980, SIAM J. Comput..

[6]  David Harel,et al.  Structure and Complexity of Relational Queries , 1980, FOCS.

[7]  Moshe Y. Vardi.  The complexity of relational query languages (Extended Abstract) , 1982, STOC '82.

[8]  Yuri Gurevich,et al.  Toward logic tailored for computational complexity , 1984 .

[9]  Neil Immerman,et al.  Relational Queries Computable in Polynomial Time , 1986, Inf. Control..

[10]  N. Immerman,et al.  Definability with Bounded Number of Bound Variables , 1989, Inf. Comput..

[11]  Neil Immerman,et al.  Languages that Capture Complexity Classes , 1987, SIAM J. Comput..

[12]  Neil Immerman,et al.  Descriptive and Computational Complexity , 1989, FCT.

[13]  S. Abiteboul,et al.  Fixpoint extensions of first-order logic and datalog-like languages , 1989, [1989] Proceedings. Fourth Annual Symposium on Logic in Computer Science.

[14]  Daniel Leivant,et al.  Descriptive Characterizations of Computational Complexity , 1989, J. Comput. Syst. Sci..

[15]  Phokion G. Kolaitis.  Implicit definability on finite structures and unambiguous computations , 1990, [1990] Proceedings. Fifth Annual IEEE Symposium on Logic in Computer Science.

[16]  Serge Abiteboul,et al.  Generic Computation and its complexity , 1991, STOC '91.

[17]  Phokion G. Kolaitis,et al.  Fixpoint logic vs. infinitary logic in finite-model theory , 1992, [1992] Proceedings of the Seventh Annual IEEE Symposium on Logic in Computer Science.

[18]  Phokion G. Kolaitis,et al.  Infinitary Logics and 0-1 Laws , 1992, Inf. Comput..

[19]  Alexei P. Stolboushkin.  Axiomatizable classes of finite models and definability of linear order , 1992, [1992] Proceedings of the Seventh Annual IEEE Symposium on Logic in Computer Science.

[20]  Martin Otto,et al.  Inductive Definability with Counting on Finite Structures , 1992, CSL.

[21]  Jacobo Torán,et al.  The graph isomorphism problem , 2020, Commun. ACM.

[22]  Finite variable logics , 1993, Bull. EATCS.

[23]  A. Dawar.  Feasible computation through model theory , 1993 .

[24]  A. Dawar,et al.  Infinitary Logic and Inductive Definability over Finite Structures , 1995, Inf. Comput..