Grigori Mints Gentzen-type systems and resolution rules. Part I. Propositional logic. [Citation Graph (0, 0)][DBLP] Conference on Computer Logic, 1988, pp:198-231 [Conf]
Grigori Mints Strategies for Resolution Method in Non-classical Logics (Abstract). [Citation Graph (0, 0)][DBLP] Kurt Gödel Colloquium, 1993, pp:62- [Conf]
Grigori Mints Reduction of finite and infinite derivations. [Citation Graph (0, 0)][DBLP] Ann. Pure Appl. Logic, 2000, v:104, n:1-3, pp:167-188 [Journal]
Grigori Mints Interpolation theorems for intuitionistic predicate logic. [Citation Graph (0, 0)][DBLP] Ann. Pure Appl. Logic, 2001, v:113, n:1-3, pp:225-242 [Journal]
Grigori Mints A Normal Form for Logical Derivations Implying One for Arithmetic Derivations. [Citation Graph (0, 0)][DBLP] Ann. Pure Appl. Logic, 1993, v:62, n:1, pp:65-79 [Journal]
Grigori Mints Complexity of Subclasses of the Intuitionistic Propositional Calculus. [Citation Graph (0, 0)][DBLP] BIT, 1992, v:32, n:1, pp:64-69 [Journal]
Grigori Mints Cut Elimination for a Simple Formulation of PAepsilon. [Citation Graph (0, 0)][DBLP] Electr. Notes Theor. Comput. Sci., 2006, v:143, n:, pp:159-169 [Journal]
Grigori Mints S4 is Topologically Complete for (0, 1): a Short Proof. [Citation Graph (0, 0)][DBLP] Logic Journal of the IGPL, 2006, v:14, n:1, pp:63-71 [Journal]
Grigori Mints Strong Termination for the Epsilong Substitution Method. [Citation Graph (0, 0)][DBLP] J. Symb. Log., 1996, v:61, n:4, pp:1193-1205 [Journal]
Grigori Mints Cut-Elimination for Simple Type Theory with An Axiom of Choice. [Citation Graph (0, 0)][DBLP] J. Symb. Log., 1999, v:64, n:2, pp:479-485 [Journal]
Grigori Mints The Completeness of Provable Realizability. [Citation Graph (0, 0)][DBLP] Notre Dame Journal of Formal Logic, 1989, v:30, n:3, pp:420-441 [Journal]