| 2008 |
|---|
| 41 | EE | Grigori Mints:
Proof Search Tree and Cut Elimination.
Pillars of Computer Science 2008: 521-536 |
| 40 | EE | Grigori Mints:
Cut elimination for a simple formulation of epsilon calculus.
Ann. Pure Appl. Logic 152(1-3): 148-160 (2008) |
| 2007 |
|---|
| 39 | EE | Philip Kremer,
Grigori Mints:
Dynamic Topological Logic.
Handbook of Spatial Logics 2007: 565-606 |
| 2006 |
|---|
| 38 | EE | Grigori Mints:
Unwinding a Non-effective Cut Elimination Proof.
CSR 2006: 259-269 |
| 37 | EE | Grigori Mints:
Cut Elimination for a Simple Formulation of PAepsilon.
Electr. Notes Theor. Comput. Sci. 143: 159-169 (2006) |
| 36 | EE | Grigori Mints,
Ruy J. G. B. de Queiroz:
Preface.
Electr. Notes Theor. Comput. Sci. 165: 1-3 (2006) |
| 35 | EE | Grigori Mints:
S4 is Topologically Complete for (0, 1): a Short Proof.
Logic Journal of the IGPL 14(1): 63-71 (2006) |
| 34 | EE | Grigori Mints:
Cut Elimination for S4C: A Case Study.
Studia Logica 82(1): 121-132 (2006) |
| 2005 |
|---|
| 33 | EE | Philip Kremer,
Grigori Mints:
Dynamic topological logic.
Ann. Pure Appl. Logic 131(1-3): 133-158 (2005) |
| 32 | EE | Grigori Mints,
Ting Zhang:
A proof of topological completeness for S4 in (0, 1).
Ann. Pure Appl. Logic 133(1-3): 231-245 (2005) |
| 31 | EE | Makoto Tatsuta,
Grigori Mints:
A simple proof of second-order strong normalization with permutative conversions.
Ann. Pure Appl. Logic 136(1-2): 134-155 (2005) |
| 30 | EE | Grigori Mints,
Ting Zhang:
Propositional logic of continuous transformations in Cantor space.
Arch. Math. Log. 44(6): 783-799 (2005) |
| 2003 |
|---|
| 29 | EE | Grigori Mints,
Darko Sarenac:
Completeness of indexed epsilon-calculus.
Arch. Math. Log. 42(7): 617-625 (2003) |
| 28 | EE | Grigori Mints:
A termination proof for epsilon substitution using partial derivations.
Theor. Comput. Sci. 1(303): 187-213 (2003) |
| 2001 |
|---|
| 27 | | Grigori Mints:
Interpolation theorems for intuitionistic predicate logic.
Ann. Pure Appl. Logic 113(1-3): 225-242 (2001) |
| 2000 |
|---|
| 26 | | Grigori Mints:
Reduction of finite and infinite derivations.
Ann. Pure Appl. Logic 104(1-3): 167-188 (2000) |
| 25 | EE | Toshiyasu Arai,
Grigori Mints:
Extended normal form theorems for logical proofs from axioms.
Theor. Comput. Sci. 232(1-2): 121-132 (2000) |
| 1999 |
|---|
| 24 | | Samuel R. Buss,
Grigori Mints:
The Complexity of the Disjunction and Existential Properties in Intuitionistic Logic.
Ann. Pure Appl. Logic 99(1-3): 93-104 (1999) |
| 23 | | Grigori Mints:
Cut-Elimination for Simple Type Theory with An Axiom of Choice.
J. Symb. Log. 64(2): 479-485 (1999) |
| 1998 |
|---|
| 22 | EE | Grigori Mints:
Normal deduction in the intuitionistic linear logic.
Arch. Math. Log. 37(5-6): 415-425 (1998) |
| 21 | | Grigori Mints:
Linear Lambda-Terms and Natural Deduction.
Studia Logica 60(1): 209-231 (1998) |
| 1997 |
|---|
| 20 | | Grigori Mints:
Existential Instantiation and Strong Normalization.
LFCS 1997: 258-265 |
| 19 | | Grigori Mints:
Three Faces of Natural Deduction.
TABLEAUX 1997: 16-30 |
| 1996 |
|---|
| 18 | | Grigori Mints:
Strong Termination for the Epsilong Substitution Method.
J. Symb. Log. 61(4): 1193-1205 (1996) |
| 1993 |
|---|
| 17 | | Grigori Mints:
Strategies for Resolution Method in Non-classical Logics (Abstract).
Kurt Gödel Colloquium 1993: 62 |
| 16 | | Grigori Mints:
A Normal Form for Logical Derivations Implying One for Arithmetic Derivations.
Ann. Pure Appl. Logic 62(1): 65-79 (1993) |
| 1992 |
|---|
| 15 | | Grigori Mints:
Complexity of Subclasses of the Intuitionistic Propositional Calculus.
BIT 32(1): 64-69 (1992) |
| 1991 |
|---|
| 14 | | Grigori Mints,
Enn Tyugu:
The Programming System PRIZ.
Baltic Computer Science 1991: 1-17 |
| 13 | | Grigori Mints,
Jan M. Smith,
Enn Tyugu:
Type-theoretical Semantics of Some Declarative Languages.
Baltic Computer Science 1991: 18-32 |
| 12 | | Grigori Mints,
Tanel Tammet:
Condensed Detachment is Complete for Relevance Logic: A Computer-Aided Proof.
J. Autom. Reasoning 7(4): 587-596 (1991) |
| 11 | | Grigori Mints:
Proof Theory in the USSR 1925-1969.
J. Symb. Log. 56(2): 385-424 (1991) |
| 1990 |
|---|
| 10 | | Per Martin-Löf,
Grigori Mints:
COLOG-88, International Conference on Computer Logic, Tallinn, USSR, December 1988, Proceedings
Springer 1990 |
| 9 | | Grigori Mints,
Enn Tyugu:
Editorial.
J. Log. Program. 9(2&3): 139-140 (1990) |
| 8 | | Grigori Mints,
Enn Tyugu:
Propositional Logic Programming and Priz System.
J. Log. Program. 9(2&3): 179-193 (1990) |
| 1989 |
|---|
| 7 | | Grigori Mints:
The Completeness of Provable Realizability.
Notre Dame Journal of Formal Logic 30(3): 420-441 (1989) |
| 1988 |
|---|
| 6 | | Grigori Mints:
Gentzen-type systems and resolution rules. Part I. Propositional logic.
Conference on Computer Logic 1988: 198-231 |
| 5 | | Grigori Mints,
Enn Tyugu:
The Programming System PRIZ.
J. Symb. Comput. 5(3): 359-375 (1988) |
| 1987 |
|---|
| 4 | | Grigori Mints:
Some Formal Systems of the Logic Programming.
FCT 1987: 318-322 |
| 3 | | Grigori Mints,
Enn Tyugu:
Corrigendum: Semantics of a Declarative Language.
Inf. Process. Lett. 25(2): 139 (1987) |
| 1986 |
|---|
| 2 | | Grigori Mints,
Enn Tyugu:
Semantics of a Declarative Language.
Inf. Process. Lett. 23(3): 147-151 (1986) |
| 1982 |
|---|
| 1 | | Grigori Mints,
Enn Tyugu:
Justifications of the Structural Synthesis of Programs.
Sci. Comput. Program. 2(3): 215-240 (1982) |
