×

zbMATH — the first resource for mathematics

Mints, Grigoriĭ Efroimovich

Compute Distance To:
Author ID: mints.grigori-efroimovich Recent zbMATH articles by "Mints, Grigoriĭ Efroimovich"
Published as: Mints, G. E.; Mints, Grigori; Minc, G. E.; Mints, G.; Mints, Grigorii Efroimovich; Mints, Grigorii E.; Mints, Grigori E.; Mints, Grigorii; Mints, Grigorij; Mints, Gregory; Mints, Grigory
Homepage: http://news.stanford.edu/news/2014/june/grigori-mints-obit-061214.html
External Links: IdRef · MGP · Math-Net.Ru · Wikidata · dblp · GND
Documents Indexed: 174 Publications since 1962, including 11 Books
Reviewing Activity: 488 Reviews
Biographic References: 5 Publications
all top 5

Co-Authors

121 single-authored
11 Orevkov, V. P.
9 Tyugu, Ènn Kharal’dovich
8 Slisenko, A. O.
7 Matiyasevich, Yuriĭ Vladimirovich
6 Maslov, S. Yu.
5 Davydov, G. V.
2 Artemov, Sergei
2 Dantsin, E. Ya.
2 Grigor’ev, Dmitriĭ Yur’evich
2 Konev, B. Yu.
2 Lifschitz, Vladimir
2 Lorents, P. P.
2 Solov’ëv, Sergeĭ Vladimirovich
2 Tammet, Tanel
2 Tupailo, Sergei
2 Vsemirnov, M. A.
1 Akiyoshi, Ryota
1 Arai, Toshiyasu
1 Arkhangel’skiĭ, Dmitriĭ A.
1 Baizhanov, Bektur Sembiuly
1 Belegradek, Oleg V.
1 Belyaev, V. Ya.
1 Bokut, Leonid A.
1 Buchholz, Wilfried
1 Buss, Sam
1 Chernov, V. P.
1 Daderkin, Dmitri O.
1 Dekhtyar, Alexander M.
1 Dikovsky, Alexander Yakovlevich
1 Dudakov, Sergey M.
1 Ghilardi, Silvio
1 Girsh, È. A.
1 Gitik, Moti
1 Gurevich, Yuri
1 Hirsch, Edward A.
1 Ivanov, Aleksandr Aleksandrovich
1 Karavaev, Eh. F.
1 Kossovsky, N. K.
1 Kreinovich, Vladik Yakovlevich
1 Kreisel, Georg
1 Kremer, Philip
1 Krushkal, Samuel L.
1 Kushner, Boris A.
1 Kutateladze, Semën Samsonovich
1 Larrazabal, J. M.
1 Lascar, Daniel
1 Margenstern, Maurice
1 Martin-Löf, Per
1 Matskin, M. B.
1 Musikaev, Ilmir Kh.
1 Muskens, Reinhard A.
1 Nogina, Elena
1 Olkhovikov, Grigory K.
1 Orevkov, E. P.
1 Orevkov, Vladimir
1 Pliuškevičius, Regimantas
1 Rebrov, A. K.
1 Reshetnyak, Yuriĭ Grigor’evich
1 Sarenac, Darko
1 Semenov, Alexei Lvovich
1 Shanin, Nikolaĭ Aleksandrovich
1 Simpson, Stephen G.
1 Slissenko, Anatol
1 Smith, Jan M.
1 Steinert-Threlkeld, Shane
1 Stolboushkin, Alexei P.
1 Studer, Thomas
1 Taimanov, Iskander Asanovich
1 Tatsuta, Makoto
1 Trakhtenbrot, Boris Avraamovich
1 Troelstra, Anne Sjerp
1 Urquhart, Alasdair
1 Valiev, Mars K.
1 Vodop’yanov, Sergeĭ Konstantinovich
1 Volozh, B. B.
1 Zaslavskii, Igor Dmitrievich
1 Zel’manov, Efim Isaakovich
1 Zilber, Boris I.
all top 5

Serials

