Corpus ID: 760662

On Generalizing Decidable Standard Prefix Classes of First-Order Logic

@article{Voigt2017OnGD,
  title={On Generalizing Decidable Standard Prefix Classes of First-Order Logic},
  author={Marco Voigt},
  journal={ArXiv},
  year={2017},
  volume={abs/1706.03949}
}
  • Marco Voigt
  • Published 2017
  • Mathematics, Computer Science
  • ArXiv
Recently, the separated fragment (SF) of first-order logic has been introduced. Its defining principle is that universally and existentially quantified variables may not occur together in atoms. SF properly generalizes both the Bernays-Schonfinkel-Ramsey (BSR) fragment and the relational monadic fragment. In this paper the restrictions on variable occurrences in SF sentences are relaxed such that universally and existentially quantified variables may occur together in the same atom under… Expand
1 Citations

References

SHOWING 1-10 OF 20 REFERENCES
Deciding First-Order Satisfiability when Universal and Existential Variables are Separated
  • 13
  • PDF
Binding Forms in First-Order Logic
  • 8
  • PDF
Complexity and Expressivity of Uniform One-Dimensional Fragment with Equality
  • 19
  • PDF
Ordered Paramodulation and Resolution as Decision Procedure
  • 27
  • Highly Influential
Satisfiability of formulae with one ∀ is decidable in exponential time
  • E. Grädel
  • Mathematics, Computer Science
  • Arch. Math. Log.
  • 1990
  • 6
The decision problem for the logic of predicates and of operations
  • 33
  • PDF
Computability and logic
  • 807
Resolution Theorem Proving
  • 450
The decision problem: Solvable classes of quantificational formulas
  • 197
  • PDF
The Classical Decision Problem
  • 836
  • PDF
...
1
2
...