A zero-one law for logic with a fixed-point operator
Information and Control
Relational queries computable in polynomial time
Information and Control
The decision problem for the probabilities of higher-order properties
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
0-1 laws and decision problems for fragments of second-order logic
Information and Computation - Selections from 1988 IEEE symposium on logic in computer science
Generic Computation and its complexity
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Hamiltonian paths in infinite graphs
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
On the strength of Ko¨nig's duality theorem for infinite bipartite graphs
Journal of Combinatorial Theory Series B
Completeness results for recursive data bases
PODS '93 Proceedings of the twelfth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Finite-model theory—a personal perspective
ICDT Selected papers of the 4th international conference on Database theory
Infinitary logics and 0–1 laws
Information and Computation - Special issue: Selections from 1990 IEEE symposium on logic in computer science
Finitely representable databases (extended abstract)
PODS '94 Proceedings of the thirteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Computing with first-order logic
Selected papers of the 23rd annual ACM symposium on Theory of computing
On a monadic NP vs monadic co-NP
Information and Computation
Foundations of Databases: The Logical Level
Foundations of Databases: The Logical Level
The complexity of relational query languages (Extended Abstract)
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
Elementary induction on abstract structures (Studies in logic and the foundations of mathematics)
Elementary induction on abstract structures (Studies in logic and the foundations of mathematics)
On decomposition of relational databases
SFCS '82 Proceedings of the 23rd Annual Symposium on Foundations of Computer Science
LICS '00 Proceedings of the 15th Annual IEEE Symposium on Logic in Computer Science
| Hi-index | 0.00 |
This paper continues our work on infinite, recursive structures. We investigate the descriptive complexity of several logics over recursive structures, including first-order, second-order, and fixpoint logic, exhibiting connections between expressibility of a property and its computational complexity. We then address 0-1 laws, proposing a version that applies to recursive structures and using it to prove several non-expressibility results.