Axiom

Results: 922



#Item
11Emily Riehl Johns Hopkins University On the directed univalence axiom joint with Evan Cavallo and Christian Sattler

Emily Riehl Johns Hopkins University On the directed univalence axiom joint with Evan Cavallo and Christian Sattler

Add to Reading List

Source URL: www.math.jhu.edu

Language: English - Date: 2018-01-14 00:28:13
    12KLE axioms KLE001+0.ax Idempotent semirings ∀a, b: a + b = b + a fof(additive commutativity, axiom) ∀c, b, a: a + (b + c) = (a + b) + c fof(additive associativity, axiom)

    KLE axioms KLE001+0.ax Idempotent semirings ∀a, b: a + b = b + a fof(additive commutativity, axiom) ∀c, b, a: a + (b + c) = (a + b) + c fof(additive associativity, axiom)

    Add to Reading List

    Source URL: math.chapman.edu

    Language: English - Date: 2017-03-18 22:05:17
      13Testimony of Michael T. Suffredini CEO and President Axiom Space, Inc. Hearing on Examining the Future of the International Space Station: Stakeholder Perspectives Subcommittee on Space, Science and Competitiveness Commi

      Testimony of Michael T. Suffredini CEO and President Axiom Space, Inc. Hearing on Examining the Future of the International Space Station: Stakeholder Perspectives Subcommittee on Space, Science and Competitiveness Commi

      Add to Reading List

      Source URL: www.commerce.senate.gov

      Language: English - Date: 2018-06-06 13:36:15
        14Appendix 2: The Axiom of Choice In this appendix we want to prove Theorem 1.5. Theorem 1.5. The following set theoretic axioms are equivalentAxiom of Choice) If X is a nonempty set, then there is a map φ : P(X)

        Appendix 2: The Axiom of Choice In this appendix we want to prove Theorem 1.5. Theorem 1.5. The following set theoretic axioms are equivalentAxiom of Choice) If X is a nonempty set, then there is a map φ : P(X)

        Add to Reading List

        Source URL: www.math.hawaii.edu

        Language: English - Date: 2011-12-05 21:55:18
          15BOO axioms BOO001-0.ax Ternary Boolean algebra (equality) axioms m(m(v, w, x), y, m(v, w, z)) = m(v, w, m(x, y, z)) cnf(associativity, axiom) m(y, x, x) = x cnf(ternary multiply1 , axiom)

          BOO axioms BOO001-0.ax Ternary Boolean algebra (equality) axioms m(m(v, w, x), y, m(v, w, z)) = m(v, w, m(x, y, z)) cnf(associativity, axiom) m(y, x, x) = x cnf(ternary multiply1 , axiom)

          Add to Reading List

          Source URL: math.chapman.edu

          Language: English - Date: 2017-03-18 22:03:46
            16CAT axioms CAT001-0.ax Category theory axioms defined(x, y) ⇒ x · y=x ◦ y cnf(closure of composition, axiom) x · y=z ⇒ defined(x, y) cnf(associative property1 , axiom)

            CAT axioms CAT001-0.ax Category theory axioms defined(x, y) ⇒ x · y=x ◦ y cnf(closure of composition, axiom) x · y=z ⇒ defined(x, y) cnf(associative property1 , axiom)

            Add to Reading List

            Source URL: math.chapman.edu

            Language: English - Date: 2017-03-18 22:03:46
              17HEN axioms HEN001-0.ax Henkin model axioms less equal(x, y) ⇒ quotient(x, y, 0) cnf(quotient less equal, axiom) cnf(less equal quotient, axiom)

              HEN axioms HEN001-0.ax Henkin model axioms less equal(x, y) ⇒ quotient(x, y, 0) cnf(quotient less equal, axiom) cnf(less equal quotient, axiom)

              Add to Reading List

              Source URL: math.chapman.edu

              Language: English - Date: 2017-03-18 22:04:10
                18Univalence as a Principle of Logic Steve Awodey October 2016 Abstract It is sometimes convenient or useful in mathematics to treat isomorphic structures as the same. The recently proposed Univalence Axiom for the foundat

                Univalence as a Principle of Logic Steve Awodey October 2016 Abstract It is sometimes convenient or useful in mathematics to treat isomorphic structures as the same. The recently proposed Univalence Axiom for the foundat

                Add to Reading List

                Source URL: www.andrew.cmu.edu

                - Date: 2018-02-12 22:13:01
                  19Proc. 23rd Int. Workshop on Description Logics (DL2010), CEUR-WS 573, Waterloo, Canada, Complexity of Axiom Pinpointing in the DL-Lite Family Rafael Pe˜ naloza1 and Barı¸s Sertkaya2

                  Proc. 23rd Int. Workshop on Description Logics (DL2010), CEUR-WS 573, Waterloo, Canada, Complexity of Axiom Pinpointing in the DL-Lite Family Rafael Pe˜ naloza1 and Barı¸s Sertkaya2

                  Add to Reading List

                  Source URL: ceur-ws.org

                  - Date: 2010-04-20 14:40:19
                    20Axiom Pinpointing is Hard Rafael Pe˜ naloza and Barı¸s Sertkaya? Theoretical Computer Science TU Dresden, Germany {penaloza,sertkaya}@tcs.inf.tu-dresden.de

                    Axiom Pinpointing is Hard Rafael Pe˜ naloza and Barı¸s Sertkaya? Theoretical Computer Science TU Dresden, Germany {penaloza,sertkaya}@tcs.inf.tu-dresden.de

                    Add to Reading List

                    Source URL: ceur-ws.org

                    - Date: 2009-07-07 04:46:34