Switch to: Citations

Add references

You must login to add references.
  1. Realisability in weak systems of explicit mathematics.Daria Spescha & Thomas Strahm - 2011 - Mathematical Logic Quarterly 57 (6):551-565.
    This paper is a direct successor to 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 so-called join axiom of explicit mathematics.
    Direct download  
     
    Export citation  
     
    Bookmark   3 citations  
  • Elementary explicit types and polynomial time operations.Daria Spescha & Thomas Strahm - 2009 - Mathematical Logic Quarterly 55 (3):245-258.
    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 first-order applicative theories introduced in Strahm [19, 20].
    No categories
    Direct download  
     
    Export citation  
     
    Bookmark   5 citations  
  • The strength of extensionality II—weak weak set theories without infinity.Kentaro Sato - 2011 - Annals of Pure and Applied Logic 162 (8):579-646.
    By obtaining several new results on Cook-style two-sorted bounded arithmetic, this paper measures the strengths of the axiom of extensionality and of other weak fundamental set-theoretic axioms in the absence of the axiom of infinity, following the author’s previous work [K. Sato, The strength of extensionality I — weak weak set theories with infinity, Annals of Pure and Applied Logic 157 234–268] which measures them in the presence. These investigations provide a uniform framework in which three different kinds of reverse (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   5 citations  
  • The provably terminating operations of the subsystem of explicit mathematics.Dieter Probst - 2011 - Annals of Pure and Applied Logic 162 (11):934-947.
    In Spescha and Strahm [15], a system of explicit mathematics in the style of Feferman [6] and [7] is introduced, and in Spescha and Strahm [16] the addition of the join principle to is studied. Changing to intuitionistic logic, it could be shown that the provably terminating operations of are the polytime functions on binary words. However, although strongly conjectured, it remained open whether the same holds true for the corresponding theory with classical logic. This note supplements a proof of (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   4 citations  
  • Subsystems of set theory and second order number theory.Wolfram Pohlers - 1998 - In Samuel R. Buss (ed.), Bulletin of Symbolic Logic. Elsevier. pp. 137--209.
  • Subsystems of Set Theory and Second-Order Number Theory.Wolfram Pohlers - 2000 - Bulletin of Symbolic Logic 6 (4):467-469.
  • A Language and Axioms for Explicit Mathematics.Solomon Feferman, J. N. Crossley, Maurice Boffa, Dirk van Dalen & Kenneth Mcaloon - 1984 - Journal of Symbolic Logic 49 (1):308-311.
  • Logical foundations of proof complexity.Stephen Cook & Phuong Nguyen - 2011 - Bulletin of Symbolic Logic 17 (3):462-464.
    Direct download  
     
    Export citation  
     
    Bookmark   14 citations  
  • The Intrinsic Computational Difficulty of Functions.Alan Cobham - 1965 - In Yehoshua Bar-Hillel (ed.), Logic, Methodology and Philosophy of Science: Proceedings of the 1964 International Congress (Studies in Logic and the Foundations of Mathematics). North-Holland Publishing. pp. 24-30.
  • Asymmetric Interpretations for Bounded Theories.Andrea Cantini - 1996 - Mathematical Logic Quarterly 42 (1):270-288.
    We apply the method of asymmetric interpretation to the basic fragment of bounded arithmetic, endowed with a weak collection schema, and to a system of “feasible analysis”, introduced by Ferreira and based on weak König's lemma, recursive comprehension and NP-notation induction. As a byproduct, we obtain two conservation results.
    Direct download  
     
    Export citation  
     
    Bookmark   7 citations  
  • Theories for admissible sets: a unifying approach to proof theory.Gerhard Jäger - 1986 - Napoli: Bibliopolis.