| 
  
   Size: 1164 
  
  Comment:  
 | 
  
   Size: 1574 
  
  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 12: | Line 15: | 
| * FixedPoint | |
| Line 13: | Line 17: | 
|    * GroundClause * GroundBooleanTerm  | 
|
| Line 19: | Line 25: | 
| * LogicalImplication (|= symbol) | * LogicalImplication (|= symbol and also |-) | 
| Line 27: | Line 33: | 
| * MonotoneBooleanTerm | |
| Line 30: | Line 37: | 
| * PowerSet | |
| Line 31: | Line 39: | 
|    * RecursivelyEnumerableSets * RelationallyComplete  | 
|
| Line 35: | Line 45: | 
|    * SemanticsSyntaxSortsInLogic * SemiDecidable and ["Decidable"] * SequenceNumber * SlidingWindowProtocol  | 
|
| Line 36: | Line 50: | 
| * TransmissionControlProtocol (TCP) | 
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
 
