1269
Comment:
|
1735
|
Deletions are marked like this. | Additions are marked like this. |
Line 1: | Line 1: |
* AdvertisedWindow | |
Line 5: | Line 4: |
* ["Bijection"] * BooleanAlgebra * BooleanTerm |
|
Line 7: | Line 9: |
* ["Decidable"] and SemiDecidable | |
Line 9: | Line 12: |
* DelayBandwidthProduct | |
Line 13: | Line 17: |
* FixedPoint | |
Line 14: | Line 19: |
* FreeBooleanAlgebra * GroundClause * GroundBooleanTerm |
|
Line 28: | Line 36: |
* MonotoneBooleanTerm | |
Line 30: | Line 39: |
* ["Performance"] | |
Line 33: | Line 43: |
* RecursivelyEnumerableSets * RelationallyComplete |
|
Line 38: | Line 50: |
* SemiDecidable and ["Decidable"] | |
Line 39: | Line 52: |
* SlidingWindowProtocol * SpatialExtent |
|
Line 40: | Line 55: |
* TcpFastRetransmit * TcpFastRecovery * TransmissionControlProtocol (TCP) |
AutonomousSystem (AS)
- ["Bijection"]
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)
- ["Performance"]
["Proposition"] or PropositionalLogic
- ["Satisfiable"]
SemiDecidable and ["Decidable"]
- ["Tautology"]
- ["taxonomy"]
- ["Undecidable"]
- ["Valid"] Logic Formula