Grigori Mints

From MaRDI portal
Revision as of 16:17, 9 December 2023 by AuthorDisambiguator (talk | contribs) (AuthorDisambiguator moved page Grigori Mints to Grigori Mints: Duplicate)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Person:454365

Available identifiers

zbMath Open mints.grigori-efroimovichDBLP45/4945WikidataQ17489542 ScholiaQ17489542MaRDI QIDQ454365

List of research outcomes





PublicationDate of PublicationType
Normalization Proof for Derivations in PA after P. Cohen2021-12-03Paper
https://portal.mardi4nfdi.de/entity/Q58547382021-03-17Paper
https://portal.mardi4nfdi.de/entity/Q52157892020-02-13Paper
Intuitionistic Existential Instantiation and Epsilon Symbol2020-02-04Paper
Three faces of natural deduction2019-01-15Paper
The programming system PRIZ2018-12-11Paper
Type-theoretical semantics of some declarative languages2018-12-11Paper
Non-deterministic Epsilon Substitution Method for PA and ID 12017-09-27Paper
An extension of the omega-rule2016-05-13Paper
ADC method of proof search for intuitionistic propositional natural deduction2016-04-28Paper
https://portal.mardi4nfdi.de/entity/Q34646192016-01-27Paper
The logic of transitive and dense frames: from the step-frame analysis to full cut-elimination2015-02-12Paper
https://portal.mardi4nfdi.de/entity/Q49814522014-06-24Paper
Failure of Interpolation in Constant Domain Intuitionistic Logic2014-01-07Paper
Nikolai Aleksandrovich Shanin (obituary)2013-12-17Paper
Epsilon substitution for first- and second-order predicate logic2013-04-15Paper
Effective cut-elimination for a fragment of modal mu-calculus2012-10-01Paper
The Gödel-Tarski Translations of Intuitionistic Propositional Formulas2012-07-23Paper
Preface to the special issue dedicated to Nikolai Alexandrovich Shanin on the occasion of his 90th birthday2011-09-12Paper
Cut-free formulations for a quantified logic of here and there2011-09-12Paper
Countable Version of Omega-Rule2011-05-27Paper
Decidability of the Class E by Maslov’s Inverse Method2010-09-03Paper
Analysis and Extension of Omega-Rule2009-04-30Paper
Cut elimination for a simple formulation of epsilon calculus2008-03-28Paper
Proof Search Tree and Cut Elimination2008-03-25Paper
Unwinding a Non-effective Cut Elimination Proof2007-05-02Paper
Notes on constructive negation2006-08-18Paper
S4 is Topologically Complete for (0,1): a Short Proof2006-07-06Paper
Cut elimination for S4C: A case study2006-03-17Paper
A simple proof of second-order strong normalization with permutative conversions2005-09-22Paper
Dynamic topological logic2005-01-31Paper
https://portal.mardi4nfdi.de/entity/Q44536382004-03-07Paper
Completeness of indexed \(\varepsilon\)-calculus2003-10-29Paper
Nikolai Aleksandrovich Shanin (on his 80th birthday)2003-08-28Paper
A termination proof for epsilon substitution using partial derivations2003-08-17Paper
https://portal.mardi4nfdi.de/entity/Q47930262003-02-18Paper
Interpolation theorems for intuitionistic predicate logic2002-12-11Paper
https://portal.mardi4nfdi.de/entity/Q27518192002-03-26Paper
Linear lambda-terms and natural deduction2001-12-07Paper
https://portal.mardi4nfdi.de/entity/Q27025642001-07-24Paper
Reduction of finite and infinite derivations2001-07-09Paper
https://portal.mardi4nfdi.de/entity/Q27038022001-03-18Paper
https://portal.mardi4nfdi.de/entity/Q49419932001-02-05Paper
Extended normal form theorems for logical proofs from axioms2000-08-23Paper
https://portal.mardi4nfdi.de/entity/Q44958502000-08-13Paper
In Memoriam: Albert G. Dragalin 1941–19982000-06-07Paper
Normal deduction in the intuitionistic linear logic2000-05-15Paper
The complexity of the disjunction and existential properties in intuitionistic logic2000-02-15Paper
A method of epsilon substitution for the predicate logic with equality1999-11-22Paper
Cut-elimination for simple type theory with an axiom of choice1999-09-12Paper
https://portal.mardi4nfdi.de/entity/Q42500391999-06-17Paper
https://portal.mardi4nfdi.de/entity/Q43970291998-06-25Paper
Indexed systems of sequents and cut-elimination1998-04-15Paper
https://portal.mardi4nfdi.de/entity/Q43608611998-04-15Paper
https://portal.mardi4nfdi.de/entity/Q43760651998-02-08Paper
Strong termination for the epsilon substitution method1997-09-15Paper
https://portal.mardi4nfdi.de/entity/Q56888021997-03-16Paper
Epsilon substitution method for elementary analysis1996-10-15Paper
https://portal.mardi4nfdi.de/entity/Q43257741996-04-22Paper
https://portal.mardi4nfdi.de/entity/Q43124611995-04-24Paper
https://portal.mardi4nfdi.de/entity/Q42812581994-09-26Paper
https://portal.mardi4nfdi.de/entity/Q42825901994-09-26Paper
Complexity of subclasses of the intuitionistic propositional calculus1994-06-22Paper
Resolution calculus for the first order linear logic1994-02-22Paper
A normal form for logical derivations implying one for arithmetic derivations1993-08-09Paper
https://portal.mardi4nfdi.de/entity/Q46942121993-06-29Paper
https://portal.mardi4nfdi.de/entity/Q39993861993-01-23Paper
Condensed detachment is complete for relevance logic: A computer-aided proof1992-06-27Paper
Proof theory in the USSR 1925–19691992-06-27Paper
A NORMAL FORM THEOREM FOR SECOND-ORDER CLASSICAL LOGIC WITH AN AXIOM OF CHOICE1992-06-25Paper
https://portal.mardi4nfdi.de/entity/Q39725271992-06-25Paper
https://portal.mardi4nfdi.de/entity/Q52026521990-01-01Paper
https://portal.mardi4nfdi.de/entity/Q34717071990-01-01Paper
Nikolai Aleksandrovich Shanin (on his seventieth birthday)1990-01-01Paper
The completeness of provable realizability1989-01-01Paper
Resolution calculi for modal logics1989-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38325651989-01-01Paper
The programming system PRIZ1988-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38000281988-01-01Paper
Corrigendum to ``Semantics of a declarative language1987-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37828411987-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37937681987-01-01Paper
https://portal.mardi4nfdi.de/entity/Q47257091986-01-01Paper
Semantics of a declarative language1986-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37554511986-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37688681986-01-01Paper
Description semantics in utopist language and automatic program synthesis1985-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37688671985-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37181461984-01-01Paper
The PRIZ system and propositional calculus1983-01-01Paper
Justification of the structural synthesis of programs1982-01-01Paper
A new reduction sequence for arithmetic1982-01-01Paper
Primitive recursive estimate of strong normalization for predicate calculus1982-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36662801982-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36746501982-01-01Paper
Closed categories and the theory of proofs1981-01-01Paper
What can be done with PRA?1980-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36597851980-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38597641980-01-01Paper
NIKOLAI ALEKSANDROVICH SHANIN (on his sixtieth birthday)1980-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38661001979-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38808421979-01-01Paper
Finite investigations of transfinite derivations1978-01-01Paper
Transfinite expansions of arithmetic formulas1978-01-01Paper
E theorems1977-01-01Paper
Heyting predicate calculus with epsilon symbol1977-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41456931977-01-01Paper
Derivability of admissible rules1976-01-01Paper
Cut-elimination theorem for relevant logics1976-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41497461976-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41720481976-01-01Paper
Theory of proofs (arithmetic and analysis)1975-01-01Paper
https://portal.mardi4nfdi.de/entity/Q40795641975-01-01Paper
https://portal.mardi4nfdi.de/entity/Q40812181975-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41082981975-01-01Paper
The Skolem method in intuitionistic calculi1974-01-01Paper
https://portal.mardi4nfdi.de/entity/Q40475371974-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41335961974-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41456921974-01-01Paper
Quantifier-free and one-quantifier systems1973-01-01Paper
Exact estimates of the provability of transfinite induction in the initial segments of arithmetic1973-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41336021973-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41525221973-01-01Paper
https://portal.mardi4nfdi.de/entity/Q47669631972-01-01Paper
On predicate and operator variants of the formation of theories of constructive mathematics1972-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56266101971-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56348681971-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56382661971-01-01Paper
https://portal.mardi4nfdi.de/entity/Q55900521969-01-01Paper
https://portal.mardi4nfdi.de/entity/Q55962571969-01-01Paper
https://portal.mardi4nfdi.de/entity/Q55563961968-01-01Paper
https://portal.mardi4nfdi.de/entity/Q55602601968-01-01Paper
https://portal.mardi4nfdi.de/entity/Q55602611968-01-01Paper
https://portal.mardi4nfdi.de/entity/Q55602621968-01-01Paper
https://portal.mardi4nfdi.de/entity/Q55694301968-01-01Paper
https://portal.mardi4nfdi.de/entity/Q55694311968-01-01Paper
https://portal.mardi4nfdi.de/entity/Q55983351968-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56044351968-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56044371968-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56044381968-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56072071968-01-01Paper
On the construction of conservative logical deductions1968-01-01Paper
Sovability of the problem of deducibility in LJ for a class of formulas not containing negative occurrences of quantifiers1968-01-01Paper
On some calculi of modal logic1968-01-01Paper
https://portal.mardi4nfdi.de/entity/Q55511121967-01-01Paper
https://portal.mardi4nfdi.de/entity/Q55511131967-01-01Paper
https://portal.mardi4nfdi.de/entity/Q55511141967-01-01Paper
https://portal.mardi4nfdi.de/entity/Q55739661967-01-01Paper
https://portal.mardi4nfdi.de/entity/Q55794771967-01-01Paper
https://portal.mardi4nfdi.de/entity/Q55794781967-01-01Paper
https://portal.mardi4nfdi.de/entity/Q55815911967-01-01Paper
https://portal.mardi4nfdi.de/entity/Q55815931967-01-01Paper
https://portal.mardi4nfdi.de/entity/Q55815951967-01-01Paper
https://portal.mardi4nfdi.de/entity/Q55886071967-01-01Paper
Corrigenda and addenda to the article 'On predicate and operator variants of the formation of the theories of constructive mathematics'1967-01-01Paper
https://portal.mardi4nfdi.de/entity/Q55362611966-01-01Paper
https://portal.mardi4nfdi.de/entity/Q55794761966-01-01Paper
https://portal.mardi4nfdi.de/entity/Q55532921965-01-01Paper
https://portal.mardi4nfdi.de/entity/Q55592431965-01-01Paper
https://portal.mardi4nfdi.de/entity/Q53433281963-01-01Paper
https://portal.mardi4nfdi.de/entity/Q53441651962-01-01Paper
https://portal.mardi4nfdi.de/entity/Q55968001962-01-01Paper

Research outcomes over time

This page was built for person: Grigori Mints