|
Size: 1273
Comment:
|
Size: 1640
Comment:
|
| Deletions are marked like this. | Additions are marked like this. |
| Line 1: | Line 1: |
| * AdvertisedWindowSize | |
| Line 5: | Line 4: |
| * ["Bijections"] * BooleanAlgebra * BooleanTerm |
|
| Line 7: | Line 9: |
| * ["Decidable"] and SemiDecidable | |
| Line 13: | Line 16: |
| * FixedPoint | |
| Line 14: | Line 18: |
| * FreeBooleanAlgebra * GroundClause * GroundBooleanTerm |
|
| Line 28: | Line 35: |
| * MonotoneBooleanTerm | |
| Line 33: | Line 41: |
| * RecursivelyEnumerableSets * RelationallyComplete |
|
| Line 38: | Line 48: |
| * SemiDecidable and ["Decidable"] | |
| Line 39: | Line 50: |
| * SlidingWindowProtocol * SpatialExtent |
|
| Line 40: | Line 53: |
| * TransmissionControlProtocol (TCP) |
AutonomousSystem (AS)
- ["Bijections"]
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