Grigori Mints - RankMe

62 papers B 2C 4Misc 2Journal 43Unranked 7

Year	Rank	Type	Title / Venue / Authors
2017	J	`jnl`	Classical and Intuitionistic Geometric Logic. FLAP Grigori Mints
2016	J	`jnl`	ADC method of proof search for intuitionistic propositional natural deduction. J. Log. Comput. Grigori Mints, Shane Steinert-Threlkeld
2016	J	`jnl`	An extension of the omega-rule. Arch. Math. Log. Ryota Akiyoshi, Grigori Mints
2014	J	`jnl`	The logic of transitive and dense frames: from the step-frame analysis to full cut-elimination. Log. J. IGPL Silvio Ghilardi, Grigori Mints
2013	J	`jnl`	Epsilon substitution for first- and second-order predicate logic. Ann. Pure Appl. Log. Grigori Mints
2013	J	`jnl`	Failure of interpolation in constant domain intuitionistic logic. J. Symb. Log. Grigori Mints, Grigory K. Olkhovikov, Alasdair Urquhart
2012	—	`conf`	Cut-elimination for the mu-calculus with one variable FICS Grigori Mints, Thomas Studer
2012	J	`jnl`	Effective Cut-elimination for a Fragment of Modal mu-calculus. Stud Logica Grigori Mints
2012	J	`jnl`	Intuitionistic Existential Instantiation and Epsilon Symbol CoRR Grigori Mints
2012	—	`conf`	The Gödel-Tarski Translations of Intuitionistic Propositional Formulas. Correct Reasoning Grigori Mints
2011	C	`conf`	Countable Version of Omega-Rule. WoLLIC Grigori Mints
2010	J	`jnl`	Cut-free formulations for a quantified logic of here and there. Ann. Pure Appl. Log. Grigori Mints
2010	—	`conf`	Decidability of the Class E by Maslov's Inverse Method. Fields of Logic and Computation Grigori Mints
2010	J	`jnl`	Preface. Ann. Pure Appl. Log. Sergei N. Artëmov, Yuri V. Matiyasevich, Grigori Mints, Anatol Slissenko
2009	J	`jnl`	Logic, Language, Information and Computation. Inf. Comput. Grigori Mints, Valeria de Paiva, Ruy J. G. B. de Queiroz
2008	J	`jnl`	Cut elimination for a simple formulation of epsilon calculus. Ann. Pure Appl. Log. Grigori Mints
2008	—	`conf`	Proof Search Tree and Cut Elimination. Pillars of Computer Science Grigori Mints
2007	—	`ch.`	Dynamic Topological Logic. Handbook of Spatial Logics Philip Kremer, Grigori Mints
2006	J	`jnl`	Cut Elimination for S4C: A Case Study. Stud Logica Grigori Mints
2006	J	`jnl`	Notes on Constructive Negation. Synth. Grigori Mints
2006	C	`conf`	Preface. WoLLIC Grigori Mints, Ruy J. G. B. de Queiroz
2006	C	`ed.`	Proceedings of the 13th Workshop on Logic, Language, Information and Computation, WoLLIC 2006, Stanford University, CA, USA, July 18-21, 2006 WoLLIC Grigori Mints, Ruy J. G. B. de Queiroz
2006	J	`jnl`	S4 is Topologically Complete for (0, 1): a Short Proof. Log. J. IGPL Grigori Mints
2006	Misc	`conf`	Unwinding a Non-effective Cut Elimination Proof. CSR Grigori Mints
2005	J	`jnl`	A proof of topological completeness for Ann. Pure Appl. Log. Grigori Mints, Ting Zhang
2005	J	`jnl`	A simple proof of second-order strong normalization with permutative conversions. Ann. Pure Appl. Log. Makoto Tatsuta, Grigori Mints
2005	C	`conf`	Cut Elimination for a Simple Formulation of WoLLIC Grigori Mints
2005	J	`jnl`	Dynamic topological logic. Ann. Pure Appl. Log. Philip Kremer, Grigori Mints
2005	J	`jnl`	Propositional logic of continuous transformations in Cantor space. Arch. Math. Log. Grigori Mints, Ting Zhang
2003	J	`jnl`	A termination proof for epsilon substitution using partial derivations. Theor. Comput. Sci. Grigori Mints
2003	J	`jnl`	Completeness of indexed epsilon-calculus. Arch. Math. Log. Grigori Mints, Darko Sarenac
2001	J	`jnl`	Interpolation theorems for intuitionistic predicate logic. Ann. Pure Appl. Log. Grigori Mints
2000	J	`jnl`	Extended normal form theorems for logical proofs from axioms. Theor. Comput. Sci. Toshiyasu Arai, Grigori Mints
2000	J	`jnl`	Reduction of finite and infinite derivations. Ann. Pure Appl. Log. Grigori Mints
1999	J	`jnl`	Cut-Elimination for Simple Type Theory with An Axiom of Choice. J. Symb. Log. Grigori Mints
1999	J	`jnl`	The Complexity of the Disjunction and Existential Properties in Intuitionistic Logic. Ann. Pure Appl. Log. Samuel R. Buss, Grigori Mints
1998	J	`jnl`	Linear Lambda-Terms and Natural Deduction. Stud Logica Grigori Mints
1998	J	`jnl`	Normal deduction in the intuitionistic linear logic. Arch. Math. Log. Grigori Mints
1997	Misc	`conf`	Existential Instantiation and Strong Normalization. LFCS Grigori Mints
1997	J	`jnl`	Indexed systems of sequents and cut-elimination. J. Philos. Log. Grigori Mints
1997	B	`conf`	Three Faces of Natural Deduction. TABLEAUX Grigori Mints
1996	J	`jnl`	Epsilon substitution method for elementary analysis. Arch. Math. Log. Grigori Mints, Sergei Tupailo, Wilfried Buchholz
1996	J	`jnl`	Strong Termination for the Epsilong Substitution Method. J. Symb. Log. Grigori Mints
1993	J	`jnl`	A Normal Form for Logical Derivations Implying One for Arithmetic Derivations. Ann. Pure Appl. Log. Grigori Mints
1993	—	`conf`	Resolution Strategies for the Intuitionistic Logic. NATO ASI CP Grigori Mints
1993	J	`jnl`	Resolution calculus for the first order linear logic. J. Log. Lang. Inf. Grigori Mints
1993	—	`conf`	Strategies for Resolution Method in Non-classical Logics (Abstract). Kurt Gödel Colloquium Grigori Mints
1992	J	`jnl`	Complexity of Subclasses of the Intuitionistic Propositional Calculus. BIT Grigori Mints
1991	J	`jnl`	Condensed Detachment is Complete for Relevance Logic: A Computer-Aided Proof. J. Autom. Reason. Grigori Mints, Tanel Tammet
1991	J	`jnl`	Proof Theory in the USSR 1925-1969. J. Symb. Log. Grigori Mints
1991	—	`ch.`	The Programming System PRIZ. Baltic Computer Science Grigori Mints, Enn Tyugu
1991	—	`ch.`	Type-theoretical Semantics of Some Declarative Languages. Baltic Computer Science Grigori Mints, Jan M. Smith, Enn Tyugu
1990	—	`ed.`	COLOG-88, International Conference on Computer Logic, Tallinn, USSR, December 1988, Proceedings Conference on Computer Logic Per Martin-Löf, Grigori Mints
1990	J	`jnl`	Editorial. J. Log. Program. Grigori Mints, Enn Tyugu
1990	J	`jnl`	Propositional Logic Programming and Priz System. J. Log. Program. Grigori Mints, Enn Tyugu
1989	J	`jnl`	The Completeness of Provable Realizability. Notre Dame J. Formal Log. Grigori Mints
1988	—	`conf`	Gentzen-type systems and resolution rules. Part I. Propositional logic. Conference on Computer Logic Grigori Mints
1988	J	`jnl`	The Programming System PRIZ. J. Symb. Comput. Grigori Mints, Enn Tyugu
1987	J	`jnl`	Corrigendum: Semantics of a Declarative Language. Inf. Process. Lett. Grigori Mints, Enn Tyugu
1987	B	`conf`	Some Formal Systems of the Logic Programming. FCT Grigori Mints
1986	J	`jnl`	Semantics of a Declarative Language. Inf. Process. Lett. Grigori Mints, Enn Tyugu
1982	J	`jnl`	Justifications of the Structural Synthesis of Programs. Sci. Comput. Program. Grigori Mints, Enn Tyugu