Grigori Mints

Publication Activity (10 Years)

Years Active: 1982-2017
Publications (10 Years): 3

Top Topics

Predicate Logic

Natural Deduction

Sequent Calculus

Top Venues

J. Log. Comput.

Arch. Math. Log.

Publications

Grigori Mints
Classical and Intuitionistic Geometric Logic. FLAP 4 (4) (2017)
Ryota Akiyoshi, Grigori Mints
An extension of the omega-rule. Arch. Math. Log. 55 (3-4) (2016)
Grigori Mints, Shane Steinert-Threlkeld
ADC method of proof search for intuitionistic propositional natural deduction. J. Log. Comput. 26 (1) (2016)
Silvio Ghilardi, Grigori Mints
The logic of transitive and dense frames: from the step-frame analysis to full cut-elimination. Log. J. IGPL 22 (4) (2014)
Grigori Mints, Grigory K. Olkhovikov, Alasdair Urquhart
Failure of interpolation in constant domain intuitionistic logic. J. Symb. Log. 78 (3) (2013)
Grigori Mints
Epsilon substitution for first- and second-order predicate logic. Ann. Pure Appl. Log. 164 (6) (2013)
Grigori Mints, Thomas Studer
Cut-elimination for the mu-calculus with one variable FICS (2012)
Grigori Mints
The Gödel-Tarski Translations of Intuitionistic Propositional Formulas. Correct Reasoning (2012)
Grigori Mints
Effective Cut-elimination for a Fragment of Modal mu-calculus. Stud Logica 100 (1-2) (2012)
Grigori Mints
Intuitionistic Existential Instantiation and Epsilon Symbol CoRR (2012)
Grigori Mints
Countable Version of Omega-Rule. WoLLIC (2011)
Grigori Mints
Cut-free formulations for a quantified logic of here and there. Ann. Pure Appl. Log. 162 (3) (2010)
Sergei N. Artëmov, Yuri V. Matiyasevich, Grigori Mints, Anatol Slissenko
Preface. Ann. Pure Appl. Log. 162 (3) (2010)
Grigori Mints
Decidability of the Class E by Maslov's Inverse Method. Fields of Logic and Computation (2010)
Grigori Mints, Valeria de Paiva, Ruy J. G. B. de Queiroz
Logic, Language, Information and Computation. Inf. Comput. 207 (10) (2009)
Grigori Mints
Cut elimination for a simple formulation of epsilon calculus. Ann. Pure Appl. Log. 152 (1-3) (2008)
Grigori Mints
Proof Search Tree and Cut Elimination. Pillars of Computer Science (2008)
Grigori Mints, Ruy J. G. B. de Queiroz
Preface. Electron. Notes Theor. Comput. Sci. 165 (2006)
Grigori Mints
Cut Elimination for S4C: A Case Study. Stud Logica 82 (1) (2006)
Grigori Mints
S4 is Topologically Complete for (0, 1): a Short Proof. Log. J. IGPL 14 (1) (2006)
Grigori Mints
epsilon. Electron. Notes Theor. Comput. Sci. 143 (2006)
Grigori Mints
Unwinding a Non-effective Cut Elimination Proof. CSR (2006)
Grigori Mints
Notes on Constructive Negation. Synth. 148 (3) (2006)
Makoto Tatsuta, Grigori Mints
A simple proof of second-order strong normalization with permutative conversions. Ann. Pure Appl. Log. 136 (1-2) (2005)
Philip Kremer, Grigori Mints
Dynamic topological logic. Ann. Pure Appl. Log. 131 (1-3) (2005)
Grigori Mints, Ting Zhang
Propositional logic of continuous transformations in Cantor space. Arch. Math. Log. 44 (6) (2005)
Grigori Mints, Ting Zhang
4 in (0, 1). Ann. Pure Appl. Log. 133 (1-3) (2005)
Grigori Mints, Darko Sarenac
Completeness of indexed epsilon-calculus. Arch. Math. Log. 42 (7) (2003)
Grigori Mints
A termination proof for epsilon substitution using partial derivations. Theor. Comput. Sci. 303 (1) (2003)
Grigori Mints
Interpolation theorems for intuitionistic predicate logic. Ann. Pure Appl. Log. 113 (1-3) (2001)
Toshiyasu Arai, Grigori Mints
Extended normal form theorems for logical proofs from axioms. Theor. Comput. Sci. 232 (1-2) (2000)
Grigori Mints
Reduction of finite and infinite derivations. Ann. Pure Appl. Log. 104 (1-3) (2000)
Grigori Mints
Cut-Elimination for Simple Type Theory with An Axiom of Choice. J. Symb. Log. 64 (2) (1999)
Samuel R. Buss, Grigori Mints
The Complexity of the Disjunction and Existential Properties in Intuitionistic Logic. Ann. Pure Appl. Log. 99 (1-3) (1999)
Grigori Mints
Linear Lambda-Terms and Natural Deduction. Stud Logica 60 (1) (1998)
Grigori Mints
Normal deduction in the intuitionistic linear logic. Arch. Math. Log. 37 (5-6) (1998)
Grigori Mints
Three Faces of Natural Deduction. TABLEAUX (1997)
Grigori Mints
Existential Instantiation and Strong Normalization. LFCS (1997)
Grigori Mints
Indexed systems of sequents and cut-elimination. J. Philos. Log. 26 (6) (1997)
Grigori Mints, Sergei Tupailo, Wilfried Buchholz
Epsilon substitution method for elementary analysis. Arch. Math. Log. 35 (2) (1996)
Grigori Mints
Strong Termination for the Epsilong Substitution Method. J. Symb. Log. 61 (4) (1996)
Grigori Mints
Resolution Strategies for the Intuitionistic Logic. NATO ASI CP (1993)
Grigori Mints
Strategies for Resolution Method in Non-classical Logics (Abstract). Kurt Gödel Colloquium (1993)
Grigori Mints
A Normal Form for Logical Derivations Implying One for Arithmetic Derivations. Ann. Pure Appl. Log. 62 (1) (1993)
Grigori Mints
Resolution calculus for the first order linear logic. J. Log. Lang. Inf. 2 (1) (1993)
Grigori Mints
Complexity of Subclasses of the Intuitionistic Propositional Calculus. BIT 32 (1) (1992)
Grigori Mints
Proof Theory in the USSR 1925-1969. J. Symb. Log. 56 (2) (1991)
Grigori Mints, Tanel Tammet
Condensed Detachment is Complete for Relevance Logic: A Computer-Aided Proof. J. Autom. Reason. 7 (4) (1991)
Grigori Mints, Enn Tyugu
Propositional Logic Programming and Priz System. J. Log. Program. 9 (2&3) (1990)
Grigori Mints, Enn Tyugu
Editorial. J. Log. Program. 9 (2&3) (1990)
Grigori Mints
The Completeness of Provable Realizability. Notre Dame J. Formal Log. 30 (3) (1989)
Grigori Mints, Enn Tyugu
The Programming System PRIZ. J. Symb. Comput. 5 (3) (1988)
Grigori Mints
Gentzen-type systems and resolution rules. Part I. Propositional logic. Conference on Computer Logic (1988)
Grigori Mints
Some Formal Systems of the Logic Programming. FCT (1987)
Grigori Mints, Enn Tyugu
Corrigendum: Semantics of a Declarative Language. Inf. Process. Lett. 25 (2) (1987)
Grigori Mints, Enn Tyugu
Semantics of a Declarative Language. Inf. Process. Lett. 23 (3) (1986)
Grigori Mints, Enn Tyugu
Justifications of the Structural Synthesis of Programs. Sci. Comput. Program. 2 (3) (1982)