2020
DOI: 10.1007/978-3-030-30229-0_12
|View full text |Cite
|
Sign up to set email alerts
|

A Mechanized Proof of Higman’s Lemma by Open Induction

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

0
1
0

Year Published

2020
2020
2020
2020

Publication Types

Select...
1
1

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
(1 citation statement)
references
References 20 publications
0
1
0
Order By: Relevance
“…It is interesting to note that although proofs of termination via open induction are much less common, they have been considered from the perspective of formalisation [14], where direct inductive argument is much easier to work with than proof which is reliant on classical logic.…”
mentioning
confidence: 99%
“…It is interesting to note that although proofs of termination via open induction are much less common, they have been considered from the perspective of formalisation [14], where direct inductive argument is much easier to work with than proof which is reliant on classical logic.…”
mentioning
confidence: 99%