jessealama
|
Registered User
|
|
|
Jan 18 |
accepted | What are some other uses for Ehrenfeucht-Fraïssé games? |
|
Jan 15 |
comment |
Sequent calculus: is there a complete linear reasoning (i.e., no trees)? You may also consider working wit prenex formulas rather than arbitrary formulas. One can then formulate tableau rules that avoid branching. See, e.g., chapter 10 section 2 of Smullyan's First-Order Logic. |
|
Jan 15 |
answered | What are some other uses for Ehrenfeucht-Fraïssé games? |
|
Jan 15 |
awarded | ● Supporter |
|
Jan 13 |
awarded | ● Editor |
|
Jan 12 |
revised |
Has anyone thought about creating a formal proof wiki with verifier? (Broken link) |
|
Jan 12 |
answered | Has anyone thought about creating a formal proof wiki with verifier? |
|
Jan 11 |
answered | When are two proofs of the same theorem really different proofs |
|
Jan 11 |
answered | How do proof verifiers work? |
|
Jan 11 |
answered | Do you know any good introductory resource on sequent calculus? |
|
Jan 11 |
awarded | ● Teacher |
|
Jan 11 |
answered | Sequent calculus: is there a complete linear reasoning (i.e., no trees)? |

