Please help us test our new pre-print finding feature by giving the pre-print link a rating. A 5 star rating indicates the linked pre-print has the exact same content as the published article.
Authors:VELDMAN; WIM Pages: 1 - 52 Abstract: We argue that some of Brouwer’s assumptions, rejected by Bishop, should be considered and studied as possible axioms. We show that Brouwer’s Continuity Principle enables one to prove an intuitionistic Borel Hierarchy Theorem. We also explain that Brouwer’s Fan Theorem is useful for a development of the theory of measure and integral different from the one worked out by Bishop. We show that Brouwer’s bar theorem not only proves the Fan Theorem but also a stronger statement that we call the Almost-fan Theorem. The Almost-fan Theorem implies intuitionistic versions of Ramsey’s Theorem and the Bolzano-Weierstrass Theorem. PubDate: 2025-04-16 DOI: 10.1017/bsl.2024.52
Please help us test our new pre-print finding feature by giving the pre-print link a rating. A 5 star rating indicates the linked pre-print has the exact same content as the published article.
Please help us test our new pre-print finding feature by giving the pre-print link a rating. A 5 star rating indicates the linked pre-print has the exact same content as the published article.
Please help us test our new pre-print finding feature by giving the pre-print link a rating. A 5 star rating indicates the linked pre-print has the exact same content as the published article.
Authors:JEŘÁBEK; EMIL Pages: 53 - 87 Abstract: We present a streamlined and simplified exponential lower bound on the length of proofs in intuitionistic implicational logic, adapted to Gordeev and Haeusler’s dag-like natural deduction. PubDate: 2025-01-22 DOI: 10.1017/bsl.2025.6
Please help us test our new pre-print finding feature by giving the pre-print link a rating. A 5 star rating indicates the linked pre-print has the exact same content as the published article.
Authors:LEITGEB; HANNES, NODELMAN, URI, ZALTA, EDWARD N. Pages: 88 - 152 Abstract: We argue that logicism, the thesis that mathematics is reducible to logic and analytic truths, is true. We do so by (a) developing a formal framework with comprehension and abstraction principles, (b) giving reasons for thinking that this framework is part of logic, (c) showing how the denotations for predicates and individual terms of an arbitrary mathematical theory can be viewed as logical objects that exist in the framework, and (d) showing how each theorem of a mathematical theory can be given an analytically true reading in the logical framework. PubDate: 2025-04-07 DOI: 10.1017/bsl.2024.28
Please help us test our new pre-print finding feature by giving the pre-print link a rating. A 5 star rating indicates the linked pre-print has the exact same content as the published article.
Please help us test our new pre-print finding feature by giving the pre-print link a rating. A 5 star rating indicates the linked pre-print has the exact same content as the published article.
Please help us test our new pre-print finding feature by giving the pre-print link a rating. A 5 star rating indicates the linked pre-print has the exact same content as the published article.
Subscription journal
