|
Size: 2722
Comment:
|
Size: 3253
Comment:
|
| Deletions are marked like this. | Additions are marked like this. |
| Line 19: | Line 19: |
| * [[Cryptography|Cryptography]] * CutFreeProof |
|
| Line 34: | Line 36: |
| * FirstOrderTheory | |
| Line 41: | Line 44: |
| * GraphTheoryPage | |
| Line 52: | Line 56: |
| * ["Interpolant"] | |
| Line 53: | Line 58: |
| * InterfaceMessagingProcessor (IMP) | |
| Line 54: | Line 60: |
| * LogicalImplication (|= symbol and also |-) * LogicalMemory |
* LogicalImplication ([[latex2($$\models$$)]] and [[latex2($$\vdash$$)]]) * LogicalMemory (START EDITING HERE) |
| Line 58: | Line 64: |
| * LeastFixedPoint | |
| Line 67: | Line 74: |
| * NetworkDelay | |
| Line 71: | Line 79: |
| * PartialOrder | |
| Line 73: | Line 82: |
| * PoSet (PartiallyOrderedSet) | |
| Line 75: | Line 85: |
| * PresburgerArithmetic | |
| Line 89: | Line 100: |
| * SemiAlgebraicSets | |
| Line 90: | Line 102: |
| * SemiDefinite * SemiLinearSets |
|
| Line 94: | Line 108: |
| * ["Steganography"] | |
| Line 102: | Line 117: |
| * TruthFunction (notation for [[latex2($\vdash$)]]) | |
| Line 104: | Line 120: |
| * UninterpretedFunctions |
AutonomousSystem (AS)
- ["Bijection"]
CidrVsSubnetting (CIDR, Subnetting and Class A-E Definitions)
CompleteLogic What does it mean for a logic to be complete
CyclesPerInstruction (CPI)
["Decidable"] and SemiDecidable
- ["Dichotomy"]
FileSystem (Free BSD)
FloatingPointRepresentation (IEEE 754)
InternetProtocolV4 (IPv4)
InternetProtocolV6 (IPv6)
- ["Interpolant"]
LogicalImplication (latex2($$\models$$) and latex2($$\vdash$$))
LogicalMemory (START EDITING HERE)
- ["Latency"]
MaximumTransmissionUnit (MTU)
- ["Model"] of a logic formula
OsiModel (7 layer OSI network Model)
- ["Performance"]
["Proposition"] or PropositionalLogic
- ["Processor"] or CPU
- ["Register"] (MIPS register)
- ["Satisfiable"]
SemiDecidable and ["Decidable"]
- ["Steganography"]
- ["Tautology"]
- ["taxonomy"]
TruthFunction (notation for latex2($\vdash$))
- ["Undecidable"]
- ["Valid"] Logic Formula