| |
| 2006 | ||
|---|---|---|
| 5 | EE | Anatoly Petrovich Beltiukov: A nonasymptotic lower time bound for a strictly bounded second-order arithmetic. Ann. Pure Appl. Logic 141(3): 320-324 (2006) |
| 2004 | ||
| 4 | EE | Anatoly Petrovich Beltiukov: A strong induction scheme that leads to polynomially computable realizations. Theor. Comput. Sci. 322(1): 17-39 (2004) |
| 2001 | ||
| 3 | Anatoly Petrovich Beltiukov: The set of the true regular protothetics formulas with partially ordered quantifiers is NEXPTIME-complete. Ann. Pure Appl. Logic 113(1-3): 53-58 (2001) | |
| 1997 | ||
| 2 | Anatoly Petrovich Beltiukov: Intuitionistic Formal Theories with Realizability in Subrecursive Classes. Ann. Pure Appl. Logic 89(1): 3-15 (1997) | |
| 1993 | ||
| 1 | Anatoly Petrovich Beltiukov: Automatical Synthesis of Programs with Recursions. Formal Methods in Programming and Their Applications 1993: 414-422 | |