Grigori Mints

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

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2017
Classical and Intuitionistic Geometric Logic.
FLAP, 2017

2016
ADC method of proof search for intuitionistic propositional natural deduction.
J. Log. Comput., 2016

An extension of the omega-rule.
Arch. Math. Log., 2016

2014
The logic of transitive and dense frames: from the step-frame analysis to full cut-elimination.
Logic Journal of the IGPL, 2014

2013
Failure of interpolation in constant domain intuitionistic logic.
J. Symb. Log., 2013

Epsilon substitution for first- and second-order predicate logic.
Ann. Pure Appl. Logic, 2013

2012
Effective Cut-elimination for a Fragment of Modal mu-calculus.
Studia Logica, 2012

Intuitionistic Existential Instantiation and Epsilon Symbol
CoRR, 2012

Cut-elimination for the mu-calculus with one variable
Proceedings of the Proceedings 8th Workshop on Fixed Points in Computer Science, 2012

The Gödel-Tarski Translations of Intuitionistic Propositional Formulas.
Proceedings of the Correct Reasoning, 2012

2011
Countable Version of Omega-Rule.
Proceedings of the Logic, Language, Information and Computation, 2011

2010
Cut-free formulations for a quantified logic of here and there.
Ann. Pure Appl. Logic, 2010

Preface.
Ann. Pure Appl. Logic, 2010

Decidability of the Class E by Maslov's Inverse Method.
Proceedings of the Fields of Logic and Computation, 2010

2009
Logic, Language, Information and Computation.
Inf. Comput., 2009

2008
Cut elimination for a simple formulation of epsilon calculus.
Ann. Pure Appl. Logic, 2008

Proof Search Tree and Cut Elimination.
Proceedings of the Pillars of Computer Science, 2008

2007
Dynamic Topological Logic.
Proceedings of the Handbook of Spatial Logics, 2007

2006
Notes on Constructive Negation.
Synthese, 2006

Cut Elimination for S4C: A Case Study.
Studia Logica, 2006

S4 is Topologically Complete for (0, 1): a Short Proof.
Logic Journal of the IGPL, 2006

Preface.
Electr. Notes Theor. Comput. Sci., 2006

Cut Elimination for a Simple Formulation of PAepsilon.
Electr. Notes Theor. Comput. Sci., 2006

Unwinding a Non-effective Cut Elimination Proof.
Proceedings of the Computer Science, 2006

2005
A simple proof of second-order strong normalization with permutative conversions.
Ann. Pure Appl. Logic, 2005

A proof of topological completeness for S4 in (0, 1).
Ann. Pure Appl. Logic, 2005

Dynamic topological logic.
Ann. Pure Appl. Logic, 2005

Propositional logic of continuous transformations in Cantor space.
Arch. Math. Log., 2005

2003
A termination proof for epsilon substitution using partial derivations.
Theor. Comput. Sci., 2003

Completeness of indexed epsilon-calculus.
Arch. Math. Log., 2003

2001
Interpolation theorems for intuitionistic predicate logic.
Ann. Pure Appl. Logic, 2001

2000
Extended normal form theorems for logical proofs from axioms.
Theor. Comput. Sci., 2000

Reduction of finite and infinite derivations.
Ann. Pure Appl. Logic, 2000

1999
Cut-Elimination for Simple Type Theory with An Axiom of Choice.
J. Symb. Log., 1999

The Complexity of the Disjunction and Existential Properties in Intuitionistic Logic.
Ann. Pure Appl. Logic, 1999

1998
Linear Lambda-Terms and Natural Deduction.
Studia Logica, 1998

Normal deduction in the intuitionistic linear logic.
Arch. Math. Log., 1998

1997
Indexed systems of sequents and cut-elimination.
J. Philosophical Logic, 1997

Three Faces of Natural Deduction.
Proceedings of the Automated Reasoning with Analytic Tableaux and Related Methods, 1997

Existential Instantiation and Strong Normalization.
Proceedings of the Logical Foundations of Computer Science, 4th International Symposium, 1997

1996
Strong Termination for the Epsilong Substitution Method.
J. Symb. Log., 1996

Epsilon substitution method for elementary analysis.
Arch. Math. Log., 1996

1993
Resolution calculus for the first order linear logic.
Journal of Logic, Language and Information, 1993

A Normal Form for Logical Derivations Implying One for Arithmetic Derivations.
Ann. Pure Appl. Logic, 1993

Resolution Strategies for the Intuitionistic Logic.
Proceedings of the Constraint Programming, 1993

Strategies for Resolution Method in Non-classical Logics (Abstract).
Proceedings of the Computational Logic and Proof Theory, Third Kurt Gödel Colloquium, 1993

1992
Complexity of Subclasses of the Intuitionistic Propositional Calculus.
BIT, 1992

1991
Proof Theory in the USSR 1925-1969.
J. Symb. Log., 1991

Condensed Detachment is Complete for Relevance Logic: A Computer-Aided Proof.
J. Autom. Reasoning, 1991

The Programming System PRIZ.
Proceedings of the Baltic Computer Science, Selected Papers, 1991

Type-theoretical Semantics of Some Declarative Languages.
Proceedings of the Baltic Computer Science, Selected Papers, 1991

1990
Propositional Logic Programming and Priz System.
J. Log. Program., 1990

Editorial.
J. Log. Program., 1990

1989
The Completeness of Provable Realizability.
Notre Dame Journal of Formal Logic, 1989

1988
The Programming System PRIZ.
J. Symb. Comput., 1988

Gentzen-type systems and resolution rules. Part I. Propositional logic.
Proceedings of the COLOG-88, 1988

1987
Corrigendum: Semantics of a Declarative Language.
Inf. Process. Lett., 1987

Some Formal Systems of the Logic Programming.
Proceedings of the Fundamentals of Computation Theory, 1987

1986
Semantics of a Declarative Language.
Inf. Process. Lett., 1986

1982
Justifications of the Structural Synthesis of Programs.
Sci. Comput. Program., 1982


  Loading...