The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Grigori Mints: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Grigori Mints, Jan M. Smith, Enn Tyugu
    Type-theoretical Semantics of Some Declarative Languages. [Citation Graph (0, 0)][DBLP]
    Baltic Computer Science, 1991, pp:18-32 [Conf]
  2. Grigori Mints, Enn Tyugu
    The Programming System PRIZ. [Citation Graph (0, 0)][DBLP]
    Baltic Computer Science, 1991, pp:1-17 [Conf]
  3. 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]
  4. Grigori Mints
    Unwinding a Non-effective Cut Elimination Proof. [Citation Graph (0, 0)][DBLP]
    CSR, 2006, pp:259-269 [Conf]
  5. Grigori Mints
    Some Formal Systems of the Logic Programming. [Citation Graph (0, 0)][DBLP]
    FCT, 1987, pp:318-322 [Conf]
  6. Grigori Mints
    Strategies for Resolution Method in Non-classical Logics (Abstract). [Citation Graph (0, 0)][DBLP]
    Kurt Gödel Colloquium, 1993, pp:62- [Conf]
  7. Grigori Mints
    Existential Instantiation and Strong Normalization. [Citation Graph (0, 0)][DBLP]
    LFCS, 1997, pp:258-265 [Conf]
  8. Grigori Mints
    Three Faces of Natural Deduction. [Citation Graph (0, 0)][DBLP]
    TABLEAUX, 1997, pp:16-30 [Conf]
  9. Grigori Mints, Darko Sarenac
    Completeness of indexed epsilon-calculus. [Citation Graph (0, 0)][DBLP]
    Arch. Math. Log., 2003, v:42, n:7, pp:617-625 [Journal]
  10. Grigori Mints, Ting Zhang
    Propositional logic of continuous transformations in Cantor space. [Citation Graph (0, 0)][DBLP]
    Arch. Math. Log., 2005, v:44, n:6, pp:783-799 [Journal]
  11. Samuel R. Buss, Grigori Mints
    The Complexity of the Disjunction and Existential Properties in Intuitionistic Logic. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 1999, v:99, n:1-3, pp:93-104 [Journal]
  12. Philip Kremer, Grigori Mints
    Dynamic topological logic. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 2005, v:131, n:1-3, pp:133-158 [Journal]
  13. 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]
  14. 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]
  15. 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]
  16. Grigori Mints, Ting Zhang
    A proof of topological completeness for S4 in (0, 1). [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 2005, v:133, n:1-3, pp:231-245 [Journal]
  17. Makoto Tatsuta, Grigori Mints
    A simple proof of second-order strong normalization with permutative conversions. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 2005, v:136, n:1-2, pp:134-155 [Journal]
  18. 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]
  19. 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]
  20. Grigori Mints, Ruy J. G. B. de Queiroz
    Preface. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2006, v:165, n:, pp:1-3 [Journal]
  21. 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]
  22. Grigori Mints, Enn Tyugu
    Semantics of a Declarative Language. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1986, v:23, n:3, pp:147-151 [Journal]
  23. Grigori Mints, Enn Tyugu
    Corrigendum: Semantics of a Declarative Language. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1987, v:25, n:2, pp:139- [Journal]
  24. Grigori Mints, Tanel Tammet
    Condensed Detachment is Complete for Relevance Logic: A Computer-Aided Proof. [Citation Graph (0, 0)][DBLP]
    J. Autom. Reasoning, 1991, v:7, n:4, pp:587-596 [Journal]
  25. Grigori Mints, Enn Tyugu
    Editorial. [Citation Graph (0, 0)][DBLP]
    J. Log. Program., 1990, v:9, n:2&3, pp:139-140 [Journal]
  26. Grigori Mints, Enn Tyugu
    Propositional Logic Programming and Priz System. [Citation Graph (0, 0)][DBLP]
    J. Log. Program., 1990, v:9, n:2&3, pp:179-193 [Journal]
  27. Grigori Mints, Enn Tyugu
    The Programming System PRIZ. [Citation Graph (0, 0)][DBLP]
    J. Symb. Comput., 1988, v:5, n:3, pp:359-375 [Journal]
  28. Grigori Mints
    Proof Theory in the USSR 1925-1969. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1991, v:56, n:2, pp:385-424 [Journal]
  29. 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]
  30. 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]
  31. 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]
  32. Grigori Mints
    Cut Elimination for S4C: A Case Study. [Citation Graph (0, 0)][DBLP]
    Studia Logica, 2006, v:82, n:1, pp:121-132 [Journal]
  33. Grigori Mints
    Linear Lambda-Terms and Natural Deduction. [Citation Graph (0, 0)][DBLP]
    Studia Logica, 1998, v:60, n:1, pp:209-231 [Journal]
  34. Grigori Mints, Enn Tyugu
    Justifications of the Structural Synthesis of Programs. [Citation Graph (0, 0)][DBLP]
    Sci. Comput. Program., 1982, v:2, n:3, pp:215-240 [Journal]
  35. Toshiyasu Arai, Grigori Mints
    Extended normal form theorems for logical proofs from axioms. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2000, v:232, n:1-2, pp:121-132 [Journal]
  36. Grigori Mints
    A termination proof for epsilon substitution using partial derivations. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:1, n:303, pp:187-213 [Journal]

  37. Proof Search Tree and Cut Elimination. [Citation Graph (, )][DBLP]


  38. Decidability of the Class E by Maslov's Inverse Method. [Citation Graph (, )][DBLP]


  39. Normal deduction in the intuitionistic linear logic. [Citation Graph (, )][DBLP]


  40. Cut elimination for a simple formulation of epsilon calculus. [Citation Graph (, )][DBLP]


Search in 0.025secs, Finished in 0.026secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002