| Line 2,351: |
Line 2,351: |
| | ===Graph (Review)=== | | ===Graph (Review)=== |
| | | | |
| − | <pre> | + | {| align="center" cellpadding="8" width="90%" <!--QUOTE--> |
| − | | We recall (Part 0, Definition 1.2) that, for categories,
| |
| − | | a 'graph' consists of two classes and two mappings
| |
| − | | between them:
| |
| | | | | | |
| − | | o--------------o source o--------------o
| + | <p>We recall … that, for categories, a ''graph'' consists of two classes and two mappings between them:</p> |
| − | | | | ----------------> | |
| + | |
| − | | | Arrows | | Objects |
| + | <center><pre> |
| − | | | | ----------------> | |
| + | |
| − | | o--------------o target o--------------o
| + | o--------------o source o--------------o |
| | + | | | ----------------> | | |
| | + | | Arrows | | Objects | |
| | + | | | ----------------> | | |
| | + | o--------------o target o--------------o |
| | + | |
| | + | </pre></center> |
| | + | |
| | + | <p>In graph theory the arrows are usually called ''oriented edges'' and the objects ''nodes'' or ''vertices'', but in various branches of mathematics other words may be used. Instead of writing</p> |
| | + | |- |
| | | | | | |
| − | | In graph theory the arrows are usually called "oriented edges"
| + | ::<p><math>\operatorname{source}(f) = A, \quad \operatorname{target}(f) = B,</math></p> |
| − | | and the objects "nodes" or "vertices", but in various branches
| + | |- |
| − | | of mathematics other words may be used. Instead of writing | |
| | | | | | |
| − | | source(f) = A,
| + | <p>one often writes <math>f : A \to B</math> or <math>A \xrightarrow{~f~} B.</math> We shall look at graphs with additional structure which are of interest in logic.</p> |
| − | |
| + | |} |
| − | | target(f) = B,
| |
| − | | f
| |
| − | | one often writes f : A -> B or A ---> B. We shall
| |
| − | | look at graphs with additional structure which are
| |
| − | | of interest in logic.
| |
| − | </pre> | |
| | | | |
| | ===Deductive System=== | | ===Deductive System=== |