Grigori Mints was a Russian philosopher and mathematician who worked in mathematical logic. He was born in Leningrad, in the Soviet Union, and received his Ph.D. in 1965 from the Leningrad State University under Nikolai Aleksandrovich Shanin with a thesis entitled "On Predicate and Operator Variants for Building Theories of Constructive Mathematics". In 1990 he received his D.Sc. from Leningrad State University with a thesis entitled "Proof Transformations and Synthesis of Programs". He was a Stanford Universityprofessor. Since 1991, Grigori "Grisha" Mints was a professor of philosophy and, by courtesy, of mathematics and of computer science at Stanford University. Before joining Stanford, Mints held research positions at the Steklov Mathematical Institute, the Leningrad University and the Estonian Academy of Sciences. Considered one of the most distinguished logicians in the world, Mints was passionate about the applications of logic to philosophy. His expertise was in proof theory – the analysis of the structure of mathematical reasoning. Mints was elected to the Estonian Academy of Sciences in 2008 and to the American Academy of Arts and Sciences in 2010. Mints was a very active member of the steering committee of the WoLLIC series of workshops on logic and language, after having been a member of the community in several capacities such as invited speaker, PC member, PC chair, Organising Committee chair, guest editor of proceedings and special issue, and steering committee member.
Selected publications
Mints, G. Epsilon substitution for first- and second-order predicate logic. "Ann. Pure Appl. Logic" 164: 733-739.
Mints, G. ADC Method of Proof Search for Intuitionistic Propositional Natural Deduction. To appear in a "Festsschrift for A. Avron".
Mints, G. Effective Cut-elimination for a Fragment of Modal mu-calculus. "Studia Logica" 100: 279-287.
Mints, G. Cut-free formulations for a quantified logic of here and there. "Ann. Pure Appl. Logic" 162: 237-242.
Mints, G. Cut elimination for a simple formulation of epsilon calculus. "Ann. Pure Appl. Logic" 152: 148-160.
Mints, G. Notes on constructive negation. in R. Kahle and P. Schroeder-Heister, "Proof-Theoretic Semantics", special issue of "Synthese", 2006, 148, issue 3, pp. 701–717.
Mints, G. Cut Elimination for a Simple Formulation of PAepsilon. "Electr. Notes Theor. Comput. Sci." 143: 159-169.
Mints, G. S4 is Topologically Complete for : a Short Proof. "Logic Journal of the IGPL" 14: 63-71.
Mints, G. Cut Elimination for S4C: A Case Study. "Studia Logica" 82: 121-132.
Mints, G. & Zhang, T. Propositional logic of continuous transformations in Cantor space. "Arch. Math. Log." 44: 783-799.
Kremer, Ph. & Mints, G. Dynamic topological logic. "Ann. Pure Appl. Logic" 131: 133-158.
Mints, G. & Zhang, T. A proof of topological completeness for S4 in. "Ann. Pure Appl. Logic" 133: 231-245.
Tatsuta, M. & Mints, G. A simple proof of second-order strong normalization with permutative conversions. "Ann. Pure Appl. Logic" 136: 134-155
Mints, G. "A Short Introduction to Intuitionistic Logic". Published by Kluwer Academic Publisher, 2001.
Mints, G. "A Short Introduction to Modal Logic". Published by Center for the Study of Language and Information - Lecture Notes, 1992.
Selected Papers in Proof Theory
Mints, G. & Martin-Löf, P. "COLOG-88: International Conference on Computer Logic", Tallinn, USSR, December 12–16, 1988, Proceedings - Lecture Notes in Computer Science, 1990.
