Metafinite Model Theory

Motivated by computer science challenges, we suggest to extend the approach and methods of finite model theory beyond finite structures.

[1]  Martin Otto,et al.  The expressive power of fixed-point logic with counting , 1996, Journal of Symbolic Logic.

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

[3]  K. Jon Barwise,et al.  On Moschovakis closure ordinals , 1977, Journal of Symbolic Logic.

[4]  Jianwen Su,et al.  Finitely representable databases (extended abstract) , 1994, PODS '94.

[5]  David Harel,et al.  Completeness Results for Recursive Data Bases , 1996, J. Comput. Syst. Sci..

[6]  James P. Jones,et al.  Register Machine Proof of the Theorem on Exponential Diophantine Representation of Enumerable Sets , 1984, J. Symb. Log..

[7]  Pierre Wolper,et al.  Handling Infinite Temporal Data , 1995, J. Comput. Syst. Sci..

[8]  K. Compton.  Laws in Logic and Combinatorics , 1989 .

[9]  Egon Börger.  Specification and validation methods , 1995 .

[10]  Bernard R. Hodgson,et al.  A Normal Form for Arithmetical Representation of NP-Sets , 1983, J. Comput. Syst. Sci..

[11]  Leonard M. Adleman,et al.  Diophantine complexity , 1976, 17th Annual Symposium on Foundations of Computer Science (sfcs 1976).

[12]  Yuri Matiyasevich,et al.  Hilbert’s tenth problem , 2019, 100 Years of Math Milestones.

[13]  David P. Dobkin,et al.  Determining the Mode , 1980, Theor. Comput. Sci..

[14]  Erich Grädel,et al.  0-1 laws for recursive structures , 1999, Arch. Math. Log..

[15]  Mihalis Yannakakis,et al.  Optimization, approximation, and complexity classes , 1991, STOC '88.

[16]  E. Lander,et al.  Describing Graphs: A First-Order Approach to Graph Canonization , 1990 .

[17]  Leslie G. Valiant,et al.  The Complexity of Enumeration and Reliability Problems , 1979, SIAM J. Comput..

[18]  Bruno Poizat.  Deux Ou Trois Choses Que je Sais de Ln , 1982, J. Symb. Log..

[19]  Yuri Gurevich,et al.  Evolving algebras 1993: Lipari guide , 1995, Specification and validation methods.

[20]  Carsten Lund,et al.  Proof verification and hardness of approximation problems , 1992, Proceedings., 33rd Annual Symposium on Foundations of Computer Science.

[21]  Saharon Shelah,et al.  Fixed-point extensions of first-order logic , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).

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

[23]  Gabriel M. Kuper,et al.  Constraint Query Languages , 1995, J. Comput. Syst. Sci..

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

[25]  Michel de Rougemont,et al.  The Reliability of Queries. , 1995, ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems.

[26]  Ronald Fagin,et al.  Finite-Model Theory - A Personal Perspective , 1990, Theor. Comput. Sci..

[27]  Neil Immerman.  Upper and lower bounds for first order expressibility , 1980, 21st Annual Symposium on Foundations of Computer Science (sfcs 1980).

[28]  Serge Abiteboul,et al.  Foundations of Databases , 1994 .

[29]  Yuri Gurevich,et al.  The Classical Decision Problem , 1997, Perspectives in Mathematical Logic.

[30]  Leonard M. Adleman,et al.  Computational complexity of decision procedures for polynomials , 1975, 16th Annual Symposium on Foundations of Computer Science (sfcs 1975).

[31]  Martin Otto,et al.  Generalized quantifiers for simple properties , 1994, Proceedings Ninth Annual IEEE Symposium on Logic in Computer Science.

[32]  S. Smale,et al.  On a theory of computation and complexity over the real numbers; np-completeness , 1989 .

[33]  Neil Immerman,et al.  An optimal lower bound on the number of variables for graph identification , 1989, 30th Annual Symposium on Foundations of Computer Science.

[34]  Joel Spencer.  Nonconvergence in the theory of random orders , 1990 .

[35]  David Harel,et al.  Computable Queries for Relational Data Bases , 1980, J. Comput. Syst. Sci..

[36]  J. Van Leeuwen,et al.  Handbook of theoretical computer science - Part A: Algorithms and complexity; Part B: Formal models and semantics , 1990 .

[37]  Jörg Flum,et al.  Finite model theory , 1995, Perspectives in Mathematical Logic.

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

[39]  Klaus Meer,et al.  Descriptive complexity theory over the real numbers , 1995, STOC '95.

[40]  A. P. Stolboushkin.  Towards Recursive Model Theory , 1998 .

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

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

[43]  Paris C. Kanellakis,et al.  Elements of Relational Database Theory , 1991, Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics.

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

[45]  Neil Immerman,et al.  Expressibility as a complexity measure: results and directions , 1987, SCT.

[46]  Saharon Shelah,et al.  Nonconvergence, undecidability, and intractability in asymptotic problems , 1987, Ann. Pure Appl. Log..

[47]  Jianwen Su,et al.  Finitely Representable Databases , 1997, J. Comput. Syst. Sci..

[48]  J. Lynch.  Almost sure theories , 1980 .

[49]  Pierre Wolper,et al.  Handling infinite temporal data , 1990, PODS.

[50]  Gabriel M. Kuper,et al.  Constraint query languages (preliminary report) , 1990, PODS '90.

[51]  Saharon Shelah.  Very weak zero one law for random graphs with order and random binary functions , 1996 .

[52]  Bernard R. Hodgson,et al.  An Arithmetical Characterization of NP , 1982, Theor. Comput. Sci..