22 Zapiski Nauchnykh Seminarov Leningradskogo Otdeleniya Matematicheskogo Instituta Imeni V. A. Steklova
13 Journal of Soviet Mathematics
11 Annals of Pure and Applied Logic
7 Soviet Mathematics. Doklady
6 Izvestiya Akademii Nauk Èstonskoĭ SSR. Fizika. Matematika
5 Archive for Mathematical Logic
5 Proceedings of the Steklov Institute of Mathematics
4 Russian Mathematical Surveys
4 The Journal of Symbolic Logic
4 Logic Journal of the IGPL
4 Trudy Matematicheskogo Instituta Imeni V. A. Steklova
3 Studia Logica
2 Information Processing Letters
2 Theoretical Computer Science
2 Journal of Mathematical Sciences (New York)
2 CSLI Lecture Notes
2 Translations. Series 2. American Mathematical Society
1 Uspekhi Matematicheskikh Nauk [N. S.]
1 BIT
1 Journal of Philosophical Logic
1 Kibernetika
1 Mathematics of the USSR. Izvestiya
1 Notre Dame Journal of Formal Logic
1 Programming and Computer Software
1 Synthese
1 Cybernetics
1 Science of Computer Programming
1 Computers and Artificial Intelligence
1 Journal of Symbolic Computation
1 Journal of Automated Reasoning
1 Journal of Logic and Computation
1 Izvestiya Akademii Nauk SSSR. Seriya Matematicheskaya
1 Journal of Logic, Language and Information
1 Zapiski Nauchnykh Seminarov POMI
1 The Bulletin of Symbolic Logic
1 Nordic Journal of Philosophical Logic
1 Sibirskie Èlektronnye Matematicheskie Izvestiya
1 Lecture Notes in Computer Science
1 Lecture Notes in Logic
1 Semiotika i Informatika
1 Electronic Notes in Theoretical Computer Science
1 Translations. Series 2. American Mathematical Society

Publications by Year

Citations contained in zbMATH Open

