## Abstract

Systems are understood to be logical or mathematical logic calculi based on predicate calculus (classical or constructive). An operator 9 revising a formula of the system S_{1} into a formula of the system S_{2}, is called an imbedding operator from S_{1} into S_{2} (see [1]) if for each formula A of the system S_{1} the deducibility of the formula A in S_{1} is equivalent to the deducibility of φ(A)in S_{2} If every formula of the system S_{1} is a formula of the system S_{2} then the imbedding operator φ from S_{1} into S_{2} is called regular (see [1]) if for any formula A of the system S_{1} the formula A ⊃ φ(A) is deducible in S_{2} (when all the formulas deducible in S_{2} are true in a certain interpretation, there results from the regularity of the imbedding operator that it transforms a true formula into a true formula).

## Keywords

Predicate Calculus Recursive Function Axiom Schema Positive Entry Arithmetic Formula## Preview

Unable to display preview. Download preview PDF.

## Literature Cited

- 1.Shanin, N. A., “On some logical problems of arithmetic,” Trudy Steklov Mat. Inst. Akad. Nauk SSSR, Vol. 43, 1955.Google Scholar
- 2.Mal’tsev, A. I., Algorithms and Recursive Functions (in Russian), Moscow, 1965.Google Scholar
- 3.Harrop, R., “Concerning formulas of the types A → B V C, A→Ǝ x B (x) in intuitionistic formal systems,” J. Symb. Logic, 25(l):27–32 (1960).Google Scholar
- 4.Mints, G. E. and Orevkov, V. P., “Extension of a theorem of V. I. Glivenko and G. Kreisel to a class of formulas of predicate calculus,” Doklady Akad. Nauk SSSR, 152(3):553–554 (1963).Google Scholar