The Finite Satisfiability Problem for Two-Variable, First-Order Logic with one Transitive Relation is Decidable

Documenti analoghi

• A Note on the Complexity of the Satisfiability Problem for Graded Modal Logics
  di: Kazakov, Yevgeny, et al.
  Pubblicazione: (2009)
• Complexity of the Guarded Two-Variable Fragment with Counting Quantifiers
  di: Pratt-Hartmann, Ian
  Pubblicazione: (2006)
• Finite Satisfiability of the Two-Variable Guarded Fragment with Transitive Guards and Related Variants
  di: Kieronski, Emanuel, et al.
  Pubblicazione: (2016)
• Complexity of the Two-Variable Fragment with (Binary-Coded) Counting Quantifiers
  di: Pratt-Hartmann, Ian
  Pubblicazione: (2004)
• On the Satisfiability of Local First-Order Logics with Data
  di: Bollig, Benedikt, et al.
  Pubblicazione: (2023)