Journal of Symbolic Logic 56 (2):385-424 (1991)
We present a survey of proof theory in the USSR beginning with the paper by Kolmogorov  and ending (mostly) in 1969; the last two sections deal with work done by A. A. Markov and N. A. Shanin in the early seventies, providing a kind of effective interpretation of negative arithmetic formulas. The material is arranged in chronological order and subdivided according to topics of investigation. The exposition is more detailed when the work is little known in the West or the original presentation can be improved using notions or results which appeared later. This includes such topics as Novikov's cut-elimination method (regular formulas) and Maslov's inverse method for the predicate logic
|Keywords||No keywords specified (fix it)|
|Categories||categorize this paper)|
References found in this work BETA
Выводимость некоторых реализуемых формул исчисления высказываний.Ф Кабаков - 1963 - Mathematical Logic Quarterly 9 (7):97-104.
Citations of this work BETA
Minimal From Classical Proofs.Helmut Schwichtenberg & Christoph Senjak - 2013 - Annals of Pure and Applied Logic 164 (6):740-748.
2005–06 Winter Meeting of the Association for Symbolic Logic.Haim Gaifman - 2006 - Bulletin of Symbolic Logic 12 (3):503-516.
Similar books and articles
Relation Algebra Reducts of Cylindric Algebras and an Application to Proof Theory.Robin Hirsch, Ian Hodkinson & Roger D. Maddux - 2002 - Journal of Symbolic Logic 67 (1):197-213.
Interpolation Theorems, Lower Bounds for Proof Systems, and Independence Results for Bounded Arithmetic.Jan Krajíček - 1997 - Journal of Symbolic Logic 62 (2):457-486.
Proof Theory: A Selection of Papers From the Leeds Proof Theory Programme, 1990.Peter Aczel, Harold Simmons & S. S. Wainer (eds.) - 1992 - Cambridge University Press.
Bounded Arithmetic, Propositional Logic, and Complexity Theory.Jan Krajíček - 1995 - Cambridge University Press.
A Proof-Theoretic Study of the Correspondence of Classical Logic and Modal Logic.H. Kushida & M. Okada - 2003 - Journal of Symbolic Logic 68 (4):1403-1414.
The Definability of the Set of Natural Numbers in the 1925 Principia Mathematica.Gregory Landini - 1996 - Journal of Philosophical Logic 25 (6):597 - 615.
Cut-Elimination for Simple Type Theory with an Axiom of Choice.G. Mints - 1999 - Journal of Symbolic Logic 64 (2):479-485.
Added to index2009-01-28
Total downloads32 ( #157,010 of 2,154,092 )
Recent downloads (6 months)1 ( #398,005 of 2,154,092 )
How can I increase my downloads?