Details
| Original language | English |
|---|---|
| Title of host publication | Mathesis Universalis, Computability and Proof |
| Place of Publication | Cham |
| Pages | 47-53 |
| Number of pages | 7 |
| ISBN (electronic) | 978-3-030-20447-1 |
| Publication status | Published - 2019 |
| Externally published | Yes |
Publication series
| Name | Synthese Library |
|---|---|
| Volume | 412 |
| ISSN (Print) | 0166-6991 |
| ISSN (electronic) | 2542-8292 |
Abstract
In constructive proofs of negated statements, case distinctions are permitted. We illustrate the strength of this well-known and useful fact in the context of automatic continuity in convex analysis. This sheds light on the level of logic needed to deduce some prominent results and thus fits in well with the concept of Proof Theory as Mathesis Universalis.
ASJC Scopus subject areas
- Arts and Humanities(all)
- History and Philosophy of Science
- Arts and Humanities(all)
- History
- Arts and Humanities(all)
- Language and Linguistics
- Mathematics(all)
- Logic
Cite this
- Standard
- Harvard
- Apa
- Vancouver
- BibTeX
- RIS
Mathesis Universalis, Computability and Proof. Cham, 2019. p. 47-53 (Synthese Library; Vol. 412).
Research output: Chapter in book/report/conference proceeding › Contribution to book/anthology › Research › peer review
}
TY - CHAP
T1 - Constructive Proofs of Negated Statements
AU - Berger, J.
AU - Svindland, G.
N1 - Funding information: This project has received funding from the European Union’s Horizon 2020 research and innovation programme under the Marie Sk?odowska-Curie grant agreement No 731143.
PY - 2019
Y1 - 2019
N2 - In constructive proofs of negated statements, case distinctions are permitted. We illustrate the strength of this well-known and useful fact in the context of automatic continuity in convex analysis. This sheds light on the level of logic needed to deduce some prominent results and thus fits in well with the concept of Proof Theory as Mathesis Universalis.
AB - In constructive proofs of negated statements, case distinctions are permitted. We illustrate the strength of this well-known and useful fact in the context of automatic continuity in convex analysis. This sheds light on the level of logic needed to deduce some prominent results and thus fits in well with the concept of Proof Theory as Mathesis Universalis.
UR - http://www.scopus.com/inward/record.url?scp=85114725498&partnerID=8YFLogxK
U2 - 10.1007/978-3-030-20447-1_5
DO - 10.1007/978-3-030-20447-1_5
M3 - Contribution to book/anthology
SN - 978-3-030-20449-5
SN - 978-3-030-20446-4
T3 - Synthese Library
SP - 47
EP - 53
BT - Mathesis Universalis, Computability and Proof
CY - Cham
ER -