Zobrazeno 1 - 2
of 2
pro vyhledávání: '"Ospichev, Sergey"'
Publikováno v:
Aspects of Computation and Automata Theory with Applications. Lect. Notes Ser., Inst. Math. Sci., Natl. Univ. Singapore, vol. 42 (2023), pp. 97-114
A numbering of a countable family $S$ is a surjective map from the set of natural numbers $\omega$ onto $S$. A numbering $\nu$ is reducible to a numbering $\mu$ if there is an effective procedure which given a $\nu$-index of an object from $S$, compu
Externí odkaz:
http://arxiv.org/abs/1912.05226
We 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 r
Externí odkaz:
http://arxiv.org/abs/1912.02731