|
Size: 1350
Comment:
|
Size: 1599
Comment:
|
| Deletions are marked like this. | Additions are marked like this. |
| Line 4: | Line 4: |
| * BooleanAlgebra * BooleanTerm |
|
| Line 6: | Line 8: |
| * ["Decidable"] and SemiDecidable | |
| Line 14: | Line 17: |
| * FreeBooleanAlgebra | |
| Line 15: | Line 19: |
| * GroundBooleanTerm | |
| Line 29: | Line 34: |
| * MonotoneBooleanTerm | |
| Line 34: | Line 40: |
| * RecursivelyEnumerableSets * RelationallyComplete |
|
| Line 39: | Line 47: |
| * SemiDecidable and ["Decidable"] |
AutonomousSystem (AS)
CidrVsSubnetting (CIDR, Subnetting and Class A-E Definitions)
CompleteLogic What does it mean for a logic to be complete
["Decidable"] and SemiDecidable
- ["Dichotomy"]
InternetProtocolV4 (IPv4)
InternetProtocolV6 (IPv6)
LogicalImplication (|= symbol and also
MaximumTransmissionUnit (MTU)
- ["Model"] of a logic formula
MultiProtocolLabelSwitching (MPLS)
OsiModel (7 layer OSI network Model)
["Proposition"] or PropositionalLogic
- ["Satisfiable"]
SemiDecidable and ["Decidable"]
- ["Tautology"]
- ["taxonomy"]
- ["Undecidable"]
- ["Valid"] Logic Formula