Name
Abstract | ||
|---|---|---|
Non-effective cut elimination proof uses Koenig's lemma to obtain a non-closed branch of a proof-search tree τ (without cut) for a first order formula A, if A is not cut free provable. A partial model (semi-valuation) corresponding to this branch and verifying ¬A is extended to a total model for ¬A using arithmetical comprehension. This contradicts soundness, if A is derivable with cut. Hence τ is a cut free proof of A. The same argument works for Herbrand Theorem. We discuss algorithms of obtaining cut free proofs corresponding to this schema and quite different from complete search through all possible proofs. |
Year | DOI | Venue |
|---|---|---|
2006 | 10.1007/11753728_27 | CSR |
Keywords | Field | DocType |
total model,non-closed branch,cut free proof,argument work,possible proof,partial model,non-effective cut elimination proof,herbrand theorem,free provable,free proof,first order | Discrete mathematics,Combinatorics,Arithmetic function,First order,Mathematical proof,Soundness,Lemma (mathematics),Maximum cut,Mathematics,Branching (version control),Search tree | Conference |
Volume | ISSN | ISBN |
3967 | 0302-9743 | 3-540-34166-8 |
Citations | PageRank | References |
1 | 0.48 | 4 |
Authors | ||
1 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Grigori Mints | 1 | 235 | 72.76 |