33
views
0
recommends
+1 Recommend
0 collections
    0
    shares
      • Record: found
      • Abstract: not found
      • Book Chapter: not found
      Logic for Programming and Automated Reasoning 

      A Tactic Language for the System Coq

      other
      Springer Berlin Heidelberg

      Read this book at

      Buy book Bookmark
          There is no author summary for this book yet. Authors can add summaries to their books on ScienceOpen to make them more accessible to a non-specialist audience.

          Related collections

          Most cited references5

          • Record: found
          • Abstract: not found
          • Book: not found

          Edinburgh LCF

            Bookmark
            • Record: found
            • Abstract: not found
            • Book Chapter: not found

            PVS: A prototype verification system

              Bookmark
              • Record: found
              • Abstract: found
              • Article: not found

              Contraction-free sequent calculi for intuitionistic logic

              Gentzen's sequent calculus LJ, and its variants such as G3 [21], are (as is well known) convenient as a basis for automating proof search for IPC (intuitionistic propositional calculus). But a problem arises: that of detecting loops, arising from the use (in reverse) of the rule ⊃⇒ for implication introduction on the left. We describe below an equivalent calculus, yet another variant on these systems, where the problem no longer arises: this gives a simple but effective decision procedure for IPC.
                Bookmark

                Author and book information

                Book Chapter
                : 85-95
                10.1007/3-540-44404-1_7
                2d66833c-4915-49c7-bc26-f0af7797e6a3
                History

                Comments

                Comment on this book