Results 1  10
of
10
Weak theories of nonstandard arithmetic and analysis
 Reverse Mathematics
, 2001
"... Abstract. A general method of interpreting weak highertype theories of nonstandard arithmetic in their standard counterparts is presented. In particular, this provides natural nonstandard conservative extensions of primitive recursive arithmetic, elementary recursive arithmetic, and polynomialtime ..."
Abstract

Cited by 7 (5 self)
 Add to MetaCart
Abstract. A general method of interpreting weak highertype theories of nonstandard arithmetic in their standard counterparts is presented. In particular, this provides natural nonstandard conservative extensions of primitive recursive arithmetic, elementary recursive arithmetic, and polynomialtime computable arithmetic. A means of formalizing basic real analysis in such theories is sketched. §1. Introduction. Nonstandard analysis, as developed by Abraham Robinson, provides an elegant paradigm for the application of metamathematical ideas in mathematics. The idea is simple: use modeltheoretic methods to build rich extensions of a mathematical structure, like secondorder arithmetic or a universe of sets; reason about what is true in these enriched structures;
A ProofTheoretic Characterization of the Basic Feasible Functionals
 Theoretical Computer Science
, 2002
"... We provide a natural characterization of the type two MehlhornCookUrquhart basic feasible functionals as the provably total type two functionals of our (classical) applicative theory PT introduced in [27], thus providing a proof of a result claimed in the conclusion of [27]. ..."
Abstract

Cited by 7 (6 self)
 Add to MetaCart
We provide a natural characterization of the type two MehlhornCookUrquhart basic feasible functionals as the provably total type two functionals of our (classical) applicative theory PT introduced in [27], thus providing a proof of a result claimed in the conclusion of [27].
Elementary explicit types and polynomial time operations
, 2008
"... This paper studies systems of explicit mathematics as introduced by Feferman [9, 11]. In particular, we propose weak explicit type systems with a restricted form of elementary comprehension whose provably terminating operations coincide with the functions on binary words that are computable in polyn ..."
Abstract

Cited by 6 (5 self)
 Add to MetaCart
This paper studies systems of explicit mathematics as introduced by Feferman [9, 11]. In particular, we propose weak explicit type systems with a restricted form of elementary comprehension whose provably terminating operations coincide with the functions on binary words that are computable in polynomial time. The systems considered are natural extensions of the firstorder applicative theories introduced in
Weak theories of operations and types
"... This is a survey paper on various weak systems of Feferman’s explicit mathematics and their proof theory. The strength of the systems considered in measured in terms of their provably terminating operations typically belonging to some natural classes of computational time or space complexity. Keywor ..."
Abstract

Cited by 4 (3 self)
 Add to MetaCart
This is a survey paper on various weak systems of Feferman’s explicit mathematics and their proof theory. The strength of the systems considered in measured in terms of their provably terminating operations typically belonging to some natural classes of computational time or space complexity. Keywords: Proof theory, Feferman’s explicit mathematics, applicative theories, higher types, types and names, partial truth, feasible operations 1
The provably terminating operations of the subsystem PETJ of explicit mathematics
, 2010
"... In Spescha and Strahm [15], a system PET of explicit mathematics in the style of Feferman [7, 8] is introduced, and in Spescha and Strahm [16] the addition of the join principle to PET is studied. Changing to intuitionistic logic, it could be shown that the provably terminating operations of PETJ i ..."
Abstract

Cited by 4 (1 self)
 Add to MetaCart
