DIALGEBRAS Jean-Louis LODAY There is a notion of
... in a dimonoid. In particular we describe the free dimonoid on a given set. In the second section we introduce the notion of dialgebra and give several examples. We explicitly describe the free dialgebra over a vector space. In the third section we construct the chain complex of a dialgebra D, which ...
... in a dimonoid. In particular we describe the free dimonoid on a given set. In the second section we introduce the notion of dialgebra and give several examples. We explicitly describe the free dialgebra over a vector space. In the third section we construct the chain complex of a dialgebra D, which ...
Proofs in Propositional Logic
... In Coq, the negation of a proposition A is represented with the help of a constant not, where not A (also written ∼A) is defined as the implication A→False. The tactic unfold not allows to expand the constant not in a goal, but is seldom used. The introduction tactic for ∼A is the introduction tactic ...
... In Coq, the negation of a proposition A is represented with the help of a constant not, where not A (also written ∼A) is defined as the implication A→False. The tactic unfold not allows to expand the constant not in a goal, but is seldom used. The introduction tactic for ∼A is the introduction tactic ...
CSE 20 - Lecture 14: Logic and Proof Techniques
... B is 12. How many functions are there from A to B. A B C D E ...
... B is 12. How many functions are there from A to B. A B C D E ...
