RUS  ENG
Full version
JOURNALS // Vestnik TVGU. Seriya: Prikladnaya Matematika [Herald of Tver State University. Series: Applied Mathematics] // Archive

Vestnik TVGU. Ser. Prikl. Matem. [Herald of Tver State University. Ser. Appl. Math.], 2008, Issue 9, Pages 39–51 (Mi vtpmk374)

This article is cited in 1 paper

Mathematical Foundations of Computer Science

The solvability of the theory $ T_f = \ Th (\ omega, 0, 1, <, +, f (x), F (x)) $

A. S. Snyatkov

Tver State University, Tver

Abstract: In the paper we generalize the result which was established in our previous article. We demonstrate the theory $T_f=\ Th(\omega, 0, 1, <, +, f(x), F(x))$ is decidable and every formula is equivalent to an existential one, if $f$ is an effectively addition-connected function, and $F$ is the effectively periodic hyperfunction for $f$.

Keywords: Semenov's arithmetic, hyperfunction, effectively periodic hyperfunction, addition-connected function.

UDC: 510.665

Received: 14.04.2008
Revised: 30.05.2008



Bibliographic databases:


© Steklov Math. Inst. of RAS, 2024