The 0-1 law fails for frame satisfiability of propositional modal logic

Proceedings - Symposium on Logic in Computer Science

Volumn , Issue , 2002, Pages 225-234

  Le Bars, Jean Marie ^a  

^a UNIVERSITÉ DE CAEN   (France)

Author keywords

Computational Complexity; Finite Model Theory; Modal and Temporal Logics

Indexed keywords

MODAL LOGICS; TEMPORAL LOGICS;

COMPUTATIONAL COMPLEXITY; GRAPH THEORY; PROBABILITY; THEOREM PROVING;

FORMAL LOGIC;

EID: 0036053446     PISSN: 10436871     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/LICS.2002.1029831     Document Type: Conference Paper

References (16)

1. The class of problems that are linearly equivalent to satisfiability or a uniform method for proving NP-completeness
2. On the evolution of random graphs
3. Generalized first-order spectra and polynomial time recognizable sets
4. Probabilities on finite models
5. Kernel on random graphs
6. Range and degree of realizability of formulas in the restricted predicate calculus
7. The modal logic of the countable random frame
8. Zero-one laws for modal logic
9. 0-1 laws and decisions problems for fragments of second-order logic
10. 0-1 laws for fragments of second-order logic: On overview
11. 0-1 laws for fragments of existential second-order logic: A survey
12. Fragments of existential second-order logic without 0-1 laws
13. Counterexamples of the 0-1 law for fragments of existential second-order logic: An overview
14. A counterexample to the 0-1 law for the class of existential second-order minimal Gödel sentences with equality
15. Almost all digraphs have a kernel