Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
skip to main content
10.1109/SFCS.1989.63472guideproceedingsArticle/Chapter ViewAbstractPublication PagesConference Proceedingsacm-pubtype
Article

The 0-1 law fails for the class of existential second order Godel sentences with equality

Published: 30 October 1989 Publication History

Abstract

P. Kolaitis and M. Vardi (see Proc. 19th ACM Symp. on Theory of Computing, p.425-35 (1987), and Proc. 3rd Ann. Symp. on Logic in Computer Science, p.2-11 (1988)) proved that the 0-1 law holds for the second-order existential sentences whose first-order parts are formulas of Bernays-Schonfinkel or Ackermann prefix classes. They also provided several examples of second-order formulas for which the 0-1 law does not hold and noticed that the classification of second-order sentences for which the 0-1 law holds resembles the classification of decidable cases of prenex first-order sentences. The only cases they have not settled were the cases of Godel classes with and without equality. The authors confirm the conjecture of Kolaitis and Vardi that the 0-1 law does not hold for the existential second-order sentences whose first-order part is in the godel prenex form with equality.

Cited By

View all

Recommendations

Comments

Information & Contributors

Information

Published In

cover image Guide Proceedings
SFCS '89: Proceedings of the 30th Annual Symposium on Foundations of Computer Science
October 1989
586 pages
ISBN:0818619821

Publisher

IEEE Computer Society

United States

Publication History

Published: 30 October 1989

Author Tags

  1. 0-1 law
  2. Ackermann prefix classes
  3. Bernays-Schonfinkel
  4. decidable cases
  5. prenex first-order sentences
  6. second order Godel sentences

Qualifiers

  • Article

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)0
  • Downloads (Last 6 weeks)0
Reflects downloads up to 08 Feb 2025

Other Metrics

Citations

Cited By

View all
  • (2021)Zero-one laws for provability logicProceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science10.1109/LICS52264.2021.9470666(1-13)Online publication date: 29-Jun-2021
  • (2013)Random graphs and the parity quantifierJournal of the ACM10.1145/252840260:5(1-34)Online publication date: 28-Oct-2013
  • (2009)Random graphs and the parity quantifierProceedings of the forty-first annual ACM symposium on Theory of computing10.1145/1536414.1536510(705-714)Online publication date: 31-May-2009
  • (1994)A Note On Asymptotic Probabilities Of Existential Second-Order Minimal Classes - The Last StepFundamenta Informaticae10.5555/2383418.238341920:4(277-285)Online publication date: 1-Dec-1994

View Options

View options

Figures

Tables

Media

Share

Share

Share this Publication link

Share on social media