|
Size: 2674
Comment:
|
Size: 3127
Comment:
|
| Deletions are marked like this. | Additions are marked like this. |
| Line 19: | Line 19: |
| * ["Cryptography"] * CutFreeProof |
|
| Line 28: | Line 30: |
| * DynamicSetOperations | |
| Line 33: | Line 36: |
| * FirstOrderTheory | |
| Line 40: | Line 44: |
| * GraphTheoryPage | |
| Line 52: | Line 57: |
| * InterfaceMessagingProcessor (IMP) | |
| Line 53: | Line 59: |
| * LogicalImplication (|= symbol and also |-) * LogicalMemory |
* LogicalImplication ([[latex2($$\models$$)]] and [[latex2($$\vdash$$)]]) * LogicalMemory (START EDITING HERE) |
| Line 57: | Line 63: |
| * LeastFixedPoint | |
| Line 74: | Line 81: |
| * PresburgerArithmetic | |
| Line 88: | Line 96: |
| * SemiAlgebraicSets | |
| Line 89: | Line 98: |
| * SemiLinearSets | |
| Line 93: | Line 103: |
| * ["Steganography"] | |
| Line 95: | Line 106: |
| * ["taxonomy"] | |
| Line 99: | Line 111: |
| * ["taxonomy"] | * TreeStructures * TruthFunction (notation for [[latex2($\vdash$)]]) |
| Line 102: | Line 115: |
| * UninterpretedFunctions |
AutonomousSystem (AS)
- ["Bijection"]
CidrVsSubnetting (CIDR, Subnetting and Class A-E Definitions)
CompleteLogic What does it mean for a logic to be complete
- ["Cryptography"]
CyclesPerInstruction (CPI)
["Decidable"] and SemiDecidable
- ["Dichotomy"]
FileSystem (Free BSD)
FloatingPointRepresentation (IEEE 754)
InternetProtocolV4 (IPv4)
InternetProtocolV6 (IPv6)
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