OAI/Combinatorics/EditApproximation/Queries/QueryInputCodes.lean

GitHub source file

7 declarations, 0 contain sorry, 0 declared as axioms

Boolean arithmetic for the existing child/history key encodings. The sorting comparison charges both encodings and the word comparison.

  1. theorem OAI.EditApproximation.queryChildCodeWithWork_value line 15
  2. theorem OAI.EditApproximation.queryPairWithWork_value line 22
  3. theorem OAI.EditApproximation.queryHistoryCodeWithWork_value line 33
  4. theorem OAI.EditApproximation.queryEncodedLEWithWork_value line 40
  5. theorem OAI.EditApproximation.queryOrderedChildInputsWithWork_value line 47
  6. theorem OAI.EditApproximation.queryHistoryEqualWithWork_value line 58
  7. theorem OAI.EditApproximation.queryOrderedHistoryInputsWithWork_value line 71