The expressiveness of looping terms in the semantic programming
S Goncharov, S Ospichev, D Ponomaryov… - arXiv preprint arXiv …, 2019 - arxiv.org
S Goncharov, S Ospichev, D Ponomaryov, D Sviridenko
arXiv preprint arXiv:1912.02731, 2019•arxiv.orgWe consider the language of $\Delta_0 $-formulas with list terms interpreted over
hereditarily finite list superstructures. We study the complexity of reasoning in extensions of
the language of $\Delta_0 $-formulas with non-standard list terms, which represent bounded
list search, bounded iteration, and bounded recursion. We prove a number of results on the
complexity of model checking and satisfiability for these formulas. In particular, we show that
the set of $\Delta_0 $-formulas with bounded recursive terms true in a given list …
hereditarily finite list superstructures. We study the complexity of reasoning in extensions of
the language of $\Delta_0 $-formulas with non-standard list terms, which represent bounded
list search, bounded iteration, and bounded recursion. We prove a number of results on the
complexity of model checking and satisfiability for these formulas. In particular, we show that
the set of $\Delta_0 $-formulas with bounded recursive terms true in a given list …
We consider the language of -formulas with list terms interpreted over hereditarily finite list superstructures. We study the complexity of reasoning in extensions of the language of -formulas with non-standard list terms, which represent bounded list search, bounded iteration, and bounded recursion. We prove a number of results on the complexity of model checking and satisfiability for these formulas. In particular, we show that the set of -formulas with bounded recursive terms true in a given list superstructure is non-elementary (it contains the class kEXPTIME, for all ). For -formulas with restrictions on the usage of iterative and recursive terms, we show lower complexity.
arxiv.org
Showing the best result for this search. See all results
