Complexity of the Two-Variable Fragment with (Binary-Coded) Counting Quantifiers

Documenti analoghi

• Data-Complexity of the Two-Variable Fragment with Counting Quantifiers
  di: Pratt-Hartmann, Ian
  Pubblicazione: (2008)
• On the Complexity of the Numerically Definite Syllogistic and Related Fragments
  di: Pratt-Hartmann, Ian
  Pubblicazione: (2007)
• The Fluted Fragment with Transitive Relations
  di: Pratt-Hartmann, Ian, et al.
  Pubblicazione: (2020)
• A Note on the Complexity of the Satisfiability Problem for Graded Modal Logics
  di: Kazakov, Yevgeny, et al.
  Pubblicazione: (2009)
• Two-Level Type Theory and Applications
  di: Annenkov, Danil, et al.
  Pubblicazione: (2017)