35 found
Order:
Disambiguations
Grigori Mints [35]Grigori Efroimovich Mints [2]
  1.  24
    Dynamic Topological Logic.Philip Kremer & Grigori Mints - 2005 - Annals of Pure and Applied Logic 131 (1-3):133-158.
    Dynamic topological logic provides a context for studying the confluence of the topological semantics for S4, topological dynamics, and temporal logic. The topological semantics for S4 is based on topological spaces rather than Kripke frames. In this semantics, □ is interpreted as topological interior. Thus S4 can be understood as the logic of topological spaces, and □ can be understood as a topological modality. Topological dynamics studies the asymptotic properties of continuous maps on topological spaces. Let a dynamic topological system (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   25 citations  
  2.  14
    Epsilon Substitution Method for Elementary Analysis.Grigori Mints, Sergei Tupailo & Wilfried Buchholz - 1996 - 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.
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   19 citations  
  3.  36
    Indexed Systems of Sequents and Cut-Elimination.Grigori Mints - 1997 - 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 (5 more)  
     
    Export citation  
     
    Bookmark   15 citations  
  4.  12
    A Proof of Topological Completeness for S4 In.Grigori Mints & Ting Zhang - 2005 - Annals of Pure and Applied Logic 133 (1-3):231-245.
    The completeness of the modal logic S4 for all topological spaces as well as for the real line , the n-dimensional Euclidean space and the segment etc. was proved by McKinsey and Tarski in 1944. Several simplified proofs contain gaps. A new proof presented here combines the ideas published later by G. Mints and M. Aiello, J. van Benthem, G. Bezhanishvili with a further simplification. The proof strategy is to embed a finite rooted Kripke structure for S4 into a subspace (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   7 citations  
  5.  29
    Propositional Logic of Continuous Transformations in Cantor Space.Grigori Mints & Ting Zhang - 2005 - Archive for Mathematical Logic 44 (6):783-799.
  6. Notes on Constructive Negation.Grigori Mints - 2006 - 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 (3 more)  
     
    Export citation  
     
    Bookmark  
  7.  12
    The Complexity of the Disjunction and Existential Properties in Intuitionistic Logic.Sam Buss & Grigori Mints - 1999 - Annals of Pure and Applied Logic 99 (1-3):93-104.
    This paper considers the computational complexity of the disjunction and existential properties of intuitionistic logic. We prove that the disjunction property holds feasibly for intuitionistic propositional logic; i.e., from a proof of A v B, a proof either of A or of B can be found in polynomial time. For intuitionistic predicate logic, we prove superexponential lower bounds for the disjunction property, namely, there is a superexponential lower bound on the time required, given a proof of A v B, to (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   7 citations  
  8.  17
    A Short Introduction to Modal Logic.Grigori Mints - 1992 - Center for the Study of Language and Information.
    A Short Introduction to Modal Logic presents both semantic and syntactic features of the subject and illustrates them by detailed analyses of the three best-known modal systems S5, S4 and T. The book concentrates on the logical aspects of ...
    Direct download  
     
    Export citation  
     
    Bookmark   6 citations  
  9. Strong Termination for the Epsilon Substitution Method.Grigori Mints - 1996 - 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 (8 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  10. Axiomatizing the Next-Interior Fragment of Dynamic Topological Logic.Philip Kremer, Grigori Mints & V. Rybakov - 1997 - Bulletin of Symbolic Logic 3:376-377.
  11.  22
    Epsilon Substitution for First- and Second-Order Predicate Logic.Grigori Mints - 2013 - Annals of Pure and Applied Logic 164 (6):733-739.
    The epsilon substitution method was proposed by D. Hilbert as a tool for consistency proofs. A version for first order predicate logic had been described and proved to terminate in the monograph “Grundlagen der Mathematik”. As far as the author knows, there have been no attempts to extend this approach to the second order case. We discuss possible directions for and obstacles to such extensions.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  12.  13
    Cut Elimination for a Simple Formulation of Epsilon Calculus.Grigori Mints - 2008 - Annals of Pure and Applied Logic 152 (1):148-160.
    A simple cut elimination proof for arithmetic with the epsilon symbol is used to establish the termination of a modified epsilon substitution process. This opens a possibility of extension to much stronger systems.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  13.  18
    Effective Cut-Elimination for a Fragment of Modal Mu-Calculus.Grigori Mints - 2012 - 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 (4 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  14.  7
    A Simple Proof of Second-Order Strong Normalization with Permutative Conversions.Makoto Tatsuta & Grigori Mints - 2005 - Annals of Pure and Applied Logic 136 (1-2):134-155.
    A simple and complete proof of strong normalization for first- and second-order intuitionistic natural deduction including disjunction, first-order existence and permutative conversions is given. The paper follows the Tait–Girard approach via computability predicates and saturated sets. Strong normalization is first established for a set of conversions of a new kind, then deduced for the standard conversions. Difficulties arising for disjunction are resolved using a new logic where disjunction is restricted to atomic formulas.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  15.  39
    Proof Theory in the USSR 1925–1969.Grigori Mints - 1991 - 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 (7 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  16. Epsilon-Substitution Method for the Ramified Language and Δ 1 1 -Comprehension Rule.Grigori Mints & S. Tupailo - 1999 - In ¸ Itecantini1999. Springer.
     
    Export citation  
     
    Bookmark   3 citations  
  17.  49
    Cut Elimination for S4C: A Case Study.Grigori Mints - 2006 - 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 (4 more)  
     
    Export citation  
     
    Bookmark  
  18.  7
    Logic and Computer Science, Edited by Piergiorgio Odifreddi, APIC Studies in Data Processing, Vol. 31, Academic Press, London, San Diego, Etc., 1990, Xii + 430 Pp. [REVIEW]Grigori Mints - 1994 - Journal of Symbolic Logic 59 (3):1111-1114.
  19. Thoralf Skolem and the Epsilon Substitution Method for Predicate Logic.Grigori Mints - 1996 - Nordic Journal of Philosophical Logic 1 (2):133-146.
  20.  37
    Resolution Calculus for the First Order Linear Logic.Grigori Mints - 1993 - 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 (3 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  21.  30
    2000-2001 Spring Meeting of the Association for Symbolic Logic.Michael Detlefsen, Erich Reck, Colin McLarty, Rohit Parikh, Larry Moss, Scott Weinstein, Gabriel Uzquiano, Grigori Mints & Richard Zach - 2001 - Bulletin of Symbolic Logic 7 (3):413-419.
  22.  11
    Strong Termination for the Epsilon Substitution Method.Grigori Mints - 1996 - Journal of Symbolic Logic 61 (3):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  
     
    Export citation  
     
    Bookmark  
  23.  13
    Transfer of Sequent Calculus Strategies to Resolution for S4.Grigori Mints, Vladimir Orevkov & Tanel Tammet - 1996 - In H. Wansing (ed.), Proof Theory of Modal Logic. Kluwer Academic Publishers. pp. 2--17.
  24.  12
    S4 Is Topologically Complete For : A Short Proof.Grigori Mints - 2006 - Logic Journal of the IGPL 14 (1):63-71.
    Ideas of previous constructions are combined into a short proof of topological completeness of modal logic S4 first for rational numbers and after that for real numbers in the interval.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  25.  6
    An Extension of the Omega-Rule.Ryota Akiyoshi & Grigori Mints - 2016 - Archive for Mathematical Logic 55 (3-4):593-603.
    The Ω\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\Omega $$\end{document}-rule was introduced by W. Buchholz to give an ordinal-free proof of cut-elimination for a subsystem of analysis with Π11\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\Pi ^{1}_{1}$$\end{document}-comprehension. W. Buchholz’s proof provides cut-free derivations by familiar rules only for arithmetical sequents. When second-order quantifiers are present, they are introduced by the Ω\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\Omega $$\end{document}-rule and some residual cuts are not (...)
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  26.  11
    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]John Baldwin, Lev Beklemishev, Anuj Dawar, Mirna Dzamonja, David Evans, Erich Grädel, Denis Hirschfeldt, Hannes Leitgeb, Roger Maddux & Grigori Mints - 2008 - Bulletin of Symbolic Logic 14 (1).
    Direct download  
     
    Export citation  
     
    Bookmark  
  27.  8
    Failure of Interpolation in Constant Domain Intuitionistic Logic.Grigori Mints, Grigory Olkhovikov & Alasdair Urquhart - 2013 - Journal of Symbolic Logic 78 (3):937-950.
  28.  10
    Review: Marianne Winslett, Updating Logical Databases. [REVIEW]Grigori Mints - 1994 - Journal of Symbolic Logic 59 (3):1110-1114.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  29.  9
    Cut-Free Formulations for a Quantified Logic of Here and There.Grigori Mints - 2010 - Annals of Pure and Applied Logic 162 (3):237-242.
    A predicate extension SQHT= of the logic of here-and-there was introduced by V. Lifschitz, D. Pearce, and A. Valverde to characterize strong equivalence of logic programs with variables and equality with respect to stable models. The semantics for this logic is determined by intuitionistic Kripke models with two worlds with constant individual domain and decidable equality. Our sequent formulation has special rules for implication and for pushing negation inside formulas. The soundness proof allows us to establish that SQHT= is a (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark  
  30.  6
    Preface.Sergei Artemov, Yuri Matiyasevich, Grigori Mints & Anatol Slissenko - 2010 - Annals of Pure and Applied Logic 162 (3):173-174.
  31. 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]Anuj Dawar Beklemishev, Mirna Dzamonja, David Evans, Erich Grädel, Denis Hirschfeldt, Hannes Leitgeb, Roger Maddux, Grigori Mints, Volker Peckhaus & Sławomir Solecki - 2008 - Bulletin of Symbolic Logic 14 (4).
     
    Export citation  
     
    Bookmark  
  32.  6
    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]Denis Hirschfeldt, Hannes Leitgeb, Roger Maddux, Grigori Mints & Volker Peckhaus - 2008 - Bulletin of Symbolic Logic 14 (3).
    Direct download  
     
    Export citation  
     
    Bookmark  
  33. 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]Denis Hirschfeldt, Hannes Leitgeb, Roger Maddux, Grigori Mints & Volker Peckhaus - 2008 - Bulletin of Symbolic Logic 14 (2).
  34. Games, Logic, and Constructive Sets.Grigori Mints & Reinhard Muskens (eds.) - 2003 - Center for the Study of Language and Inf.
    Mathematical game theory has been embraced by a variety of scholars: social scientists, biologists, linguists, and now, increasingly, logicians. This volume illustrates the recent advances of game theory in the field. Logicians benefit from things like game theory's ability to explain informational independence between connectives; meanwhile, game theorists have even begun to benefit from logical epistemic analyses of game states. In concert with such pioneering work, this volume also present surprising developments in classical fields, including first-order logic and set theory.
     
    Export citation  
     
    Bookmark  
  35. ¸ Itecantini1999.Grigori Mints & S. Tupailo - 1999 - Springer.
    No categories
     
    Export citation  
     
    Bookmark