98 Publications have been cited 428 times in 306 Documents Cited by Year
A short introduction to intuitionistic logic. Zbl 1036.03003
Mints, Grigori
27
2000
Gentzen-type systems and resolution rules. I: Propositional logic. Zbl 0739.03011
Mints, G.
25
1990
Dynamic topological logic. Zbl 1067.03028
Kremer, Philip; Mints, Grigori
22
2005
Finite investigations of transfinite derivations. Zbl 0399.03044
Minc, G. E.
18
1978
Epsilon substitution method for elementary analysis. Zbl 0848.03032
Mints, Grigori; Tupailo, Sergei; Buchholz, Wilfried
16
1996
Derivability of admissible rules. Zbl 0375.02014
Minc, G. E.
12
1976
Closed categories and the theory of proofs. Zbl 0449.03054
Mints, G. E.
12
1981
Indexed systems of sequents and cut-elimination. Zbl 0885.03043
Mints, Grigori
11
1997
Selected papers in proof theory. Zbl 0773.03038
Mints, Grigorii E.
11
1992
A short introduction to modal logic. Zbl 0942.03515
Mints, G.
10
1992
Justification of the structural synthesis of programs. Zbl 0514.68019
Mints, G.; Tyugu, E.
10
1982
The use of abstract language in elementary metamathematics: Some pedagogic examples. Zbl 0318.02003
Kreisel, Georg; Mints, G. E.; Simpson, S. G.
8
1975
A completeness proof for propositional S4 in Cantor space. Zbl 0923.03026
Mints, Grigori
8
1999
The complexity of the disjunction and existential properties in intuitionistic logic. Zbl 0939.03064
Buss, Sam; Mints, Grigori
8
1999
Gentzen-type systems and Hilbert’s epsilon substitution method. I. Zbl 0835.03023
Mints, G. E.
8
1994
Cut-elimination theorem for relevant logics. Zbl 0379.02011
Minc, G. E.
8
1976
Normal forms for sequent derivations. Zbl 0897.03053
Mints, Gregory
8
1996
Derivability of admissible rules. Zbl 0358.02031
Mints, G. E.
7
1973
Propositional logic of continuous transformations in Cantor space. Zbl 1103.03021
Mints, Grigori; Zhang, Ting
6
2005
Sovability of the problem of deducibility in LJ for a class of formulas not containing negative occurrences of quantifiers. Zbl 0208.01101
Mints, G. E.
6
1968
Quantifier-free and one-quantifier systems. Zbl 0252.02027
Minc, G. E.
6
1973
The Skolem method in intuitionistic calculi. Zbl 0286.02030
Minc, G. E.
6
1974
The completeness of provable realizability. Zbl 0704.03004
Mints, G. E.
6
1989
Resolution calculus for the first order linear logic. Zbl 0793.03006
Mints, Grigori
5
1993
Gentzen-type systems and resolution rule. II: Predicate logic. Zbl 0796.03014
Mints, G.
5
1993
Intuitionistic Frege systems are polynomially equivalent. Zbl 1095.03062
Mints, G.; Kojevnikov, A.
5
2004
Condensed detachment is complete for relevance logic: A computer-aided proof. Zbl 0751.03011
Mints, Grigori; Tammet, Tanel
5
1991
The method of Skolem for the elimination of positive quantifiers in sequential calculi. Zbl 0186.00501
Mints, G. E.
5
1966
Axiomatization of a Skolem function in intuitionistic logic. Zbl 0971.03011
Mints, Grigori
5
2000
Interpolation theorems for intuitionistic predicate logic. Zbl 1001.03010
Mints, G.
4
2002
Resolution strategies for the intuitionistic logic. Zbl 0810.03007
Mints, Grigori
4
1994
A proof of topological completeness for S4 in \((0,1)\). Zbl 1133.03009
Mints, Grigori; Zhang, Ting
4
2005
The programming system PRIZ. Zbl 0647.68098
Mints, G.; Tyugu, E.
4
1988
Epsilon-substitution method for the ramified language and \(\Delta_1^1\)-comprehension rule. Zbl 0954.03061
Mints, Grigori; Tupailo, Sergei
4
1999
Proof theory in the USSR 1925-1969. Zbl 0747.03024
Mints, Grigori
4
1991
On some calculi of modal logic. Zbl 0208.01102
Minc, G. E.
4
1968
What can be done in PRA. Zbl 0372.02018
Minc, G. E.
4
1976
Heyting predicate calculus with epsilon symbol. Zbl 0404.03045
Minc, G. E.
4
1977
Cut-elimination for simple type theory with an axiom of choice. Zbl 0930.03080
Mints, G.
3
1999
Strong termination for the epsilon substitution method. Zbl 0870.03023
Mints, Grigori
3
1996
Structural synthesis with independent subproblems and the modal logic S4. Zbl 0589.68027
Mints, G.
3
1984
Complete calculus for pure PROLOG. Zbl 0616.68004
Mints, G.
3
1986
Quantifier-free and one-quantifier systems. Zbl 0222.02022
Mints, G. E.
3
1971
A computer algorithm for the determination of deducibility on the basis of the inverse method. Zbl 0227.68044
Davydov, G. V.; Maslov, S. Yu.; Mints, G. E.; Orevkov, V. P.; Slisenko, A. O.
3
1971
Closed categories and the proof theory. Zbl 0368.02036
Minc, G. E.
3
1977
Failure of interpolation in constant domain intuitionistic logic. Zbl 1327.03007
Mints, Grigori; Olkhovikov, Grigory; Urquhart, Alasdair
3
2013
The PRIZ system and propositional calculus. Zbl 0533.68072
Volozh, B. B.; Matskin, M. B.; Mints, G. E.; Tyugu, Eh. Kh.
3
1983
Embedding operations related to the S. Kripke’s ‘semantics’. Zbl 0166.25001
Mints, G. E.
2
1967
Complexity of subclasses of the intuitionistic propositional calculus. Zbl 0790.03041
Mints, G.
2
1992
A simple proof of second-order strong normalization with permutative conversions. Zbl 1095.03057
Tatsuta, Makoto; Mints, Grigori
2
2005
A termination proof for epsilon substitution using partial derivations. Zbl 1032.03046
Mints, G.
2
2003
Completeness of indexed \(\varepsilon\)-calculus. Zbl 1042.03009
Mints, G. E.; Sarenac, Darko
2
2003
Quick cut-elimination for monotone cuts. Zbl 1043.03042
Mints, Grigori
2
2003
Existential instantiation and strong normalization. Zbl 0887.03041
Mints, G.
2
1997
Calculi of resolution for non-classical logics. Zbl 0632.03011
Mints, G. E.
2
1985
Resolution calculi for modal logics. Zbl 0671.03007
Mints, G.
2
1989
Epsilon-substitution method for hereditarily finite sets. Zbl 0677.03040
Mints, G.
2
1989
Linear lambda-terms and natural deduction. Zbl 0974.03051
Mints, G.
2
1998
Reduction of finite and infinite derivations. Zbl 0964.03057
Mints, G.
2
2000
Unsolvability in the constructive predicate calculus of certain classes of formulas containing only monadic predicate variables. Zbl 0173.01003
Maslov, S. Yu.; Mints, G. E.; Orevkov, V. P.
2
1965
An analogue of Herbrand’s theorem for the constructive predicate calculus. Zbl 0199.03402
Mints, G. E.
2
1962
Cut-free calculi of the S5 type. Zbl 0201.00503
Mints, G. E.
2
1968
Admissible and derived rules. Zbl 0207.00401
Mints, G. E.
2
1968
Exact estimates of the provability of transfinite induction in the initial segments of arithmetic. Zbl 0252.02028
Minc, G. E.
2
1973
A normal form for logical derivations implying one for arithmetic derivations. Zbl 0786.03040
Mints, G.
2
1993
Cut elimination for S4C: A case study. Zbl 1091.03026
Mints, Grigori
2
2006
Nikolai Aleksandrovich Shanin (on his sixtieth birthday). Zbl 0459.01018
Maslov, S. Yu.; Matiyasevich, Yu. V.; Mints, G. E.; Orevkov, V. P.; Slisenko, A. O.
2
1980
A new reduction sequence for arithmetic. Zbl 0492.03021
Minc, G. E.
2
1982
Epsilon substitution for first- and second-order predicate logic. Zbl 1275.03156
Mints, Grigori
2
2013
The Gödel-Tarski translations of intuitionistic propositional formulas. Zbl 1357.03055
Mints, Grigori
2
2012
The completeness of structural synthesis rules. Zbl 0517.68058
Mints, G. E.; Tyugu, Eh. Kh.
2
1982
A simplified consistency proof for arithmetic. Zbl 0523.03043
Mints, G.
2
1982
Non-deterministic epsilon substitution for \(\mathrm{ID}_1\): effective proof. Zbl 1319.03061
Mints, Grigori
1
2012
The logic of transitive and dense frames: from the step-frame analysis to full cut-elimination. Zbl 1343.03013
Ghilardi, Silvio; Mints, Grigori
1
2014
ADC method of proof search for intuitionistic propositional natural deduction. Zbl 1444.03160
Mints, G.; Steinert-Threlkeld, Sh.
1
2016
An extension of the omega-rule. Zbl 1341.03086
Akiyoshi, Ryota; Mints, Grigori
1
2016
Problems of reducing the exhaustive search. Transl. from the Russian by V. Minachin. Zbl 0853.00021
Kreinovich, V. (ed.); Mints, G. (ed.)
1
1997
Nikolai Aleksandrovich Shanin (on his 80th birthday). Zbl 1017.01517
Vsemirnov, M. A.; Girsh, È. A.; Grigor’ev, D. Yu.; Davydov, G. V.; Dantsin, E. Ya.; Ivanov, A. A.; Konev, B. Yu.; Lifshits, V. A.; Matiyasevich, Yu. V.; Mints, G. E.; Orevkov, V. P.; Slisenko, A. O.
1
2001
Transfinite expansions of arithmetic formulas. Zbl 0319.02026
Mints, G. E.
1
1975
Thoralf Skolem and the epsilon substitution method for predicate logic. Zbl 0885.03004
Mints, Grigori
1
1996
Semantics of a declarative language. Zbl 0607.68006
Mints, G.; Tyugu, E.
1
1986
Calculi of resolution for modal logics. Zbl 0632.03012
Mints, G.
1
1986
Several formal systems of the logic programming. Zbl 0695.68062
Mints, Grigorii Efroimovich
1
1990
Choice of terms in quantifier rules of the constructive predicate calculus. Zbl 0186.00502
Mints, G. E.
1
1967
Cut elimination for a simple formulation of epsilon calculus. Zbl 1136.03037
Mints, G.
1
2008
Transfer of sequent calculus strategies to resolution for S4. Zbl 0869.03010
Mints, Grigori; Orevkov, Vladimir; Tammet, Tanel
1
1996
Nikolaj Aleksandrovich Shanin (on his seventieth birthday). Zbl 0704.01021
Matiyasevich, Yu. V.; Mints, G. E.; Orevkov, V. P.; Slisenko, A. O.
1
1990
An extension of the theorems of Glivenko and Kreisel to a certain class of formulas of predicate calculus. Zbl 0133.24901
Mints, G. E.; Orevkov, E. P.
1
1963
Herbrand’s theorem for the predicate calculus with equality and functional symbols. Zbl 0156.25002
Mints, G. E.
1
1966
Finite investigation of infinite derivations. Zbl 0341.02020
Minc, G. E.
1
1975
Heyting predicate calculus with \(\varepsilon\)-symbol. Zbl 0358.02023
Mints, G. E.
1
1974
Cutelimination theorem for relevance logics. Zbl 0374.02017
Minc, G. E.
1
1973
Logical equations in monadic logic. Zbl 1190.03014
Mints, G.; Hoshi, T.
1
2009
Notes on constructive negation. Zbl 1108.03057
Mints, Grigori
1
2006
Decidability of the class E by Maslov’s inverse method. Zbl 1287.03028
Mints, Grigori
1
2010
Non-deterministic epsilon substitution method for \(\mathsf{PA}\) and \(\mathsf{ID}_1\). Zbl 1380.03063
Mints, Grigori
1
2015
Effective cut-elimination for a fragment of modal mu-calculus. Zbl 1254.03110
Mints, Grigori
1
2012
Category theory and proof theory. Zbl 0514.03042
Minc, G. E.
1
1980
ADC method of proof search for intuitionistic propositional natural deduction. Zbl 1444.03160
Mints, G.; Steinert-Threlkeld, Sh.
1
2016
An extension of the omega-rule. Zbl 1341.03086
Akiyoshi, Ryota; Mints, Grigori
1
2016
Non-deterministic epsilon substitution method for \(\mathsf{PA}\) and \(\mathsf{ID}_1\). Zbl 1380.03063
Mints, Grigori
1
2015
The logic of transitive and dense frames: from the step-frame analysis to full cut-elimination. Zbl 1343.03013
Ghilardi, Silvio; Mints, Grigori
1
2014
Failure of interpolation in constant domain intuitionistic logic. Zbl 1327.03007
Mints, Grigori; Olkhovikov, Grigory; Urquhart, Alasdair
3
2013
Epsilon substitution for first- and second-order predicate logic. Zbl 1275.03156
Mints, Grigori
2
2013
The Gödel-Tarski translations of intuitionistic propositional formulas. Zbl 1357.03055
Mints, Grigori
2
2012
Non-deterministic epsilon substitution for \(\mathrm{ID}_1\): effective proof. Zbl 1319.03061
Mints, Grigori
1
2012
Effective cut-elimination for a fragment of modal mu-calculus. Zbl 1254.03110
Mints, Grigori
1
2012
Decidability of the class E by Maslov’s inverse method. Zbl 1287.03028
Mints, Grigori
1
2010
Logical equations in monadic logic. Zbl 1190.03014
Mints, G.; Hoshi, T.
1
2009
Cut elimination for a simple formulation of epsilon calculus. Zbl 1136.03037
Mints, G.
1
2008
Cut elimination for S4C: A case study. Zbl 1091.03026
Mints, Grigori
2
2006
Notes on constructive negation. Zbl 1108.03057
Mints, Grigori
1
2006
Dynamic topological logic. Zbl 1067.03028
Kremer, Philip; Mints, Grigori
22
2005
Propositional logic of continuous transformations in Cantor space. Zbl 1103.03021
Mints, Grigori; Zhang, Ting
6
2005
A proof of topological completeness for S4 in \((0,1)\). Zbl 1133.03009
Mints, Grigori; Zhang, Ting
4
2005
A simple proof of second-order strong normalization with permutative conversions. Zbl 1095.03057
Tatsuta, Makoto; Mints, Grigori
2
2005
Intuitionistic Frege systems are polynomially equivalent. Zbl 1095.03062
Mints, G.; Kojevnikov, A.
5
2004
A termination proof for epsilon substitution using partial derivations. Zbl 1032.03046
Mints, G.
2
2003
Completeness of indexed \(\varepsilon\)-calculus. Zbl 1042.03009
Mints, G. E.; Sarenac, Darko
2
2003
Quick cut-elimination for monotone cuts. Zbl 1043.03042
Mints, Grigori
2
2003
Interpolation theorems for intuitionistic predicate logic. Zbl 1001.03010
Mints, G.
4
2002
Nikolai Aleksandrovich Shanin (on his 80th birthday). Zbl 1017.01517
Vsemirnov, M. A.; Girsh, È. A.; Grigor’ev, D. Yu.; Davydov, G. V.; Dantsin, E. Ya.; Ivanov, A. A.; Konev, B. Yu.; Lifshits, V. A.; Matiyasevich, Yu. V.; Mints, G. E.; Orevkov, V. P.; Slisenko, A. O.
1
2001
A short introduction to intuitionistic logic. Zbl 1036.03003
Mints, Grigori
27
2000
Axiomatization of a Skolem function in intuitionistic logic. Zbl 0971.03011
Mints, Grigori
5
2000
Reduction of finite and infinite derivations. Zbl 0964.03057
Mints, G.
2
2000
A completeness proof for propositional S4 in Cantor space. Zbl 0923.03026
Mints, Grigori
8
1999
The complexity of the disjunction and existential properties in intuitionistic logic. Zbl 0939.03064
Buss, Sam; Mints, Grigori
8
1999
Epsilon-substitution method for the ramified language and \(\Delta_1^1\)-comprehension rule. Zbl 0954.03061
Mints, Grigori; Tupailo, Sergei
4
1999
Cut-elimination for simple type theory with an axiom of choice. Zbl 0930.03080
Mints, G.
3
1999
Linear lambda-terms and natural deduction. Zbl 0974.03051
Mints, G.
2
1998
Indexed systems of sequents and cut-elimination. Zbl 0885.03043
Mints, Grigori
11
1997
Existential instantiation and strong normalization. Zbl 0887.03041
Mints, G.
2
1997
Problems of reducing the exhaustive search. Transl. from the Russian by V. Minachin. Zbl 0853.00021
Kreinovich, V.; Mints, G.
1
1997
Epsilon substitution method for elementary analysis. Zbl 0848.03032
Mints, Grigori; Tupailo, Sergei; Buchholz, Wilfried
16
1996
Normal forms for sequent derivations. Zbl 0897.03053
Mints, Gregory
8
1996
Strong termination for the epsilon substitution method. Zbl 0870.03023
Mints, Grigori
3
1996
Thoralf Skolem and the epsilon substitution method for predicate logic. Zbl 0885.03004
Mints, Grigori
1
1996
Transfer of sequent calculus strategies to resolution for S4. Zbl 0869.03010
Mints, Grigori; Orevkov, Vladimir; Tammet, Tanel
1
1996
Gentzen-type systems and Hilbert’s epsilon substitution method. I. Zbl 0835.03023
Mints, G. E.
8
1994
Resolution strategies for the intuitionistic logic. Zbl 0810.03007
Mints, Grigori
4
1994
Resolution calculus for the first order linear logic. Zbl 0793.03006
Mints, Grigori
5
1993
Gentzen-type systems and resolution rule. II: Predicate logic. Zbl 0796.03014
Mints, G.
5
1993
A normal form for logical derivations implying one for arithmetic derivations. Zbl 0786.03040
Mints, G.
2
1993
Selected papers in proof theory. Zbl 0773.03038
Mints, Grigorii E.
11
1992
A short introduction to modal logic. Zbl 0942.03515
Mints, G.
10
1992
Complexity of subclasses of the intuitionistic propositional calculus. Zbl 0790.03041
Mints, G.
2
1992
Condensed detachment is complete for relevance logic: A computer-aided proof. Zbl 0751.03011
Mints, Grigori; Tammet, Tanel
5
1991
Proof theory in the USSR 1925-1969. Zbl 0747.03024
Mints, Grigori
4
1991
Gentzen-type systems and resolution rules. I: Propositional logic. Zbl 0739.03011
Mints, G.
25
1990
Several formal systems of the logic programming. Zbl 0695.68062
Mints, Grigorii Efroimovich
1
1990
Nikolaj Aleksandrovich Shanin (on his seventieth birthday). Zbl 0704.01021
Matiyasevich, Yu. V.; Mints, G. E.; Orevkov, V. P.; Slisenko, A. O.
1
1990
The completeness of provable realizability. Zbl 0704.03004
Mints, G. E.
6
1989
Resolution calculi for modal logics. Zbl 0671.03007
Mints, G.
2
1989
Epsilon-substitution method for hereditarily finite sets. Zbl 0677.03040
Mints, G.
2
1989
The programming system PRIZ. Zbl 0647.68098
Mints, G.; Tyugu, E.
4
1988
Complete calculus for pure PROLOG. Zbl 0616.68004
Mints, G.
3
1986
Semantics of a declarative language. Zbl 0607.68006
Mints, G.; Tyugu, E.
1
1986
Calculi of resolution for modal logics. Zbl 0632.03012
Mints, G.
1
1986
Calculi of resolution for non-classical logics. Zbl 0632.03011
Mints, G. E.
2
1985
Structural synthesis with independent subproblems and the modal logic S4. Zbl 0589.68027
Mints, G.
3
1984
The PRIZ system and propositional calculus. Zbl 0533.68072
Volozh, B. B.; Matskin, M. B.; Mints, G. E.; Tyugu, Eh. Kh.
3
1983
Justification of the structural synthesis of programs. Zbl 0514.68019
Mints, G.; Tyugu, E.
10
1982
A new reduction sequence for arithmetic. Zbl 0492.03021
Minc, G. E.
2
1982
The completeness of structural synthesis rules. Zbl 0517.68058
Mints, G. E.; Tyugu, Eh. Kh.
2
1982
A simplified consistency proof for arithmetic. Zbl 0523.03043
Mints, G.
2
1982
Closed categories and the theory of proofs. Zbl 0449.03054
Mints, G. E.
12
1981
Nikolai Aleksandrovich Shanin (on his sixtieth birthday). Zbl 0459.01018
Maslov, S. Yu.; Matiyasevich, Yu. V.; Mints, G. E.; Orevkov, V. P.; Slisenko, A. O.
2
1980
Category theory and proof theory. Zbl 0514.03042
Minc, G. E.
1
1980
Finite investigations of transfinite derivations. Zbl 0399.03044
Minc, G. E.
18
1978
Heyting predicate calculus with epsilon symbol. Zbl 0404.03045
Minc, G. E.
4
1977
Closed categories and the proof theory. Zbl 0368.02036
Minc, G. E.
3
1977
Derivability of admissible rules. Zbl 0375.02014
Minc, G. E.
12
1976
Cut-elimination theorem for relevant logics. Zbl 0379.02011
Minc, G. E.
8
1976
What can be done in PRA. Zbl 0372.02018
Minc, G. E.
4
1976
The use of abstract language in elementary metamathematics: Some pedagogic examples. Zbl 0318.02003
Kreisel, Georg; Mints, G. E.; Simpson, S. G.
8
1975
Transfinite expansions of arithmetic formulas. Zbl 0319.02026
Mints, G. E.
1
1975
Finite investigation of infinite derivations. Zbl 0341.02020
Minc, G. E.
1
1975
The Skolem method in intuitionistic calculi. Zbl 0286.02030
Minc, G. E.
6
1974
Heyting predicate calculus with \(\varepsilon\)-symbol. Zbl 0358.02023
Mints, G. E.
1
1974
Derivability of admissible rules. Zbl 0358.02031
Mints, G. E.
7
1973
Quantifier-free and one-quantifier systems. Zbl 0252.02027
Minc, G. E.
6
1973
Exact estimates of the provability of transfinite induction in the initial segments of arithmetic. Zbl 0252.02028
Minc, G. E.
2
1973
Cutelimination theorem for relevance logics. Zbl 0374.02017
Minc, G. E.
1
1973
Quantifier-free and one-quantifier systems. Zbl 0222.02022
Mints, G. E.
3
1971
A computer algorithm for the determination of deducibility on the basis of the inverse method. Zbl 0227.68044
Davydov, G. V.; Maslov, S. Yu.; Mints, G. E.; Orevkov, V. P.; Slisenko, A. O.
3
1971
Sovability of the problem of deducibility in LJ for a class of formulas not containing negative occurrences of quantifiers. Zbl 0208.01101
Mints, G. E.
6
1968
On some calculi of modal logic. Zbl 0208.01102
Minc, G. E.
4
1968
Cut-free calculi of the S5 type. Zbl 0201.00503
Mints, G. E.
2
1968
Admissible and derived rules. Zbl 0207.00401
Mints, G. E.
2
1968
Embedding operations related to the S. Kripke’s ‘semantics’. Zbl 0166.25001
Mints, G. E.
2
1967
Choice of terms in quantifier rules of the constructive predicate calculus. Zbl 0186.00502
Mints, G. E.
1
1967
The method of Skolem for the elimination of positive quantifiers in sequential calculi. Zbl 0186.00501
Mints, G. E.
5
1966
Herbrand’s theorem for the predicate calculus with equality and functional symbols. Zbl 0156.25002
Mints, G. E.
1
1966
Unsolvability in the constructive predicate calculus of certain classes of formulas containing only monadic predicate variables. Zbl 0173.01003
Maslov, S. Yu.; Mints, G. E.; Orevkov, V. P.
2
1965
An extension of the theorems of Glivenko and Kreisel to a certain class of formulas of predicate calculus. Zbl 0133.24901
Mints, G. E.; Orevkov, E. P.
1
1963
An analogue of Herbrand’s theorem for the constructive predicate calculus. Zbl 0199.03402
Mints, G. E.
2
1962
all top 5

