Results 1 
6 of
6
Foundational and mathematical uses of higher types
 REFLECTIONS ON THE FOUNDATIONS OF MATHEMATICS: ESSAY IN HONOR OF SOLOMON FEFERMAN
, 1999
"... In this paper we develop mathematically strong systems of analysis in higher types which, nevertheless, are prooftheoretically weak, i.e. conservative over elementary resp. primitive recursive arithmetic. These systems are based on noncollapsing hierarchies ( n WKL+ ; n WKL+ ) of principles ..."
Abstract

Cited by 11 (4 self)
 Add to MetaCart
In this paper we develop mathematically strong systems of analysis in higher types which, nevertheless, are prooftheoretically weak, i.e. conservative over elementary resp. primitive recursive arithmetic. These systems are based on noncollapsing hierarchies ( n WKL+ ; n WKL+ ) of principles which generalize (and for n = 0 coincide with) the socalled `weak' König's lemma WKL (which has been studied extensively in the context of second order arithmetic) to logically more complex tree predicates. Whereas the second order context used in the program of reverse mathematics requires an encoding of higher analytical concepts like continuous functions F : X ! Y between Polish spaces X;Y , the more exible language of our systems allows to treat such objects directly. This is of relevance as the encoding of F used in reverse mathematics tacitly yields a constructively enriched notion of continuous functions which e.g. for F : IN ! IN can be seen (in our higher order context)
A New Approach to Predicative Set Theory
"... We suggest a new basic framework for the WeylFeferman predicativist program by constructing a formal predicative set theory PZF which resembles ZF. The basic idea is that the predicatively acceptable instances of the comprehension schema are those which determine the collections they define in an a ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
We suggest a new basic framework for the WeylFeferman predicativist program by constructing a formal predicative set theory PZF which resembles ZF. The basic idea is that the predicatively acceptable instances of the comprehension schema are those which determine the collections they define in an absolute way, independent of the extension of the “surrounding universe”. This idea is implemented using syntactic safety relations between formulas and sets of variables. These safety relations generalize both the notion of domainindependence from database theory, and Godel notion of absoluteness from set theory. The language of PZF is typefree, and it reflects real mathematical practice in making an extensive use of statically defined abstract set terms. Another important feature of PZF is that its underlying logic is ancestral logic (i.e. the extension of FOL with a transitive closure operation). 1
Amending Frege’s Grundgesetze der Arithmetik, Synthese Vol.147
, 2005
"... Abstract. Frege’s Grundgesetze der Arithmetik is formally inconsistent. This system is, except for minor differences, secondorder logic together with an abstraction operator governed by Frege’s Axiom V. A few years ago, Richard Heck showed that the ramified predicative secondorder fragment of the ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Abstract. Frege’s Grundgesetze der Arithmetik is formally inconsistent. This system is, except for minor differences, secondorder logic together with an abstraction operator governed by Frege’s Axiom V. A few years ago, Richard Heck showed that the ramified predicative secondorder fragment of the Grundgesetze is consistent. In this paper, we show that the above fragment augmented with the axiom of reducibility for concepts true of only finitely many individuals is still consistent, and that elementary Peano arithmetic (and more) is interpretable in this extended system.
Statement
"... legal responsibility for the information which this document contains or the use to which this information is subsequently put. Although every step is taken to ensure that the information is as accurate as possible, it is understood that this material is supplied on the basis that there is no legal ..."
Abstract
 Add to MetaCart
legal responsibility for the information which this document contains or the use to which this information is subsequently put. Although every step is taken to ensure that the information is as accurate as possible, it is understood that this material is supplied on the basis that there is no legal responsibility for these materials or resulting from the use to which these can or may be put. Note: the telephone and fax numbers given in this guide for addresses outside the United Kingdom are those to be used if you are in that country. If you are telephoning or faxing from another country, we suggest you contact your local telecommunications provider for details of the country code and area code that you should use. Main contents
The Hilbert problems and Hilbert’s Program
, 2008
"... In 1900 the great mathematician David Hilbert laid down a list of 23 mathematical problems [32] which exercised a great influence on subsequent mathematical research. From the perspective of foundational studies, it is noteworthy that Hilbert’s Problems 1 and 2 are squarely in the area of foundation ..."
Abstract
 Add to MetaCart
In 1900 the great mathematician David Hilbert laid down a list of 23 mathematical problems [32] which exercised a great influence on subsequent mathematical research. From the perspective of foundational studies, it is noteworthy that Hilbert’s Problems 1 and 2 are squarely in the area of foundations of mathematics, while Problems 10 and 17 turned out to be closely related to mathematical logic.
On the calculating power of Laplace’s demon (Part I)
, 2006
"... We discuss several ways of making precise the informal concept of physical determinism, drawing on ideas from mathematical logic and computability theory. We outline a programme of investigating these notions of determinism in detail for specific, precisely articulated physical theories. We make a s ..."
Abstract
 Add to MetaCart
We discuss several ways of making precise the informal concept of physical determinism, drawing on ideas from mathematical logic and computability theory. We outline a programme of investigating these notions of determinism in detail for specific, precisely articulated physical theories. We make a start on our programme by proposing a general logical framework for describing physical theories, and analysing several possible formulations of a simple Newtonian theory from the point of view of determinism. Our emphasis throughout is on clarifying the precise physical and metaphysical assumptions that typically underlie a claim that some physical theory is ‘deterministic’. A sequel paper is planned, in which we shall apply similar methods to the analysis of other physical theories. Along the way, we discuss some possible repercussions of this kind of investigation for both physics and logic. 1