Theorem

Results: 6939



#Item
31This space is reserved for the EPiC Series header, do not use it Checkable Proofs for First-Order Theorem Proving∗ Giles Reger1 and Martin Suda2 1

This space is reserved for the EPiC Series header, do not use it Checkable Proofs for First-Order Theorem Proving∗ Giles Reger1 and Martin Suda2 1

Add to Reading List

Source URL: www.cs.man.ac.uk

Language: English - Date: 2017-07-30 15:10:50
32From Trees to Graphs: Kruskal’s Tree Theorem & Termination master’s thesis @ University of Innsbruck, Austria Maria A Schett

From Trees to Graphs: Kruskal’s Tree Theorem & Termination master’s thesis @ University of Innsbruck, Austria Maria A Schett

Add to Reading List

Source URL: www.maria-a-schett.net

Language: English - Date: 2016-12-11 09:17:22
33Tutorial to Locales and Locale Interpretation∗ Clemens Ballarin Abstract Locales are Isabelle’s approach for dealing with parametric theories. They have been designed as a module system for a theorem prover

Tutorial to Locales and Locale Interpretation∗ Clemens Ballarin Abstract Locales are Isabelle’s approach for dealing with parametric theories. They have been designed as a module system for a theorem prover

Add to Reading List

Source URL: mirror.clarkson.edu

Language: English - Date: 2018-08-15 07:19:09
34Tutorial to Locales and Locale Interpretation∗ Clemens Ballarin Abstract Locales are Isabelle’s approach for dealing with parametric theories. They have been designed as a module system for a theorem prover

Tutorial to Locales and Locale Interpretation∗ Clemens Ballarin Abstract Locales are Isabelle’s approach for dealing with parametric theories. They have been designed as a module system for a theorem prover

Add to Reading List

Source URL: www.cl.cam.ac.uk

Language: English - Date: 2018-08-15 07:19:09
35

PDF Document

Add to Reading List

Source URL: www.theorem.com

- Date: 2015-02-10 05:31:00
    36

    PDF Document

    Add to Reading List

    Source URL: www.theorem.com

    - Date: 2017-09-26 06:46:24
      37

      PDF Document

      Add to Reading List

      Source URL: www.theorem.com

      - Date: 2017-09-26 06:46:04
        38SCT axioms SCT problems SCT029-1.p Arrow OrderFormalization of two proofs of Arrow’s impossibility theorem. One formalization is based on utility functions, the other one on strict partial orders.

        SCT axioms SCT problems SCT029-1.p Arrow OrderFormalization of two proofs of Arrow’s impossibility theorem. One formalization is based on utility functions, the other one on strict partial orders.

        Add to Reading List

        Source URL: math.chapman.edu

        Language: English - Date: 2017-03-19 21:35:20
          39THE SCHUR–ZASSENHAUS THEOREM KEITH CONRAD When N is a normal subgroup of G, can we reconstruct G from N and G/N ? In general, no. For instance, the groups Z/(p2 ) and Z/(p) × Z/(p) (for prime p) are nonisomorphic, but

          THE SCHUR–ZASSENHAUS THEOREM KEITH CONRAD When N is a normal subgroup of G, can we reconstruct G from N and G/N ? In general, no. For instance, the groups Z/(p2 ) and Z/(p) × Z/(p) (for prime p) are nonisomorphic, but

          Add to Reading List

          Source URL: www.math.uconn.edu

          Language: English - Date: 2016-12-17 14:23:25
            40THE EXACT STRENGTH OF THE CLASS FORCING THEOREM VICTORIA GITMAN, JOEL DAVID HAMKINS, PETER HOLY, PHILIPP SCHLICHT, AND KAMERYN WILLIAMS Abstract. The class forcing theorem, which asserts that every class forcing notion P

            THE EXACT STRENGTH OF THE CLASS FORCING THEOREM VICTORIA GITMAN, JOEL DAVID HAMKINS, PETER HOLY, PHILIPP SCHLICHT, AND KAMERYN WILLIAMS Abstract. The class forcing theorem, which asserts that every class forcing notion P

            Add to Reading List

            Source URL: victoriagitman.github.io

            Language: English - Date: 2018-07-23 10:43:13