Cited by 301 Authors

34 Mints, Grigoriĭ Efroimovich
9 Rybakov, Vladimir Vladimirovich
7 Solov’ëv, Sergeĭ Vladimirovich
6 Iemhoff, Rosalie
5 Arai, Toshiyasu
5 Baaz, Matthias
5 Bezhanishvili, Guram
5 Fernández Duque, David
5 Tyugu, Ènn Kharal’dovich
4 Aschieri, Federico
4 Goudsmit, Jeroen P.
4 Kremer, Philip
4 Negri, Sara
4 Orevkov, V. P.
4 Ramanayake, Revantha
4 Tammet, Tanel
4 Urzyczyn, Paweł
3 Bezhanishvili, Nick
3 Buchholz, Wilfried
3 Dyckhoff, Roy
3 Gabelaia, David
3 Jeřábek, Emil
3 Lando, Tamar
3 Schröder, Lutz
3 Tatsuta, Makoto
3 Wansing, Heinrich Theodor
3 Wolter, Frank
3 Zach, Richard
3 Zakharyaschev, Michael Viktorovich
2 Aehlig, Klaus
2 Areces, Carlos
2 Avigad, Jeremy
2 Başkent, Can
2 Beckmann, Arnold
2 Benzmüller, Christoph Ewald
2 Blute, Richard F.
2 Ciabattoni, Agata
2 Citkin, Alex
2 Collins, Peter J.
2 Demri, Stéphane P.
2 Dowek, Gilles
2 Galmiche, Didier
2 Goré, Rajeev Prabhakar
2 Gorín, Daniel
2 Gurevich, Yuri
2 Hirokawa, Sachio
2 Hrubeš, Pavel
2 Ilić, Mirjana
2 Jiang, Ying
2 Joosten, Joost J.
2 Kamide, Norihiro
2 Kanazawa, Makoto
2 Kurokawa, Hidenori
2 Kurucz, Agi
2 Kuznets, Roman
2 Leitsch, Alexander
2 Lifschitz, Vladimir
2 Lucero-Bryan, Joel Gregory
2 Margenstern, Maurice
2 Méhats, Laurent
2 Moser, Georg
2 Olkhovikov, Grigory K.
2 Pasquali, Fabio
2 Pattinson, Dirk
2 Penjam, Jaan
2 Pudlák, Pavel
2 Pym, David J.
2 Rasga, João
2 Salehi, Saeed
2 Schubert, Aleksy
2 Schwichtenberg, Helmut
2 Sieg, Wilfried
2 Smith, Jan M.
2 Strahm, Thomas
2 ten Cate, Balder David
2 Towsner, Henry
2 van Mill, Jan
2 Zapreev, Ivan S.
2 Zaslavskii, Igor Dmitrievich
1 Aguilera, Juan Pablo
1 Akiyoshi, Ryota
1 Alexi, Werner
1 Alonderis, Romas
1 Andrikonis, Julius
1 Antoniou, Grigoris
1 Ardeshir, Mohammad
1 Avron, Arnon
1 Babenyshev, Sergey
1 Backes, Julian
1 Barbanera, Franco
1 Beckert, Bernhard
1 Beeson, Michael J.
1 Bellotti, Luca
1 Beyersdorff, Olaf
1 Bjørner, Nikolaj S.
1 Blass, Andreas Raphael
1 Bolotov, Alexander
1 Borisavljevi, Mirjana
1 Borisavljević, Mirjana
1 Bourreau, Pierre
...and 201 more Authors
all top 5

