Grigori Mints

According to our database, Grigori Mints authored at least 60 papers between 1982 and 2017.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of three.

2017

Classical and Intuitionistic Geometric Logic.

Grigori Mints

FLAP, 2017

2016

ADC method of proof search for intuitionistic propositional natural deduction.

Grigori Mints, Shane Steinert-Threlkeld

J. Log. Comput., 2016

An extension of the omega-rule.

Ryota Akiyoshi, Grigori Mints

Arch. Math. Log., 2016

2014

The logic of transitive and dense frames: from the step-frame analysis to full cut-elimination.

Silvio Ghilardi, Grigori Mints

Log. J. IGPL, 2014

2013

Failure of interpolation in constant domain intuitionistic logic.

Grigori Mints, Grigory K. Olkhovikov, Alasdair Urquhart

J. Symb. Log., 2013

Epsilon substitution for first- and second-order predicate logic.

Grigori Mints

Ann. Pure Appl. Log., 2013

2012

Effective Cut-elimination for a Fragment of Modal mu-calculus.

Grigori Mints

Stud Logica, 2012

Intuitionistic Existential Instantiation and Epsilon Symbol

Grigori Mints

CoRR, 2012

Cut-elimination for the mu-calculus with one variable

Grigori Mints, Thomas Studer

Proceedings of the Proceedings 8th Workshop on Fixed Points in Computer Science, 2012

The Gödel-Tarski Translations of Intuitionistic Propositional Formulas.

Grigori Mints

Proceedings of the Correct Reasoning, 2012

2011

Countable Version of Omega-Rule.

Grigori Mints

Proceedings of the Logic, Language, Information and Computation, 2011

2010

Cut-free formulations for a quantified logic of here and there.

Grigori Mints

Ann. Pure Appl. Log., 2010

Preface.

Sergei N. Artëmov, Yuri V. Matiyasevich, Grigori Mints, Anatol Slissenko

Ann. Pure Appl. Log., 2010

Decidability of the Class E by Maslov's Inverse Method.

Grigori Mints

Proceedings of the Fields of Logic and Computation, 2010

2009

Logic, Language, Information and Computation.

Grigori Mints, Valeria de Paiva, Ruy J. G. B. de Queiroz

Inf. Comput., 2009

2008

Cut elimination for a simple formulation of epsilon calculus.

Grigori Mints

Ann. Pure Appl. Log., 2008

Proof Search Tree and Cut Elimination.

Grigori Mints

Proceedings of the Pillars of Computer Science, 2008

2007

Dynamic Topological Logic.

Philip Kremer, Grigori Mints

Proceedings of the Handbook of Spatial Logics, 2007

2006

Notes on Constructive Negation.

Grigori Mints

Synth., 2006

Cut Elimination for S4C: A Case Study.

Grigori Mints

Stud Logica, 2006

S4 is Topologically Complete for (0, 1): a Short Proof.

Grigori Mints

Log. J. IGPL, 2006

Preface.

Grigori Mints, Ruy J. G. B. de Queiroz

Proceedings of the 13th Workshop on Logic, Language, Information and Computation, 2006

Unwinding a Non-effective Cut Elimination Proof.

Grigori Mints

Proceedings of the Computer Science, 2006

2005

Cut Elimination for a Simple Formulation of <i>PA</i>epsilon.

Grigori Mints

Proceedings of the 12th Workshop on Logic, Language, Information and Computation, 2005

A simple proof of second-order strong normalization with permutative conversions.

Makoto Tatsuta, Grigori Mints

Ann. Pure Appl. Log., 2005

A proof of topological completeness for <i>S</i>4 in (0, 1).

Grigori Mints, Ting Zhang

Ann. Pure Appl. Log., 2005

Dynamic topological logic.

Philip Kremer, Grigori Mints

Ann. Pure Appl. Log., 2005

Propositional logic of continuous transformations in Cantor space.

Grigori Mints, Ting Zhang

Arch. Math. Log., 2005

2003

A termination proof for epsilon substitution using partial derivations.

Grigori Mints

Theor. Comput. Sci., 2003

