Results 1  10
of
25
A New Method for Establishing Conservativity of Classical Systems Over Their Intuitionistic Version
"... this paper we present such a method. Applied to I \Sigma ..."
Abstract

Cited by 22 (1 self)
 Add to MetaCart
this paper we present such a method. Applied to I \Sigma
Proof Interpretations and the Computational Content of Proofs. Draft of book in preparation
, 2007
"... This survey reports on some recent developments in the project of applying proof theory to proofs in core mathematics. The historical roots, however, go back to Hilbert’s central theme in the foundations of mathematics which can be paraphrased by the following question ..."
Abstract

Cited by 16 (2 self)
 Add to MetaCart
This survey reports on some recent developments in the project of applying proof theory to proofs in core mathematics. The historical roots, however, go back to Hilbert’s central theme in the foundations of mathematics which can be paraphrased by the following question
The metamathematics of ergodic theory
 THE ANNALS OF PURE AND APPLIED LOGIC
, 2009
"... The metamathematical tradition, tracing back to Hilbert, employs syntactic modeling to study the methods of contemporary mathematics. A central goal has been, in particular, to explore the extent to which infinitary methods can be understood in computational or otherwise explicit terms. Ergodic theo ..."
Abstract

Cited by 13 (1 self)
 Add to MetaCart
(Show Context)
The metamathematical tradition, tracing back to Hilbert, employs syntactic modeling to study the methods of contemporary mathematics. A central goal has been, in particular, to explore the extent to which infinitary methods can be understood in computational or otherwise explicit terms. Ergodic theory provides rich opportunities for such analysis. Although the field has its origins in seventeenth century dynamics and nineteenth century statistical mechanics, it employs infinitary, nonconstructive, and structural methods that are characteristically modern. At the same time, computational concerns and recent applications to combinatorics and number theory force us to reconsider the constructive character of the theory and its methods. This paper surveys some recent contributions to the metamathematical study of ergodic theory, focusing on the mean and pointwise ergodic theorems and the Furstenberg structure theorem for measure preserving systems. In particular, I characterize the extent to which these theorems are nonconstructive, and explain how prooftheoretic methods can be used to locate their “constructive content.”
Mathematical method and proof
"... Abstract. On a traditional view, the primary role of a mathematical proof is to warrant the truth of the resulting theorem. This view fails to explain why it is very often the case that a new proof of a theorem is deemed important. Three case studies from elementary arithmetic show, informally, that ..."
Abstract

Cited by 11 (6 self)
 Add to MetaCart
(Show Context)
Abstract. On a traditional view, the primary role of a mathematical proof is to warrant the truth of the resulting theorem. This view fails to explain why it is very often the case that a new proof of a theorem is deemed important. Three case studies from elementary arithmetic show, informally, that there are many criteria by which ordinary proofs are valued. I argue that at least some of these criteria depend on the methods of inference the proofs employ, and that standard models of formal deduction are not wellequipped to support such evaluations. I discuss a model of proof that is used in the automated deduction community, and show that this model does better in that respect.
A realizability interpretation for classical arithmetic
 In Buss, Hájek, and Pudlák eds., Logic colloquium ’98, AK Peters, 57–90
, 2000
"... Summary. A constructive realizablity interpretation for classical arithmetic is presented, enabling one to extract witnessing terms from proofs of Σ1 sentences. The interpretation is shown to coincide with modified realizability, under a novel translation of classical logic to intuitionistic logic, ..."
Abstract

Cited by 11 (7 self)
 Add to MetaCart
(Show Context)
Summary. A constructive realizablity interpretation for classical arithmetic is presented, enabling one to extract witnessing terms from proofs of Σ1 sentences. The interpretation is shown to coincide with modified realizability, under a novel translation of classical logic to intuitionistic logic, followed by the FriedmanDragalin translation. On the other hand, a natural set of reductions for classical arithmetic is shown to be compatible with the normalization of the realizing term, implying that certain strategies for eliminating cuts and extracting a witness from the proof of a Σ1 sentence are insensitive to the order in which reductions are applied. 1
Choice and uniformity in weak applicative theories
 Logic Colloquium ’01