In Spescha and Strahm [15], a system PET of explicit mathematics in the style of Feferman [7, 8] is introduced, and in Spescha and Strahm [16] the addition of the join principle to PET is studied. Changing to intuitionistic logic, it could be shown that the provably terminating operations of PETJ i are the polytime functions on binary words. However, although strongly conjectured, it remained open whether the same holds true for the corresponding theory PETJ with classical logic. This note supplements a proof of this conjecture. Keywords: Explicit mathematics, polytime functions, nonstandard models
Weak theories of truth and explicit mathematics. Submitted for publication. 19
"... We study weak theories of truth over combinatory logic and their relationship to weak systems of explicit mathematics. In particular, we consider two truth theories TPR and TPT of primitive recursive and feasible strength. The latter theory is a novel abstract truththeoretic setting which is able t ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
We study weak theories of truth over combinatory logic and their relationship to weak systems of explicit mathematics. In particular, we consider two truth theories TPR and TPT of primitive recursive and feasible strength. The latter theory is a novel abstract truththeoretic setting which is able to interpret expressive feasible subsystems of explicit mathematics. 1
Primitive Recursive Selection Functions for Existential Assertions over Abstract Algebras
"... Abstract. We generalize to abstract manysorted algebras the classical prooftheoretic result due to Parsons, Mints and Takeuti that an assertion ∀x ∃y P(x,y) (where P is Σ0 1), provable in Peano arithmetic with Σ0 1 induction, has a primitive recursive selection function. This involves a correspond ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
Abstract. We generalize to abstract manysorted algebras the classical prooftheoretic result due to Parsons, Mints and Takeuti that an assertion ∀x ∃y P(x,y) (where P is Σ0 1), provable in Peano arithmetic with Σ0 1 induction, has a primitive recursive selection function. This involves a corresponding generalization to such algebras of the notion of primitive recursiveness. The main difficulty encountered in carrying out this generalization turns out to be the fact that equality over these algebras may not be computable, and hence atomic formulae in their signatures may not be decidable. The solution given here is to develop an appropriate concept of realizability of existential assertions over such algebras, generalized to realizability of sequents of existential assertions. In this way, the results can be seen to hold for classical proof systems. This investigation may give some insight into the relationship between specifiability and computability for data types such as the reals, where the atomic formulae, i.e., equations between terms of type real, are not computable. Key words and phrases: generalized computability, realizability, selection function2 1
Unfolding feasible arithmetic and weak truth
, 2012
"... In this paper we continue Feferman’s unfolding program initiated in [11] which uses the concept of the unfolding U(S) of a schematic system S in order to describe those operations, predicates and principles concerning them, which are implicit in the acceptance of S. The program has been carried thro ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
In this paper we continue Feferman’s unfolding program initiated in [11] which uses the concept of the unfolding U(S) of a schematic system S in order to describe those operations, predicates and principles concerning them, which are implicit in the acceptance of S. The program has been carried through for a schematic system of nonfinitist arithmetic NFA in Feferman and Strahm [13] and for a system FA (with and without Bar rule) in Feferman and Strahm [14]. The present contribution elucidates the concept of unfolding for a basic schematic system FEA of feasible arithmetic. Apart from the operational unfolding U0(FEA) of FEA, we study two full unfolding notions, namely the predicate unfolding U(FEA) and a more general truth unfolding UT(FEA) of FEA, the latter making use of a truth predicate added to the language of the operational unfolding. The main results obtained are that the provably convergent functions on binary words for all three unfolding systems are precisely those being computable in polynomial time. The upper bound computations make essential use of a specific theory of truth TPT over combinatory logic, which has recently been introduced in Eberhard and Strahm [7] and Eberhard [6] and whose involved prooftheoretic analysis is due to Eberhard [6]. The results of this paper were first announced in [8].
Applicative theories for logarithmic complexity classes
"... We present applicative theories of words corresponding to weak, and especially logarithmic, complexity classes. The theories for the logarithmic hierarchy and alternating logarithmic time formalise function algebras with concatenation recursion as main principle. We present two theories for logarith ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
We present applicative theories of words corresponding to weak, and especially logarithmic, complexity classes. The theories for the logarithmic hierarchy and alternating logarithmic time formalise function algebras with concatenation recursion as main principle. We present two theories for logarithmic space where the first formalises a new twosorted algebra which is very similar to Cook and Bellantoni’s famous twosorted algebra B for polynomial time [4]. The second theory describes logarithmic space by justifying concatenation and sharply bounded recursion. All theories contain the predicates W representing words, and V representing temporary inaccessible words. They are inspired by Cantini’s theories [6] formalising B. 1.
Realisability in weak systems of explicit mathematics
, 2010
"... This paper is a direct successor to Spescha and Strahm [12]. Its aim is to introduce a new realisability interpretation for weak systems of explicit mathematics and use it in order to analyze extensions of the theory PET in [12] by the socalled join axiom of explicit mathematics. 1 ..."
Abstract
 Add to MetaCart
This paper is a direct successor to Spescha and Strahm [12]. Its aim is to introduce a new realisability interpretation for weak systems of explicit mathematics and use it in order to analyze extensions of the theory PET in [12] by the socalled join axiom of explicit mathematics. 1