Finite-model theory - a personal perspective

Theoretical Computer Science

Volumn 116, Issue 1, 1993, Pages 3-31

  Fagin, Ronald ^a  

^a IBM ALMADEN RESEARCH CENTER   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SCIENCE; LARGE SCALE SYSTEMS; MATHEMATICAL MODELS;

COMPLEXITY THEORY; FINITE-MODEL THEORY; INFINITE STRUCTURES; LOGICAL PROPERTIES; MATHEMATICAL STRUCTURE;

FORMAL LOGIC;

EID: 0027906178     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/0304-3975(93)90218-I     Document Type: Article

References (104)

1. Universality of data retrieval languages
2. 1-formulae on finite structures
3. Reachability is harder for directed than for undirected finite graphs
4. Monotone versus positive
5. DATALOG vs. first-order logic
6. Das Repräsentantenproblem im Prädikatenkalkül der ersten Stufe mit identität
7. Model-theoretic logics: background and aims
8. On spectra
9. A zero-one law for logic with a fixed point operator
10. Relativizing time space and time-space
11. An optimal lower bound on the number of variables for graph identification
12. Theory of database queries
13. Structure and complexity of relational queries
14. The intrinsic computational difficulty of functions
15. A logical approach to asymptotic combinatorics I: first-order properties
16. 0–1 laws in logic and combinatorics
17. Noncovergence, undecidability, and intractability in asymptotic problems
18. The complexity of theorem proving procedures
19. A hierarchy for nondeterministic time complexity
20. On the relativization of deterministic and nondeterministic complexity classes
21. Paths trees and flowers
22. An application of games to the completeness problem for formalized theories
23. Asymmetric graphs
24. Probabilities on finite models
25. Contributions to the model theory of finite structures
26. Generalized first-order spectra and polynomial-time recognizable sets
27. Monadic generalized spectra
28. A spectrum hierarchy
29. A two-cardinal characterization of double spectra
30. Probabilities on finite models
31. Horn clauses and database dependencies
32. On monadic NP vs. monadic co-NP
33. The theory of data dependencies: a survey
34. Sur quelques classifications des systems de relations
35. Parity, circuits, and the polynomial time hierarchy
36. Concerning measures in first-order calculi
37. Undecidable optimization problems for database logic programs
38. A simple proof that connectivity is not first-order
39. Some simplified NP-complete graph problems
40. Range and degree of realizability of formulas in the restricted predicate calculus
41. The Gödel class with equality is unsolvable
42. Complexity of the first-order theory of almost all structures
43. The decision problem for standard classes
44. Toward logic tailored for computational complexity
45. Logic and the challenge of computer science
46. On finite model theory
47. On finite model theory
48. Fixed-point extensions of first-order logic
49. On logics of discovery
50. Generalized quantifiers and finite sets
51. Sparse sets in NP-P—EXPTIME vs NEXPTIME
52. Number of quantifiers is better than number of tape cells
53. Upper and lower bounds for first-order expressibility
54. Relational queries computable in polynomial time
55. Languages that capture complexity classes
56. Nondeterministic space is closed under complement
57. Descriptive and computational complexity
58. Turing machines and the spectra of first-order formulas with equality
59. Universal relational systems
60. Elements of relational database theory
61. Reducibility among combinatorial problems
62. On random models of finite power and monadic logic
63. Implicit definability on finite structures and unambiguous computations
64. The decision problems for the probabilities of higher-order properties
65. 0–1 laws and decision problems for fragments of second-order logic
66. 0–1 laws for fragments of second-order logic
67. 0–1 laws for infinitary logics
68. Universal sorting problems
69. Universal sorting problems
70. The relational model for systems of automatic testing
71. Almost sure theories
72. Probabilities of first-order sentences about unary functions
73. Compactness, embeddings and definability
74. The 0–1 law fails for the class of existential second-order Gödel sentences with equality
75. Universal graphs and universal functions
76. Relationships between nondeterministic and deterministic tape complexities
77. Problem #1 Ein ungelóstes problem in der symbolischen logik
78. Zero-one laws for sparse random graphs
79. The method of forced enumeration for nondeterministic automata
80. A counterexample to a conjecture of Scott and Suppes
81. The asymptotic truth value of infinite formulas
82. The asymptotic truth value of infinite formulas
83. Contributions to the theory of models I, II
84. Impossibility of an algorithm for the decision problem in finite classes
85. On the definability of properties of finite graphs
86. Relative complexity of checking and evaluating
87. The complexity of relational query languages
88. On decomposition of relational databases
89. Sentences true in all constructive models
90. Relativization, reducibilities, and the exponential hierarchy