• Corpus ID: 243938355

Complexity of the Ackermann fragment with one leading existential quantifier

@article{Jaakkola2021ComplexityOT,
  title={Complexity of the Ackermann fragment with one leading existential quantifier},
  author={Reijo Jaakkola},
  journal={ArXiv},
  year={2021},
  volume={abs/2111.05388}
}
We prove that the satisfiability problem of the Ackermann fragment with one leading existential quantifier is ExpTime-complete. 

References

SHOWING 1-6 OF 6 REFERENCES

Decidability of a portion of the predicate calculus

We show decidability of the existence of a model (a finite model) for sentences with the string of quantifiers ∀x(∃y1...yn), for a language with equality, one one-place function, predicates and

0-1 laws and decision problems for fragments of second-order logic

The Classical Decision Problem

The Undecidable Standard Classes for Pure Predicate Logic, a Treatise on the Transformation of the Classical Decision Problem, and some Results and Open Problems are presented.

THE CLASSICAL DECISION PROBLEM (Perspectives in Mathematical Logic) By Egon Börger, Erich Grädel and Yuri Gurevich: 482 pp., DM.158.–, ISBN 3 540 57073 X (Springer, 1997).

This year saw the development of both the Go$ del–Herbrand–Kleene theory of recursive functions and, independently, the equivalent notion of machine computable sets of words by Turing.

Kozen , and Larry J . Stockmeyer . Alternation

  • 1981

Alternation and the ackermann case of the decision problem

  • L’Enseignement Math,
  • 1981