5
views
0
recommends
+1 Recommend
0 collections
    0
    shares
      • Record: found
      • Abstract: not found
      • Book Chapter: not found
      Gödel ’96 

      A bottom-up approach to foundations of mathematics

      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 references27

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

          The relative efficiency of propositional proof systems

          We are interested in studying the length of the shortest proof of a propositional tautology in various proof systems as a function of the length of the tautology. The smallest upper bound known for this function is exponential, no matter what the proof system. A question we would like to answer (but have not been able to) is whether this function has a polynomial bound for some proof system. (This question is motivated below.) Our results here are relative results.
            Bookmark
            • Record: found
            • Abstract: not found
            • Article: not found

            The intractability of resolution

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

              A Mathematical Incompleteness in Peano Arithmetic

              Jeff Paris (1977)
                Bookmark

                Author and book information

                Book Chapter
                1996
                : 81-97
                10.1007/978-3-662-21963-8_6
                5a2caf6e-1d37-4c96-9ce4-fd11bba61454
                History

                Comments

                Comment on this book

                Book chapters

                Similar content1,806