Cited in 48 Serials

60 Annals of Pure and Applied Logic
26 Theoretical Computer Science
23 Archive for Mathematical Logic
22 Studia Logica
14 The Journal of Symbolic Logic
9 Journal of Philosophical Logic
9 Notre Dame Journal of Formal Logic
8 Journal of Soviet Mathematics
6 Journal of Automated Reasoning
6 The Bulletin of Symbolic Logic
5 Archiv für Mathematische Logik und Grundlagenforschung
5 Lithuanian Mathematical Journal
5 MSCS. Mathematical Structures in Computer Science
5 The Review of Symbolic Logic
4 Journal of Mathematical Sciences (New York)
4 Journal of Applied Logic
4 Logica Universalis
3 Artificial Intelligence
3 Journal of Pure and Applied Algebra
3 Synthese
3 Logical Methods in Computer Science
2 Information Processing Letters
2 Algebra and Logic
2 Programming and Computer Software
2 Journal of Symbolic Computation
2 Information and Computation
2 Indagationes Mathematicae. New Series
2 Journal of Logic, Language and Information
2 Mathematical Logic Quarterly (MLQ)
2 Theory of Computing Systems
2 Soft Computing
2 The Journal of Logic and Algebraic Programming
2 ACM Transactions on Computational Logic
1 Russian Mathematical Surveys
1 Advances in Mathematics
1 BIT
1 International Journal of Mathematics and Mathematical Sciences
1 Formal Aspects of Computing
1 International Journal of Foundations of Computer Science
1 Cybernetics and Systems Analysis
1 Computational Complexity
1 Journal of Computer and Systems Sciences International
1 Journal of Applied Non-Classical Logics
1 Diagrammes
1 Integral Transforms and Special Functions
1 Annals of Mathematics and Artificial Intelligence
1 Erkenntnis
1 Theory and Practice of Logic Programming

Citations by Year

Wikidata Timeline

The data are displayed as stored in Wikidata under a Creative Commons CC0 License. Updates and corrections should be made in Wikidata.