Keywords
Predicate Formula
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Preview
Unable to display preview. Download preview PDF.
Literature cited
- 1.S. C. Kleene, “On the interpretation of intuitionistic number theory,” J. Symbolic Logic,10, 109–124 (1945).Google Scholar
- 2.S. C. Kleene, Introduction to Metamathematics, Van Nostrand, New York (1952).Google Scholar
- 3.S. C. Kleene, “Logical calculus and realizability,” Acta Philos. Fenn.,18, 71–80 (1965).Google Scholar
- 4.B. A. Trakhtenbrot, “On recursive separability,” Dokl. Akad. Nauk SSSR,88, No. 6, 953–956 (1953).Google Scholar
- 5.D. Nelson, “Recursive functions and intuitionistic number theory,” Trans. Amer. Math. Soc.,61, 307–368 (1947).Google Scholar
- 6.M. M. Kipnis, “The constructive classification of arithmetic predicates and the semantic bases of arithmetic,” Seminars in Mathematics, Vol. 8, Consultants Bureau, New York (1970), pp. 22–27.Google Scholar
- 7.S. C. Kleene, “Recursive predicates and quantifiers,” Trans. Amer. Math. Soc.,53, 41–73 (1943).Google Scholar
- 8.M. M. Kipnis, “A property of propositional formulas,” Dokl. Akad. Nauk SSSR,174, No. 2, 277–278 (1967).Google Scholar
- 9.G. S. Tseitin, “The disjunctive rank of formulas in constructive arithmetic,” Seminars in Mathematics, Vol. 8, Consultants Bureau, New York (1970), pp. 126–132.Google Scholar
- 10.G. F. Rose, “Propositional calculus and realizability,” Trans. Amer. Math. Soc.,75, 1–19 (1953).Google Scholar
- 11.V. A. Yankov, “On realizable propositional formulas,” Dokl. Akad. Nauk SSSR,151, No. 5, 1035–1037 (1963).Google Scholar
Copyright information
© Consultants Bureau 1972