scispace - formally typeset
Book ChapterDOI

Error and Predicativity

Reads0
Chats0
TLDR
The suggestion is that ideas originating in the predicativity debate as a reply to foundational errors are now having profound influence to the way the authors try to address the issue of local errors.
Abstract
The article surveys ideas emerging within the predicative tradition in the foundations of mathematics, and attempts a reading of predicativity constraints as highlighting different levels of understanding in mathematics. A connection is made with two kinds of error which appear in mathematics: local and foundational errors. The suggestion is that ideas originating in the predicativity debate as a reply to foundational errors are now having profound influence to the way we try to address the issue of local errors. Here fundamental new interactions between computer science and mathematics emerge.

read more

Citations
More filters

Bounded Arithmetic と計算量の根本問題

竹内 外史
TL;DR: Theorem 10: (Cut Elimination Theorem for Second Order Logic 171 as mentioned in this paper is a cut elimination theorem for first-order logic that guarantees that C R inferences are still valid after the substitution of V for a.
Book ChapterDOI

Predicativity and Feferman

TL;DR: Predicativity has been at the center of a considerable part of Feferman's work and has been explored alternative ways of explicating and analyzing this notion and has shown that predicative mathematics extends much further than expected within ordinary mathematics.
References
More filters
Book

Subsystems of Second Order Arithmetic

TL;DR: In this paper, the development of Mathematics within Subsystems of Z2 is discussed, with a focus on recursive comprehension and weak Konig's lemma, and a discussion of models of sub-systems.
Book ChapterDOI

An Intuitionistic Theory of Types: Predicative Part

TL;DR: The theory of types as mentioned in this paper is a full-scale system for formalizing intuitionistic mathematics as developed, which allows proofs to appear as parts of propositions so that the propositions of the theory can express properties of proofs.
Book ChapterDOI

Constructive mathematics and computer programming

TL;DR: This chapter discusses that relating constructive mathematics to computer programming seems to be beneficial, and that it may well be possible to turn what is now regarded as a high level programming language into machine code by the invention of new hardware.