Skip to content

Commit

Permalink
Merge pull request #27 from babaeee/mz3
Browse files Browse the repository at this point in the history
erase logical propositions
  • Loading branch information
arshiamoeini committed Jan 29, 2024
2 parents 053bb27 + 6b36242 commit 552f84b
Show file tree
Hide file tree
Showing 2 changed files with 2 additions and 9 deletions.
8 changes: 0 additions & 8 deletions front/adventure/fa/root.yml
Original file line number Diff line number Diff line change
Expand Up @@ -5,21 +5,13 @@
y: 0
children: !include ./tutorial.yml
engineParams: "auto_level=calculator"
- id: logical propositions
name: گزاره های منطفی
type: collection
x: 1
y: 0
children: !include ./todo.yml
engineParams: "disabled_tactics=assumption"
- id: logic
name: منطق و استدلال
type: collection
x: 0
y: 1
dependencies:
- tutorial
- logical propositions
children: !include ./logic.yml
engineParams: "disabled_tactics=assumption"
- id: equality
Expand Down
3 changes: 2 additions & 1 deletion library/Automata.v
Original file line number Diff line number Diff line change
Expand Up @@ -22,6 +22,7 @@ Todo rep_len: ∀ s: list char, ∀ n: ℤ, 0 ≤ n → |rep s n| = n * |s|;
Suggest goal default apply rep_len with label Trivial;

Todo rep_nth: ∀ d: char, ∀ s, ∀ k, k > 0 -> ∀ i, 0 ≤ i ∧ i < k * |s| -> nth d (rep s k) i = nth d s (i mod |s|);
Todo valid_paren_n: ∀ n: ℤ, 0 ≤ n → valid_paren (rep "(" n + rep ")" n);

Axiom in_Lmult_unfold: ∀ L1 L2: set (list char), ∀ s: list char, s ∈ L1 * L2 → ∃ a b: list char, s = a + b ∧ a ∈ L1 ∧ b ∈ L2;
Axiom in_Lmult_fold: ∀ L1 L2: set (list char), ∀ a b: list char, a ∈ L1 -> b ∈ L2 -> a + b ∈ L1 * L2;
Expand Down Expand Up @@ -95,7 +96,7 @@ Axiom #1 edges_of_DFA: ∀ sigma, DFA sigma -> list (char → ℤ);
Axiom #1 accept_nodes_of_DFA: ∀ sigma, DFA sigma -> set ℤ;
Axiom #1 start_of_DFA: ∀ sigma, DFA sigma -> ℤ;

Axiom n_DFA_pos: ∀ sigma, ∀ A: DFA sigma, |A| 0;
Axiom n_DFA_pos: ∀ sigma, ∀ A: DFA sigma, |A| > 0;
Axiom #1 run_dfa: ∀ sigma, (DFA sigma) → ℤ → (list char) → ℤ;
Axiom run_dfa_nil: ∀ sigma, ∀ A: DFA sigma, ∀ u, run_dfa A u "" = u;
Axiom run_dfa_cons: ∀ sigma, ∀ A: DFA sigma, ∀ u, ∀ s, ∀ c, ∀ f: char → ℤ, f = nth (λ a: char, - 1) (edges_of_DFA A) u → ∀ v, v = f c → run_dfa A u (c :: s) = run_dfa A v s;
Expand Down

0 comments on commit 552f84b

Please sign in to comment.