2017
DOI: 10.1002/tht3.229
|View full text |Cite
|
Sign up to set email alerts
|

Explanatory Circles, Induction, and Recursive Structures

Abstract: Lange (2009) offers an argument that, according to him, “does not show merely that some proofs by mathematical induction are not explanatory. It shows that none are […]” (p. 210). The aim here is to present a counterexample to his argument.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2019
2019
2019
2019

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 1 publication
(1 citation statement)
references
References 3 publications
0
1
0
Order By: Relevance
“…For instance, the “downward and upward” proof is more disjunctive than the standard proof, and hence perhaps less explanatory. (For further criticism and discussion, see Baldwin, 2016; Dougherty, 2017; Hoelte, 2013; Lehet, 2019; Salvedra, 2018; Wysocki, 2017. )…”
Section: Particular Proof‐types: Exhaustion Induction Abstraction mentioning
confidence: 99%
“…For instance, the “downward and upward” proof is more disjunctive than the standard proof, and hence perhaps less explanatory. (For further criticism and discussion, see Baldwin, 2016; Dougherty, 2017; Hoelte, 2013; Lehet, 2019; Salvedra, 2018; Wysocki, 2017. )…”
Section: Particular Proof‐types: Exhaustion Induction Abstraction mentioning
confidence: 99%