A zero-one law for logic with a fixed-point operator
Information and Control
Relational queries computable in polynomial time
Information and Control
Journal of the ACM (JACM)
Universality of data retrieval languages
POPL '79 Proceedings of the 6th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
The complexity of relational query languages (Extended Abstract)
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
Languages which capture complexity classes
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
Optimization, approximation, and complexity classes
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Queries are easier than you thought (probably)
PODS '92 Proceedings of the eleventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Monotone monadic SNP and constraint satisfaction
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Proof verification and the hardness of approximation problems
Journal of the ACM (JACM)
0-1 Laws for Fragments of Existential Second-Order Logic: A Survey
MFCS '00 Proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science
Constraint Satisfaction Problems in Non-deterministic Logarithmic Space
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
More about recursive structures: descriptive complexity and zero-one laws
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
On the expressive power of variable-confined logics
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
Complete and incomplete randomized NP problems
SFCS '87 Proceedings of the 28th Annual Symposium on Foundations of Computer Science
Partially Ordered Connectives and Monadic Monotone Strict NP
Journal of Logic, Language and Information
A Logical Approach to Constraint Satisfaction
Complexity of Constraints
Random graphs and the parity quantifier
Proceedings of the forty-first annual ACM symposium on Theory of computing
Decidable relationships between consistency notions for constraint satisfaction problems
CSL'09/EACSL'09 Proceedings of the 23rd CSL international conference and 18th EACSL Annual conference on Computer science logic
On the CSP dichotomy conjecture
CSR'11 Proceedings of the 6th international conference on Computer science: theory and applications
A note on the testability of ramsey's class
TAMC'10 Proceedings of the 7th annual conference on Theory and Applications of Models of Computation
On moderately exponential time for SAT
SAT'10 Proceedings of the 13th international conference on Theory and Applications of Satisfiability Testing
Testable and untestable classes of first-order formulae
Journal of Computer and System Sciences
A Note On Asymptotic Probabilities Of Existential Second-Order Minimal Classes - The Last Step
Fundamenta Informaticae
Random graphs and the parity quantifier
Journal of the ACM (JACM)
Hi-index | 0.00 |
The probability of a property on the class of all finite relational structures is the limit as n → ∞ of the fraction of structures with n elements satisfying the property, provided the limit exists. It is known that 0-1 laws hold for any property expressible in first-order logic or in fixpoint logic, i.e. the probability of any such property exists and is either 0 or 1. It is also known that the associated decision problem for the probabilities is PSPACE-complete and EXPTIME-complete for first-order logic and fixpoint logic respectively. The 0-1 law fails, however, in general for second-order properties and the decision problem becomes unsolvable.We investigate here logics which on the one hand go beyond fixpoint in terms of expressive power and on the other possess the 0-1 law. We consider first iterative logic which is obtained from first order logic by adding while looping as a construct. We show that the 0-1 law holds for this logic and determine the complexity of the associated decision problem. After this we study a fragment of second order logic called strict &Sgr;11. This class of properties is obtained by restricting appropriately the first-order part of existential second-order sentences. Every strict &Sgr;11 property is NP-computable and there are strict &Sgr;11 properties that are NP-complete, such as 3-colorability. We show that the 0-1 law holds for strict &Sgr;11 properties and establish that the associated decision problem is NEXPTIME-complete. The proofs of the decidability and complexity results require certain combinatorial machinery, namely generalizations of Ramsey's Theorem.