Light Dialectica Program Extraction from a Classical Fibonacci Proof (Q2864211): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.entcs.2006.10.050 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2160768215 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4215634 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Uniform Heyting arithmetic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Refined program extraction from classical proofs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Term rewriting for normalization by evaluation. / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Warshall algorithm and Dickson's lemma: Two examples of realistic program extraction / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new method for establishing conservativity of classical systems over their intuitionistic version / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounded functional interpretation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3994895 / rank
 
Normal rank
Property / cites work
 
Property / cites work: ÜBER EINE BISHER NOCH NICHT BENÜTZTE ERWEITERUNG DES FINITEN STANDPUNKTES / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computer Science Logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3837732 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some logical metatheorems with applications in functional analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4681899 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5344164 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A quadratic rate of asymptotic regularity for CAT(0)-spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Logical Approaches to Computational Barriers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unifying functional interpretations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Metamathematical investigation of intuitionistic arithmetic and analysis. With contributions by C. A. Smorynski, J. I. Zucker and W. A. Howard / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 03:57, 7 July 2024

scientific article
Language Label Description Also known as
English
Light Dialectica Program Extraction from a Classical Fibonacci Proof
scientific article

    Statements

    Light Dialectica Program Extraction from a Classical Fibonacci Proof (English)
    0 references
    0 references
    6 December 2013
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    proof mining
    0 references
    program extraction from proofs
    0 references
    complexity of extracted programs
    0 references
    refined A-translations
    0 references
    quantifiers without computational meaning
    0 references
    light Dialectica interpretation
    0 references
    computationally redundant contractions
    0 references
    Gödel's functional Dialectica interpretation
    0 references
    0 references