Quantifier-free and one-quantifier systems-Reference-Cited by-同舟云学术

Quantifier-free and one-quantifier systems

Published:1972 Issue:1 Volume:1 Page:71-84
ISSN:0090-4104
Container-title:Journal of Soviet Mathematics
language:en
Short-container-title:J Math Sci

Author:

Mints G. E.

Publisher

Springer Science and Business Media LLC

Subject

Applied Mathematics,General Mathematics,Statistics and Probability,Applied Mathematics,General Mathematics,Statistics and Probability

Link

http://link.springer.com/content/pdf/10.1007/BF01117472.pdf

Reference7 articles.

1. G. E. Mints, ?Precise estimates of the probability of transfinite induction in initial segments of arithmetic,? Zapiski Nauchnykh Seminarov Leningradskogo Otdeleniya Matematicheskogo Instituta im. V. A. Steklova Akademii Nauk SSSR,20, (1971), pp. 134?144.

2. G. Kreisel and A. Levy, ?Reflection principles and their use,? Z. Math. Logik und Grundl. Math.,14, No. 2, 97?142 (1968).

3. G. Gentzen, A new concept of proof for pure number theory [Russian translation], in: Mathematical Theory of Logical Deduction, Moscow (1967), pp. 154?190.

4. S. C. Kleene, Introduction to Metamathematics, Van Nostrand, New York (1952).

5. Yu. V. Matiyasevich, The Diophantine property of enumerable sets, Dokl. Akad. Nauk SSSR,191, No. 2, 179?282 (1970).

Cited by 21 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Finitism, Imperative Programs and Primitive Recursion;Logical Foundations of Computer Science;2019-12-20

2. Provability and Interpretability Logics with Restricted Realizations;Notre Dame Journal of Formal Logic;2012-01-01

3. UNFOLDING FINITIST ARITHMETIC;The Review of Symbolic Logic;2010-08-11

4. Consistency statements and iterations of computable functions in IΣ1 and PRA;Archive for Mathematical Logic;2010-07-16

5. Primitive recursive selection functions for existential assertions over abstract algebras;The Journal of Logic and Algebraic Programming;2008-07