51 found
Sort by:
Disambiguations:
Grigori Mints [28]G. Mints [14]G. E. Mints [8]G. . E. Mints [1]
  1. Grigori Mints (2013). Epsilon Substitution for First-and Second-Order Predicate Logic. Annals of Pure and Applied Logic 164 (6):733-739.
    Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  2. Grigori Mints (2012). Effective Cut-Elimination for a Fragment of Modal Mu-Calculus. Studia Logica 100 (1-2):279-287.
    A non-effective cut-elimination proof for modal mu-calculus has been given by G. Jäger, M. Kretz and T. Studer. Later an effective proof has been given for a subsystem M 1 with non-iterated fixpoints and positive endsequents. Using a new device we give an effective cut-elimination proof for M 1 without restriction to positive sequents.
    Direct download (6 more)  
     
    My bibliography  
     
    Export citation  
  3. Sergei Artemov, Yuri Matiyasevich, Grigori Mints & Anatol Slissenko (2010). Preface. Annals of Pure and Applied Logic 162 (3):173-174.
    Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  4. Grigori Mints (2010). Cut-Free Formulations for a Quantified Logic of Here and There. Annals of Pure and Applied Logic 162 (3):237-242.
    Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  5. John Baldwin, Lev Beklemishev, Anuj Dawar, Mirna Dzamonja, David Evans, Erich Grädel, Denis Hirschfeldt, Hannes Leitgeb, Roger Maddux & Grigori Mints (2008). Vassar College, 124 Raymond Avenue, Poughkeepsie, Ny 12604, Usa. In a Review, a Reference “Jsl Xliii 148,” for Example, Refers Either to the Publication Reviewed on Page 148 of Volume 43 of the Journal, or to the Review Itself (Which Contains Full Bibliographical Information for the Reviewed Publication). Analogously, a Reference “Bsl VII 376” Refers to the Review Beginning on Page 376 in Volume 7 of This Bulletin, Or. [REVIEW] Bulletin of Symbolic Logic 14 (1).
    Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  6. Anuj Dawar Beklemishev, Mirna Dzamonja, David Evans, Erich Grädel, Denis Hirschfeldt, Hannes Leitgeb, Roger Maddux, Grigori Mints, Volker Peckhaus & Sławomir Solecki (2008). Vassar College, 124 Raymond Avenue, Poughkeepsie, Ny 12604, Usa. In a Review, a Reference “Jsl Xliii 148,” for Example, Refers Either to the Publication Reviewed on Page 148 of Volume 43 of the Journal, or to the Review Itself (Which Contains Full Bibliographical Information for the Reviewed Publication). Analogously, a Reference “Bsl VII 376” Refers to the Review Beginning on Page 376 in Volume 7 of This Bulletin, Or. [REVIEW] Bulletin of Symbolic Logic 14 (4).
    Direct download  
     
    My bibliography  
     
    Export citation  
  7. Denis Hirschfeldt, Hannes Leitgeb, Roger Maddux, Grigori Mints & Volker Peckhaus (2008). Reviewed on Page 148 of Volume 43 of the Journal, or to the Review Itself (Which Contains Full Bibliographical Information for the Reviewed Publication). Analogously, a Reference" Bsl VII 376" Refers to the Review Beginning on Page 376 in Volume 7 of This Bulletin, or to the Publication There Reviewed." Jsl Lv 347" Refers to One of the Reviews or One of the Publications Reviewed or Listed on Page 347 of Volume 55 of the Journal, with Reliance On. [REVIEW] Bulletin of Symbolic Logic 14 (3).
    Direct download  
     
    My bibliography  
     
    Export citation  
  8. Denis Hirschfeldt, Hannes Leitgeb, Roger Maddux, Grigori Mints & Volker Peckhaus (2008). The Association for Symbolic Logic Publishes Analytical Reviews of Selected Books and Articles in the Field of Symbolic Logic. The Reviews Were Published in The Journal of Symbolic Logic From the Founding of the Journal in 1936 Until the End of 1999. The Association Moved the Reviews to This Bulletin, Beginning in 2000. The Reviews Section is Edited by Alasdair Urquhart (Managing Editor), Steve Awodey. [REVIEW] Bulletin of Symbolic Logic 14 (2).
     
    My bibliography  
     
    Export citation  
  9. Grigori Mints (2008). Cut Elimination for a Simple Formulation of Epsilon Calculus. Annals of Pure and Applied Logic 152 (1):148-160.
    Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  10. Grigori Mints (2006). Cut Elimination for S4c: A Case Study. Studia Logica 82 (1):121 - 132.
    S4C is a logic of continuous transformations of a topological space. Cut elimination for it requires new kind of rules and new kinds of reductions.
    Direct download (6 more)  
     
    My bibliography  
     
    Export citation  
  11. Grigori Mints (2006). Notes on Constructive Negation. Synthese 148 (3):701 - 717.
    We put together several observations on constructive negation. First, Russell anticipated intuitionistic logic by clearly distinguishing propositional principles implying the law of the excluded middle from remaining valid principles. He stated what was later called Peirce’s law. This is important in connection with the method used later by Heyting for developing his axiomatization of intuitionistic logic. Second, a work by Dragalin and his students provides easy embeddings of classical arithmetic and analysis into intuitionistic negationless systems. In the last section, we (...)
    Direct download (6 more)  
     
    My bibliography  
     
    Export citation  
  12. Philip Kremer & Grigori Mints (2005). Dynamic Topological Logic. Annals of Pure and Applied Logic 131 (1-3):133-158.
    Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  13. G. Mints, R. Muskens & Ian Hodkinson (2005). REVIEWS-Games, Logic, and Constructive Sets. Bulletin of Symbolic Logic 11 (3):439-441.
    No categories
     
    My bibliography  
     
    Export citation  
  14. Grigori Mints & Ting Zhang (2005). A Proof of Topological Completeness for S4 in (0, 1). Annals of Pure and Applied Logic 133 (1-3):231-245.
    Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  15. Grigori Mints & Ting Zhang (2005). Propositional Logic of Continuous Transformations in Cantor Space. Archive for Mathematical Logic 44 (6):783-799.
    No categories
    Direct download (5 more)  
     
    My bibliography  
     
    Export citation  
  16. Makoto Tatsuta & Grigori Mints (2005). A Simple Proof of Second-Order Strong Normalization with Permutative Conversions. Annals of Pure and Applied Logic 136 (1-2):134-155.
    Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  17. G. E. Mints & Darko Sarenac (2003). Completeness of Indexed Ε-Calculus. Archive for Mathematical Logic 42 (7):617-625.
    Epsilon terms indexed by contexts were used by K. von Heusinger to represent definite and indefinite noun phrases as well as some other constructs of natural language. We provide a language and a complete first order system allowing to formalize basic aspects of this representation. The main axiom says that for any finite collection S 1,…,S k of distinct definable sets and elements a 1,…,a k of these sets there exists a choice function assigning a i to S i for (...)
    No categories
    Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  18. Michael Detlefsen, Erich Reck, Colin McLarty, Rohit Parikh, Larry Moss, Scott Weinstein, Gabriel Uzquiano, Grigori Mints & Richard Zach (2001). 2000-2001 Spring Meeting of the Association for Symbolic Logic. Bulletin of Symbolic Logic 7 (3).
     
    My bibliography  
     
    Export citation  
  19. Michael Detlefsen, Erich Reck, Colin McLarty, Rohit Parikh, Larry Moss, Scott Weinstein, Gabriel Uzquiano, Grigori Mints & Richard Zach (2001). The Minneapolis Hyatt Regency, Minneapolis, Minnesota May 3–4, 2001. Bulletin of Symbolic Logic 7 (3).
    Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  20. G. Mints (2001). Interpolation Theorems for Intuitionistic Predicate Logic. Annals of Pure and Applied Logic 113 (1-3):225-242.
    Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  21. G. Mints (2001). Review: L. Beklemishev, Another Pathological Well-Ordering. [REVIEW] Bulletin of Symbolic Logic 7 (4):534-534.
    Direct download  
     
    My bibliography  
     
    Export citation  
  22. G. Mints (2000). Reduction of Finite and Infinite Derivations. Annals of Pure and Applied Logic 104 (1-3):167-188.
    Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  23. S. Artemov, B. Kushner, G. Mints, E. Nogina & A. Troelstra (1999). In Memoriam: Albert G. Dragalin, 1941-1998. Bulletin of Symbolic Logic 5 (3):389-391.
  24. M. Borisavljevit, S. Buss, G. Mints, T. Coquand, A. A. Ivanov & D. Macpherson (1999). Kearnes, KA, Kiss, EW and Valeriote, MA, A Geometric. Annals of Pure and Applied Logic 99:261.
    No categories
     
    My bibliography  
     
    Export citation  
  25. Sam Buss & Grigori Mints (1999). The Complexity of the Disjunction and Existential Properties in Intuitionistic Logic. Annals of Pure and Applied Logic 99 (1-3):93-104.
    Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  26. G. Mints (1999). Cut-Elimination for Simple Type Theory with an Axiom of Choice. Journal of Symbolic Logic 64 (2):479-485.
    We present a cut-elimination proof for simple type theory with an axiom of choice formulated in the language with an epsilon-symbol. The proof is modeled after Takahashi's proof of cut-elimination for simple type theory with extensionality. The same proof works when types are restricted, for example for second-order classical logic with an axiom of choice.
    Direct download (6 more)  
     
    My bibliography  
     
    Export citation  
  27. G. Mints (1998). Linear Lambda-Terms and Natural Deduction. Studia Logica 60 (1):209-231.
    Direct download (7 more)  
     
    My bibliography  
     
    Export citation  
  28. G. Mints (1998). Normal Deduction in the Intuitionistic Linear Logic. Archive for Mathematical Logic 37 (5-6):415-425.
    We describe a natural deduction system NDIL for the second order intuitionistic linear logic which admits normalization and has a subformula property. NDIL is an extension of the system for !-free multiplicative linear logic constructed by the author and elaborated by A. Babaev. Main new feature here is the treatment of the modality !. It uses a device inspired by D. Prawitz' treatment of S4 combined with a construction $<\Gamma>$ introduced by the author to avoid cut-like constructions used in $\otimes$ (...)
    No categories
    Direct download (4 more)  
     
    My bibliography  
     
    Export citation  
  29. G. Mints (1998). Review: Wolfram Pohlers, Pure Proof Theory. Aims, Methods and Results. [REVIEW] Journal of Symbolic Logic 63 (3):1185-1185.
    Direct download  
     
    My bibliography  
     
    Export citation  
  30. Philip Kremer, Grigori Mints & V. Rybakov (1997). Axiomatizing the Next-Interior Fragment of Dynamic Topological Logic. Bulletin of Symbolic Logic 3:376-377.
     
    My bibliography  
     
    Export citation  
  31. G. Mints, M. Otero, S. Ronchi Della Rocca & K. Segerberg (1997). Donostia-San Sebastián, Spain, July 9–15, 1996. Bulletin of Symbolic Logic 3 (2).
    Direct download  
     
    My bibliography  
     
    Export citation  
  32. G. Mints, M. Otero, S. Ronchi Della Rocca & K. Segerberg (1997). 1996 European Summer Meeting of the Association for Symbolic Logic. Bulletin of Symbolic Logic 3 (2).
    Direct download  
     
    My bibliography  
     
    Export citation  
  33. Grigori Mints (1997). Indexed Systems of Sequents and Cut-Elimination. Journal of Philosophical Logic 26 (6):671-696.
    Cut reductions are defined for a Kripke-style formulation of modal logic in terms of indexed systems of sequents. A detailed proof of the normalization (cutelimination) theorem is given. The proof is uniform for the propositional modal systems with all combinations of reflexivity, symmetry and transitivity for the accessibility relation. Some new transformations of derivations (compared to standard sequent formulations) are needed, and some additional properties are to be checked. The display formulations [1] of the systems considered can be presented as (...)
    Direct download (8 more)  
     
    My bibliography  
     
    Export citation  
  34. Grigori Mints (1996). Strong Termination for the Epsilon Substitution Method. Journal of Symbolic Logic 61 (4):1193-1205.
    Ackermann proved termination for a special order of reductions in Hilbert's epsilon substitution method for the first order arithmetic. We establish termination for arbitrary order of reductions.
    Direct download (6 more)  
     
    My bibliography  
     
    Export citation  
  35. Grigori Mints (1996). Thoralf Skolem and the Epsilon Substitution Method for Predicate Logic. Nordic Journal of Philosophical Logic 1 (2):133-146.
    Direct download  
     
    My bibliography  
     
    Export citation  
  36. Grigori Mints, Vladimir Orevkov & Tanel Tammet (1996). Transfer of Sequent Calculus Strategies to Resolution for S4. In H. Wansing (ed.), Proof Theory of Modal Logic. Kluwer. 2--17.
    No categories
    Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  37. Grigori Mints, Sergei Tupailo & Wilfried Buchholz (1996). Epsilon Substitution Method for Elementary Analysis. Archive for Mathematical Logic 35 (2):103-130.
    We formulate epsilon substitution method for elementary analysisEA (second order arithmetic with comprehension for arithmetical formulas with predicate parameters). Two proofs of its termination are presented. One uses embedding into ramified system of level one and cutelimination for this system. The second proof uses non-effective continuity argument.
    No categories
    Direct download (4 more)  
     
    My bibliography  
     
    Export citation  
  38. Grigori Mints (1994). Logic and Computer Science, Edited by Odifreddi Piergiorgio, APIC Studies in Data Processing, Vol. 31, Academic Press, London, San Diego, Etc., 1990, Xii+ 430 Pp. [REVIEW] Journal of Symbolic Logic 59 (3):1111-1114.
    No categories
    Direct download  
     
    My bibliography  
     
    Export citation  
  39. Grigori Mints (1994). Review: Marianne Winslett, Updating Logical Databases. [REVIEW] Journal of Symbolic Logic 59 (3):1110-1114.
    Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  40. G. Mints (1993). A Normal Form for Logical Derivations Implying One for Arithmetic Derivations. Annals of Pure and Applied Logic 62 (1):65-79.
    Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  41. Grigori Mints (1993). Resolution Calculus for the First Order Linear Logic. Journal of Logic, Language and Information 2 (1):59-83.
    This paper presents a formulation and completeness proof of the resolution-type calculi for the first order fragment of Girard's linear logic by a general method which provides the general scheme of transforming a cutfree Gentzen-type system into a resolution type system, preserving the structure of derivations. This is a direct extension of the method introduced by Maslov for classical predicate logic. Ideas of the author and Zamov are used to avoid skolomization. Completeness of strategies is first established for the Gentzen-type (...)
    Direct download (4 more)  
     
    My bibliography  
     
    Export citation  
  42. P. Martin-Lof & G. Mints (1991). Cambridge, Mass., 1967.[Kle52a] SC Kleene. Introduction to Metamathematics. North-Holland, Amsterdam, 1952.[Kle52b] SC Kleene. Permutability of Inferences in Gentzen's Calculi LK and LJ. Memoirs of the AMS, 10, 1952.[KW84] J. Ketonen and R. Weyhrauch. A Decidable Fragment of Predicate Calculus. The Journal. [REVIEW] Annals of Pure and Applied Logic 51:125-157.
     
    My bibliography  
     
    Export citation  
  43. Grigori Mints (1991). Proof Theory in the USSR 1925-1969. Journal of Symbolic Logic 56 (2):385-424.
    We present a survey of proof theory in the USSR beginning with the paper by Kolmogorov [1925] and ending (mostly) in 1969; the last two sections deal with work done by A. A. Markov and N. A. Shanin in the early seventies, providing a kind of effective interpretation of negative arithmetic formulas. The material is arranged in chronological order and subdivided according to topics of investigation. The exposition is more detailed when the work is little known in the West or (...)
    Direct download (5 more)  
     
    My bibliography  
     
    Export citation  
  44. G. E. Mints (1989). The Completeness of Provable Realizability. Notre Dame Journal of Formal Logic 30 (3):420-441.
    Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  45. S. J. Maslov, G. E. Mints & V. P. Orevkov (1971). Mechanical Proof-Search and the Theory of Logical Deduction in the Ussr. Revue Internationale de Philosophie 25:575-584.
    A survey of works on automatic theorem-proving in the ussr 1964-1970. the philosophical problems are not touched.
    No categories
    Direct download  
     
    My bibliography  
     
    Export citation  
  46. G. E. Mints (1969). Analog of Herbrand's Theorem for Prenex Formulas of Constructive Predicate Calculus. In. In A. O. Slisenko (ed.), Studies in Constructive Mathematics and Mathematical Logic. New York, Consultants Bureau. 47--51.
    No categories
    Direct download  
     
    My bibliography  
     
    Export citation  
  47. G. E. Mints (1969). Choice of Terms in Quantifier Rules of Constructive Predicate Calculus. In. In A. O. Slisenko (ed.), Studies in Constructive Mathematics and Mathematical Logic. New York, Consultants Bureau. 43--46.
    No categories
    Direct download  
     
    My bibliography  
     
    Export citation  
  48. G. E. Mints (1969). Imbedding Operations Associated with Kripke's “Semantics”. In. In A. O. Slisenko (ed.), Studies in Constructive Mathematics and Mathematical Logic. New York, Consultants Bureau. 60--63.
    No categories
    Direct download  
     
    My bibliography  
     
    Export citation  
  49. G. E. Mints (1969). Variation in the Deduction Search Tactics in Sequential Calculi. In. In A. O. Slisenko (ed.), Studies in Constructive Mathematics and Mathematical Logic. New York, Consultants Bureau. 52--59.
    No categories
    Direct download  
     
    My bibliography  
     
    Export citation  
1 — 50 / 51