1982
DOI: 10.1111/j.1746-8361.1982.tb00820.x
|View full text |Cite
|
Sign up to set email alerts
|

Proof and Paradox

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
28
0

Year Published

2012
2012
2024
2024

Publication Types

Select...
6
3

Relationship

1
8

Authors

Journals

citations
Cited by 41 publications
(34 citation statements)
references
References 4 publications
0
28
0
Order By: Relevance
“…So the wellbehaviour of a definition in the case of logic, where we do have cut elimination, is due to the fact that it obeys certain principles, which in the general case cannot be expected to hold. This connects the proof theory of clausal definitions with theories of paradoxes, which conceive paradoxes as based on locally correct reasoning (Prawitz [44] (Appendix B), Tennant [68], Schroeder-Heister [62], Tranchini [71]). For the situation that obtains here, Hallnäs [28] proposed the terms 'total' vs. 'partial' in analogy with the terminology used in recursive function theory.…”
Section: Logic Paradoxes Partial Definitionsmentioning
confidence: 99%
“…So the wellbehaviour of a definition in the case of logic, where we do have cut elimination, is due to the fact that it obeys certain principles, which in the general case cannot be expected to hold. This connects the proof theory of clausal definitions with theories of paradoxes, which conceive paradoxes as based on locally correct reasoning (Prawitz [44] (Appendix B), Tennant [68], Schroeder-Heister [62], Tranchini [71]). For the situation that obtains here, Hallnäs [28] proposed the terms 'total' vs. 'partial' in analogy with the terminology used in recursive function theory.…”
Section: Logic Paradoxes Partial Definitionsmentioning
confidence: 99%
“…What Yablo's paradox reveals is that we have to contend not only with vicious circles, but also with vicious helices. Tennant (1982) concentrated on logico-semantic paradoxes, but did also examine Russell's Paradox. Prawitz (1965) had shown how certain naïvely formulated introduction and elimination rules in set theory would-despite the fact that they appeared to admit of a reduction procedure-block the proof that all natural deductions can be brought into normal form.…”
Section: Background By Way Of Introductionmentioning
confidence: 99%
“…Reduction sequences that eventually produce a proof in normal form terminate. Tennant (1982) proposed a proof-theoretic criterion, or test, for paradoxicalitythat of non-terminating reduction sequences initated by the 'proofs of ⊥' associated with the paradoxes in question (p. 271). In that paper, the subsequent focus was on looping reduction sequences.…”
Section: Background By Way Of Introductionmentioning
confidence: 99%
“…For more on noncontractive approaches to paradoxes, see [25,11,20,36,2,33,15]. For more on nontransitive approaches, see [34,35,28,3,32]. Both approaches are susceptible to a cut-elimination style non-triviality proof (see [20,36] for the noncontractive approaches, and [28] for the nontransitive approaches).…”
Section: The Paradoxesmentioning
confidence: 99%