1274
Comment:
|
1599
|
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: |
* FreeBooleanAlgebra * GroundClause * GroundBooleanTerm |
|
Line 27: | Line 34: |
* MonotoneBooleanTerm | |
Line 32: | Line 40: |
* RecursivelyEnumerableSets * RelationallyComplete |
|
Line 37: | Line 47: |
* SemiDecidable and ["Decidable"] | |
Line 40: | Line 51: |
* 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