Search results for "Grigori Mints"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
1	Grigori Mints	Effective Cut-elimination for a Fragment of Modal mu-calculus.	Studia Logica	2012	DBLP DOI BibTeX RDF
1	Grigori Mints, Thomas Studer	Cut-elimination for the mu-calculus with one variable	FICS	2012	DBLP DOI BibTeX RDF
1	Grigori Mints	Countable Version of Omega-Rule.	WoLLIC	2011	DBLP DOI BibTeX RDF
1	Sergei N. Artëmov, Yuri Matiyasevich, Grigori Mints, Anatol Slissenko	Preface.	Ann. Pure Appl. Logic	2010	DBLP DOI BibTeX RDF
1	Grigori Mints	Cut-free formulations for a quantified logic of here and there.	Ann. Pure Appl. Logic	2010	DBLP DOI BibTeX RDF
1	Grigori Mints	Decidability of the Class E by Maslov's Inverse Method.	Fields of Logic and Computation	2010	DBLP DOI BibTeX RDF
1	Grigori Mints, Valeria de Paiva, Ruy J. G. B. de Queiroz	Logic, Language, Information and Computation.	Inf. Comput.	2009	DBLP DOI BibTeX RDF
1	Grigori Mints	Cut elimination for a simple formulation of epsilon calculus.	Ann. Pure Appl. Logic	2008	DBLP DOI BibTeX RDF
1	Grigori Mints	Proof Search Tree and Cut Elimination.	Pillars of Computer Science	2008	DBLP DOI BibTeX RDF
1	Philip Kremer, Grigori Mints	Dynamic Topological Logic.	Handbook of Spatial Logics	2007	DBLP DOI BibTeX RDF
1	Grigori Mints	S4 is Topologically Complete for (0, 1): a Short Proof.	Logic Journal of the IGPL	2006	DBLP DOI BibTeX RDF
1	Grigori Mints	Cut Elimination for S4C: A Case Study.	Studia Logica	2006	DBLP DOI BibTeX RDF	Dynamic topological logic, cut elimination
1	Grigori Mints, Ruy J. G. B. de Queiroz	Preface.	Electr. Notes Theor. Comput. Sci.	2006	DBLP DOI BibTeX RDF
1	Grigori Mints	Cut Elimination for a Simple Formulation of PAepsilon.	Electr. Notes Theor. Comput. Sci.	2006	DBLP DOI BibTeX RDF
1	Grigori Mints	Notes on Constructive Negation.	Synthese	2006	DBLP DOI BibTeX RDF
1	Grigori Mints	Unwinding a Non-effective Cut Elimination Proof.	CSR	2006	DBLP DOI BibTeX RDF
1	Makoto Tatsuta, Grigori Mints	A simple proof of second-order strong normalization with permutative conversions.	Ann. Pure Appl. Logic	2005	DBLP DOI BibTeX RDF
1	Grigori Mints, Ting Zhang	A proof of topological completeness for S4 in (0, 1).	Ann. Pure Appl. Logic	2005	DBLP DOI BibTeX RDF
1	Philip Kremer, Grigori Mints	Dynamic topological logic.	Ann. Pure Appl. Logic	2005	DBLP DOI BibTeX RDF
1	Grigori Mints, Ting Zhang	Propositional logic of continuous transformations in Cantor space.	Arch. Math. Log.	2005	DBLP DOI BibTeX RDF
1	Grigori Mints	A termination proof for epsilon substitution using partial derivations.	Theor. Comput. Sci.	2003	DBLP DOI BibTeX RDF
1	Grigori Mints, Darko Sarenac	Completeness of indexed epsilon-calculus.	Arch. Math. Log.	2003	DBLP DOI BibTeX RDF	Epsilon calculus, Finite choice, Completeness
1	Grigori Mints	Interpolation theorems for intuitionistic predicate logic.	Ann. Pure Appl. Logic	2001	DBLP DOI BibTeX RDF
1	Toshiyasu Arai, Grigori Mints	Extended normal form theorems for logical proofs from axioms.	Theor. Comput. Sci.	2000	DBLP DOI BibTeX RDF
1	Grigori Mints	Reduction of finite and infinite derivations.	Ann. Pure Appl. Logic	2000	DBLP DOI BibTeX RDF
1	Grigori Mints	Cut-Elimination for Simple Type Theory with An Axiom of Choice.	J. Symb. Log.	1999	DBLP BibTeX RDF
1	Samuel R. Buss, Grigori Mints	The Complexity of the Disjunction and Existential Properties in Intuitionistic Logic.	Ann. Pure Appl. Logic	1999	DBLP DOI BibTeX RDF
1	Grigori Mints	Linear Lambda-Terms and Natural Deduction.	Studia Logica	1998	DBLP DOI BibTeX RDF
1	Grigori Mints	Normal deduction in the intuitionistic linear logic.	Arch. Math. Log.	1998	DBLP DOI BibTeX RDF	Mathematics Subject Classification (1991):F05, 03B45
1	Grigori Mints	Existential Instantiation and Strong Normalization.	LFCS	1997	DBLP DOI BibTeX RDF
1	Grigori Mints	Three Faces of Natural Deduction.	TABLEAUX	1997	DBLP DOI BibTeX RDF
1	Grigori Mints	Strong Termination for the Epsilong Substitution Method.	J. Symb. Log.	1996	DBLP BibTeX RDF
1	Grigori Mints	A Normal Form for Logical Derivations Implying One for Arithmetic Derivations.	Ann. Pure Appl. Logic	1993	DBLP DOI BibTeX RDF
1	Grigori Mints	Strategies for Resolution Method in Non-classical Logics (Abstract).	Kurt Gödel Colloquium	1993	DBLP DOI BibTeX RDF
1	Grigori Mints	Complexity of Subclasses of the Intuitionistic Propositional Calculus.	BIT	1992	DBLP BibTeX RDF
1	Grigori Mints	Proof Theory in the USSR 1925-1969.	J. Symb. Log.	1991	DBLP BibTeX RDF
1	Grigori Mints, Tanel Tammet	Condensed Detachment is Complete for Relevance Logic: A Computer-Aided Proof.	J. Autom. Reasoning	1991	DBLP DOI BibTeX RDF
1	Grigori Mints, Enn Tyugu	The Programming System PRIZ.	Baltic Computer Science	1991	DBLP DOI BibTeX RDF
1	Grigori Mints, Jan M. Smith, Enn Tyugu	Type-theoretical Semantics of Some Declarative Languages.	Baltic Computer Science	1991	DBLP DOI BibTeX RDF
1	Grigori Mints, Enn Tyugu	Editorial.	J. Log. Program.	1990	DBLP DOI BibTeX RDF
1	Grigori Mints, Enn Tyugu	Propositional Logic Programming and Priz System.	J. Log. Program.	1990	DBLP DOI BibTeX RDF
1	Per Martin-Löf, Grigori Mints (eds.)	COLOG-88, International Conference on Computer Logic, Tallinn, USSR, December 1988, Proceedings	Conference on Computer Logic	1990	DBLP BibTeX RDF
1	Grigori Mints	The Completeness of Provable Realizability.	Notre Dame Journal of Formal Logic	1989	DBLP BibTeX RDF
1	Grigori Mints, Enn Tyugu	The Programming System PRIZ.	J. Symb. Comput.	1988	DBLP DOI BibTeX RDF
1	Grigori Mints	Gentzen-type systems and resolution rules. Part I. Propositional logic.	Conference on Computer Logic	1988	DBLP DOI BibTeX RDF
1	Grigori Mints, Enn Tyugu	Corrigendum: Semantics of a Declarative Language.	Inf. Process. Lett.	1987	DBLP BibTeX RDF
1	Grigori Mints	Some Formal Systems of the Logic Programming.	FCT	1987	DBLP DOI BibTeX RDF
1	Grigori Mints, Enn Tyugu	Semantics of a Declarative Language.	Inf. Process. Lett.	1986	DBLP DOI BibTeX RDF
1	Grigori Mints, Enn Tyugu	Justifications of the Structural Synthesis of Programs.	Sci. Comput. Program.	1982	DBLP DOI BibTeX RDF

Publications of "Grigori Mints" ( http://dblp.L3S.de/Authors/Grigori_Mints )