Completeness of indexed epsilon-calculus.

Grigori Mints, Darko Sarenac

Arch. Math. Log., 2003

2001

Interpolation theorems for intuitionistic predicate logic.

Grigori Mints

Ann. Pure Appl. Log., 2001

2000

Extended normal form theorems for logical proofs from axioms.

Toshiyasu Arai, Grigori Mints

Theor. Comput. Sci., 2000

Reduction of finite and infinite derivations.

Grigori Mints

Ann. Pure Appl. Log., 2000

1999

Cut-Elimination for Simple Type Theory with An Axiom of Choice.

Grigori Mints

J. Symb. Log., 1999

The Complexity of the Disjunction and Existential Properties in Intuitionistic Logic.

Samuel R. Buss, Grigori Mints

Ann. Pure Appl. Log., 1999

1998

Linear Lambda-Terms and Natural Deduction.

Grigori Mints

Stud Logica, 1998

Normal deduction in the intuitionistic linear logic.

Grigori Mints

Arch. Math. Log., 1998

1997

Indexed systems of sequents and cut-elimination.

Grigori Mints

J. Philos. Log., 1997

Three Faces of Natural Deduction.

Grigori Mints

Proceedings of the Automated Reasoning with Analytic Tableaux and Related Methods, 1997

Existential Instantiation and Strong Normalization.

Grigori Mints

Proceedings of the Logical Foundations of Computer Science, 4th International Symposium, 1997

1996

Strong Termination for the Epsilong Substitution Method.

Grigori Mints

J. Symb. Log., 1996

Epsilon substitution method for elementary analysis.

Grigori Mints, Sergei Tupailo, Wilfried Buchholz

Arch. Math. Log., 1996

1993

Resolution calculus for the first order linear logic.

Grigori Mints

J. Log. Lang. Inf., 1993

A Normal Form for Logical Derivations Implying One for Arithmetic Derivations.

Grigori Mints

Ann. Pure Appl. Log., 1993

Resolution Strategies for the Intuitionistic Logic.

Grigori Mints

Proceedings of the Constraint Programming, 1993

Strategies for Resolution Method in Non-classical Logics (Abstract).

Grigori Mints

Proceedings of the Computational Logic and Proof Theory, Third Kurt Gödel Colloquium, 1993

1992

Complexity of Subclasses of the Intuitionistic Propositional Calculus.

Grigori Mints

BIT, 1992

1991

Proof Theory in the USSR 1925-1969.

Grigori Mints

J. Symb. Log., 1991

Condensed Detachment is Complete for Relevance Logic: A Computer-Aided Proof.

Grigori Mints, Tanel Tammet

J. Autom. Reason., 1991

The Programming System PRIZ.

Grigori Mints, Enn Tyugu

Proceedings of the Baltic Computer Science, Selected Papers, 1991

Type-theoretical Semantics of Some Declarative Languages.

Grigori Mints, Jan M. Smith, Enn Tyugu

Proceedings of the Baltic Computer Science, Selected Papers, 1991

1990

Propositional Logic Programming and Priz System.

Grigori Mints, Enn Tyugu

J. Log. Program., 1990

Editorial.

Grigori Mints, Enn Tyugu

J. Log. Program., 1990

1989

The Completeness of Provable Realizability.

Grigori Mints

Notre Dame J. Formal Log., 1989

1988

The Programming System PRIZ.

Grigori Mints, Enn Tyugu

J. Symb. Comput., 1988

Gentzen-type systems and resolution rules. Part I. Propositional logic.

Grigori Mints

Proceedings of the COLOG-88, 1988

1987

Corrigendum: Semantics of a Declarative Language.

Grigori Mints, Enn Tyugu

Inf. Process. Lett., 1987

Some Formal Systems of the Logic Programming.

Grigori Mints

Proceedings of the Fundamentals of Computation Theory, 1987

1986

Semantics of a Declarative Language.

Grigori Mints, Enn Tyugu

Inf. Process. Lett., 1986

1982

Justifications of the Structural Synthesis of Programs.

Grigori Mints, Enn Tyugu

Sci. Comput. Program., 1982