, 2005
"... Abstract. We are concerned with first order theories of operations, based on combinatory logic and extended with the type W of binary words. The theories include forms of “positive ” and “bounded ” induction on W and naturally characterize primitive recursive and polytime functions (respectively). W ..."
Abstract

Cited by 10 (0 self)
 Add to MetaCart
(Show Context)
Abstract. We are concerned with first order theories of operations, based on combinatory logic and extended with the type W of binary words. The theories include forms of “positive ” and “bounded ” induction on W and naturally characterize primitive recursive and polytime functions (respectively). We prove that the recursive content of the theories under investigation (i.e. the associated class of provably total functions on W) is invariant under addition of 1. an axiom of choice for operations and a uniformity principle, restricted to positive conditions; 2. a (form of) selfreferential truth, providing a fixed point theorem for predicates. As to the proof methods, we apply a kind of internal forcing semantics, nonstandard variants of realizability and cutelimination. §1. Introduction. In this paper, we deal with theories of abstract computable operations, underlying the socalled explicit mathematics, introduced by Feferman in the midseventies as a logical frame to formalize Bishop’s style constructive mathematics ([18], [19]). Following a common usage, these theories
Saturated models of universal theories
, 2001
"... A notion called Herbrand saturation is shown to provide the modeltheoretic analogue of a prooftheoretic method, Herbrand analysis, yielding uniform modeltheoretic proofs of a number of important conservation theorems. A constructive, algebraic variation of the method is described, providing yet ..."
Abstract

Cited by 9 (5 self)
 Add to MetaCart
(Show Context)
A notion called Herbrand saturation is shown to provide the modeltheoretic analogue of a prooftheoretic method, Herbrand analysis, yielding uniform modeltheoretic proofs of a number of important conservation theorems. A constructive, algebraic variation of the method is described, providing yet a third approach, which is finitary but retains the semantic flavor of the modeltheoretic version.
"Clarifying the Nature of the Infinite": the development of metamathematics and proof theory
, 2001
"... We discuss the development of metamathematics in the Hilbert school, and Hilbert's prooftheoretic program in particular. We place this program in a broader historical and philosophical context, especially with respect to nineteenth century developments in mathematics and logic. Finally, we sho ..."
Abstract

Cited by 9 (3 self)
 Add to MetaCart
We discuss the development of metamathematics in the Hilbert school, and Hilbert's prooftheoretic program in particular. We place this program in a broader historical and philosophical context, especially with respect to nineteenth century developments in mathematics and logic. Finally, we show how these considerations help frame our understanding of metamathematics and proof theory today.
Forcing in Proof Theory
 BULL SYMB LOGIC
, 2004
"... Paul Cohen's method of forcing, together with Saul Kripke's related semantics for modal and intuitionistic logic, has had profound effects on a number of branches of mathematical logic, from set theory and model theory to constructive and categorical logic. Here, I argue that forcing also ..."
Abstract

Cited by 7 (0 self)
 Add to MetaCart
(Show Context)
Paul Cohen's method of forcing, together with Saul Kripke's related semantics for modal and intuitionistic logic, has had profound effects on a number of branches of mathematical logic, from set theory and model theory to constructive and categorical logic. Here, I argue that forcing also has a place in traditional Hilbertstyle proof theory, where the goal is to formalize portions of ordinary mathematics in restricted axiomatic theories, and study those theories in constructive or syntactic terms. I will discuss the aspects of forcing that are useful in this respect, and some sample applications. The latter include ways of obtaining conservation results for classical and intuitionistic theories, interpreting classical theories in constructive ones, and constructivizing modeltheoretic arguments.
Functional interpretation and inductive definitions
 Journal of Symbolic Logic
"... Abstract. Extending Gödel’s Dialectica interpretation, we provide a functional interpretation of classical theories of positive arithmetic inductive definitions, reducing them to theories of finitetype functionals defined using transfinite recursion on wellfounded trees. 1. ..."
Abstract

Cited by 7 (3 self)
 Add to MetaCart
(Show Context)
Abstract. Extending Gödel’s Dialectica interpretation, we provide a functional interpretation of classical theories of positive arithmetic inductive definitions, reducing them to theories of finitetype functionals defined using transfinite recursion on wellfounded trees. 1.