4 found
Order:
  1. Unfolding Feasible Arithmetic andWeak Truth.Thomas Strahm & Sebastian Eberhard - 2015 - In T. Achourioti, H. Galinon, J. Martínez Fernández & K. Fujimoto (eds.), Unifying the Philosophy of Truth. Dordrecht: Imprint: Springer.
     
    Export citation  
     
    Bookmark   4 citations  
  2.  22
    Inductive theorem proving based on tree grammars.Sebastian Eberhard & Stefan Hetzl - 2015 - Annals of Pure and Applied Logic 166 (6):665-700.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  3.  27
    A feasible theory of truth over combinatory algebra.Sebastian Eberhard - 2014 - Annals of Pure and Applied Logic 165 (5):1009-1033.
    We define an applicative theory of truth TPTTPT which proves totality exactly for the polynomial time computable functions. TPTTPT has natural and simple axioms since nearly all its truth axioms are standard for truth theories over an applicative framework. The only exception is the axiom dealing with the word predicate. The truth predicate can only reflect elementhood in the words for terms that have smaller length than a given word. This makes it possible to achieve the very low proof-theoretic strength. (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  4.  5
    Weak Theories of Truth and Explicit Mathematics.Sebastian Eberhard & Thomas Strahm - 2012 - In Ulrich Berger, Hannes Diener, Peter Schuster & Monika Seisenberger (eds.), Logic, Construction, Computation. De Gruyter. pp. 157-184.
    No categories
    Direct download  
     
    Export citation  
     
    Bookmark