default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDGrigori Mints
Person information
- affiliation: Stanford University, Department of Philosophy, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2017
[j42]Grigori Mints:
Classical and Intuitionistic Geometric Logic. FLAP 4(4) (2017)- 2016
- [j41]Ryota Akiyoshi, Grigori Mints:
An extension of the omega-rule. Arch. Math. Log. 55(3-4): 593-603 (2016) - [j40]Grigori Mints, Shane Steinert-Threlkeld:
ADC method of proof search for intuitionistic propositional natural deduction. J. Log. Comput. 26(1): 395-408 (2016) - 2014
- [j39]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): 585-596 (2014) - 2013
- [j38]Grigori Mints:
Epsilon substitution for first- and second-order predicate logic. Ann. Pure Appl. Log. 164(6): 733-739 (2013) - [j37]Grigori Mints, Grigory K. Olkhovikov, Alasdair Urquhart:
Failure of interpolation in constant domain intuitionistic logic. J. Symb. Log. 78(3): 937-950 (2013) - 2012
- [j36]Grigori Mints:
Effective Cut-elimination for a Fragment of Modal mu-calculus. Stud Logica 100(1-2): 279-287 (2012) - [c14]Grigori Mints:
The Gödel-Tarski Translations of Intuitionistic Propositional Formulas. Correct Reasoning 2012: 487-491 - [c13]Grigori Mints, Thomas Studer:
Cut-elimination for the mu-calculus with one variable. FICS 2012: 47-54 - [i1]Grigori Mints:
Intuitionistic Existential Instantiation and Epsilon Symbol. CoRR abs/1208.0861 (2012) - 2011
- [c12]Grigori Mints:
Countable Version of Omega-Rule. WoLLIC 2011: 201-209 - 2010
- [j35]Sergei N. Artëmov, Yuri V. Matiyasevich, Grigori Mints, Anatol Slissenko:
Preface. Ann. Pure Appl. Log. 162(3): 173-174 (2010) - [j34]Grigori Mints:
Cut-free formulations for a quantified logic of here and there. Ann. Pure Appl. Log. 162(3): 237-242 (2010) - [c11]Grigori Mints:
Decidability of the Class E by Maslov's Inverse Method. Fields of Logic and Computation 2010: 529-537
2000 – 2009
- 2009
- [j33]Grigori Mints, Valeria de Paiva, Ruy J. G. B. de Queiroz:
Logic, Language, Information and Computation. Inf. Comput. 207(10): 969-970 (2009) - 2008
- [j32]Grigori Mints:
Cut elimination for a simple formulation of epsilon calculus. Ann. Pure Appl. Log. 152(1-3): 148-160 (2008) - [c10]Grigori Mints:
Proof Search Tree and Cut Elimination. Pillars of Computer Science 2008: 521-536 - 2007
- [p3]Philip Kremer, Grigori Mints:
Dynamic Topological Logic. Handbook of Spatial Logics 2007: 565-606 - 2006
- [j31]Grigori Mints:
S4 is Topologically Complete for (0, 1): a Short Proof. Log. J. IGPL 14(1): 63-71 (2006) - [j30]Grigori Mints:
Cut Elimination for S4C: A Case Study. Stud Logica 82(1): 121-132 (2006) - [j29]Grigori Mints:
Notes on Constructive Negation. Synth. 148(3): 701-717 (2006) - [c9]Grigori Mints:
Unwinding a Non-effective Cut Elimination Proof. CSR 2006: 259-269 - [c8]Grigori Mints, Ruy J. G. B. de Queiroz:
Preface. WoLLIC 2006: 1-3 - [e2]Grigori Mints, Ruy J. G. B. de Queiroz:
Proceedings of the 13th Workshop on Logic, Language, Information and Computation, WoLLIC 2006, Stanford University, CA, USA, July 18-21, 2006. Electronic Notes in Theoretical Computer Science 165, Elsevier 2006 [contents] - 2005
- [j28]Grigori Mints, Ting Zhang:
Propositional logic of continuous transformations in Cantor space. Arch. Math. Log. 44(6): 783-799 (2005) - [j27]Philip Kremer, Grigori Mints:
Dynamic topological logic. Ann. Pure Appl. Log. 131(1-3): 133-158 (2005) - [j26]Grigori Mints, Ting Zhang:
A proof of topological completeness for S4 in (0, 1). Ann. Pure Appl. Log. 133(1-3): 231-245 (2005) - [j25]Makoto Tatsuta, Grigori Mints:
A simple proof of second-order strong normalization with permutative conversions. Ann. Pure Appl. Log. 136(1-2): 134-155 (2005) - [c7]Grigori Mints:
Cut Elimination for a Simple Formulation of PAepsilon. WoLLIC 2005: 159-169 - 2003
- [j24]Grigori Mints, Darko Sarenac:
Completeness of indexed epsilon-calculus. Arch. Math. Log. 42(7): 617-625 (2003) - [j23]Grigori Mints:
A termination proof for epsilon substitution using partial derivations. Theor. Comput. Sci. 303(1): 187-213 (2003) - 2001
- [j22]Grigori Mints:
Interpolation theorems for intuitionistic predicate logic. Ann. Pure Appl. Log. 113(1-3): 225-242 (2001) - 2000
- [j21]Grigori Mints:
Reduction of finite and infinite derivations. Ann. Pure Appl. Log. 104(1-3): 167-188 (2000) - [j20]Toshiyasu Arai, Grigori Mints:
Extended normal form theorems for logical proofs from axioms. Theor. Comput. Sci. 232(1-2): 121-132 (2000)
1990 – 1999
- 1999
- [j19]Samuel R. Buss, Grigori Mints:
The Complexity of the Disjunction and Existential Properties in Intuitionistic Logic. Ann. Pure Appl. Log. 99(1-3): 93-104 (1999) - [j18]Grigori Mints:
Cut-Elimination for Simple Type Theory with An Axiom of Choice. J. Symb. Log. 64(2): 479-485 (1999) - 1998
- [j17]Grigori Mints:
Normal deduction in the intuitionistic linear logic. Arch. Math. Log. 37(5-6): 415-425 (1998) - [j16]Grigori Mints:
Linear Lambda-Terms and Natural Deduction. Stud Logica 60(1): 209-231 (1998) - 1997
- [j15]Grigori Mints:
Indexed systems of sequents and cut-elimination. J. Philos. Log. 26(6): 671-696 (1997) - [c6]Grigori Mints:
Existential Instantiation and Strong Normalization. LFCS 1997: 258-265 - [c5]Grigori Mints:
Three Faces of Natural Deduction. TABLEAUX 1997: 16-30 - 1996
- [j14]Grigori Mints, Sergei Tupailo, Wilfried Buchholz:
Epsilon substitution method for elementary analysis. Arch. Math. Log. 35(2): 103-130 (1996) - [j13]Grigori Mints:
Strong Termination for the Epsilong Substitution Method. J. Symb. Log. 61(4): 1193-1205 (1996) - 1993
- [j12]Grigori Mints:
A Normal Form for Logical Derivations Implying One for Arithmetic Derivations. Ann. Pure Appl. Log. 62(1): 65-79 (1993) - [j11]Grigori Mints:
Resolution calculus for the first order linear logic. J. Log. Lang. Inf. 2(1): 59-83 (1993) - [c4]Grigori Mints:
Strategies for Resolution Method in Non-classical Logics (Abstract). Kurt Gödel Colloquium 1993: 62 - [c3]Grigori Mints:
Resolution Strategies for the Intuitionistic Logic. NATO ASI CP 1993: 289-311 - 1992
- [j10]Grigori Mints:
Complexity of Subclasses of the Intuitionistic Propositional Calculus. BIT 32(1): 64-69 (1992) - 1991
- [j9]Grigori Mints, Tanel Tammet:
Condensed Detachment is Complete for Relevance Logic: A Computer-Aided Proof. J. Autom. Reason. 7(4): 587-596 (1991) - [j8]Grigori Mints:
Proof Theory in the USSR 1925-1969. J. Symb. Log. 56(2): 385-424 (1991) - [p2]Grigori Mints, Enn Tyugu:
The Programming System PRIZ. Baltic Computer Science 1991: 1-17 - [p1]Grigori Mints, Jan M. Smith, Enn Tyugu:
Type-theoretical Semantics of Some Declarative Languages. Baltic Computer Science 1991: 18-32 - 1990
- [j7]Grigori Mints, Enn Tyugu:
Editorial. J. Log. Program. 9(2&3): 139-140 (1990) - [j6]Grigori Mints, Enn Tyugu:
Propositional Logic Programming and Priz System. J. Log. Program. 9(2&3): 179-193 (1990) - [e1]Per Martin-Löf, Grigori Mints:
COLOG-88, International Conference on Computer Logic, Tallinn, USSR, December 1988, Proceedings. Lecture Notes in Computer Science 417, Springer 1990, ISBN 3-540-52335-9 [contents]
1980 – 1989
- 1989
- [j5]Grigori Mints:
The Completeness of Provable Realizability. Notre Dame J. Formal Log. 30(3): 420-441 (1989) - 1988
- [j4]Grigori Mints, Enn Tyugu:
The Programming System PRIZ. J. Symb. Comput. 5(3): 359-375 (1988) - [c2]Grigori Mints:
Gentzen-type systems and resolution rules. Part I. Propositional logic. Conference on Computer Logic 1988: 198-231 - 1987
- [j3]Grigori Mints, Enn Tyugu:
Corrigendum: Semantics of a Declarative Language. Inf. Process. Lett. 25(2): 139 (1987) - [c1]Grigori Mints:
Some Formal Systems of the Logic Programming. FCT 1987: 318-322 - 1986
- [j2]Grigori Mints, Enn Tyugu:
Semantics of a Declarative Language. Inf. Process. Lett. 23(3): 147-151 (1986) - 1982
- [j1]Grigori Mints, Enn Tyugu:
Justifications of the Structural Synthesis of Programs. Sci. Comput. Program. 2(3): 215-240 (1982)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:00 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
