Hostname: page-component-5cf477f64f-n7lw4 Total loading time: 0 Render date: 2025-04-05T18:26:32.172Z Has data issue: false hasContentIssue false
  • English
  • Français

IN MEMORIAM: GRIGORI E. MINTS 1939–2014

Published online by Cambridge University Press:  09 April 2015

Solomon Feferman  and
Vladimir Lifschitz
Rights & Permissions [Opens in a new window]

Abstract

An abstract is not available for this content so a preview has been provided. As you have access to this content, a full PDF is available via the ‘Save PDF’ action button.
Image of the first page of this content. For PDF version, please use the ‘Save PDF’ preceeding this image.'
Type
In Memoriam
Information
Bulletin of Symbolic Logic , Volume 21 , Issue 1 , March 2015 , pp. 31 - 33
Copyright
Copyright © The Association for Symbolic Logic 2015 

References

CITED WRITINGS OF GRIGORI E. MINTS

[1965] On predicate and operator variants of the formation of theories of constructive mathematics. Translations of the American Mathematical Society, vol. 100, pp. 1–68.Google Scholar
[1980] What can be done in PRA?, Journal of Soviet Mathematics, vol. 14, pp. 1487–1494.Google Scholar
[1991] Proof theory in the USSR: 1925-1969, The Journal of Symbolic Logic, vol. 56, pp. 385–424.Google Scholar
[1992] Selected papers in proof theory, Bibliopolis, Naples, and North-Holland, Amsterdam.Google Scholar
[1992a] A short introduction to modal logic, Center for the Study of Language and Information, Stanford.Google Scholar
[1994] Gentzen-type systems and Hilbert’s epsilon substitution method. I, Logic, Methodology and Philosophy of Science IX (D. Prawitz, et al., editors), Elsevier, Amsterdam, pp. 91–122.Google Scholar
[1998] Normal deduction in the intuitionistic linear logic, Archive for Mathematical Logic, vol. 37, pp. 415–426.Google Scholar
[1998a] Linear lambda-terms and natural deduction. Studia Logica, vol. 60, pp. 209–231.Google Scholar
[2000] A short introduction to intuitionistic logic, Kluwer Academic/Plenum Publishers, New York.Google Scholar
[2005] Dynamic topological logic (with P. Kremer). Annals of Pure and Applied Logic, vol. 133, pp. 231–246.Google Scholar
[2008] Cut elimination for a simple formulation of epsilon calculus. Annals of Pure and Applied Logic, vol. 152, pp. 148–160.Google Scholar
[2012] Non-deterministic epsilon substitution for ID 1: Effective proof, Logic, Construction, Computation (U. Berger et al., editors), Ontos Verlag, Frankfurt, pp. 325–342.CrossRefGoogle Scholar
[2012a] History of the Leningrad (St. Petersburg) school of constructive mathematics and proof theory (with S. I. Nikolenko), Logic in Central Europe and Eastern Europe: History, science and discourse (A. Schumann, editor), Rowman & Littlefield Publishers, Latham, MD. pp. 381–388.Google Scholar
[2013] Epsilon substitution for first- and second-order predicate logic. Annals of Pure and Applied Logic, vol. 164, pp. 733–739.Google Scholar