Light Dialectica revisited (Q636373): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
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: Linear logic / 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: Hybrid Functional Interpretations / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on Spector's quantifier-free rule of extensionality / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unifying functional interpretations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational Interpretations of Classical Linear Logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dialectica interpretation of well-founded induction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5519134 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dialectica Interpretation with Fine Computational Control / 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

Latest revision as of 10:48, 4 July 2024

scientific article
Language Label Description Also known as
English
Light Dialectica revisited
scientific article

    Statements

    Light Dialectica revisited (English)
    0 references
    0 references
    0 references
    26 August 2011
    0 references
    0 references
    0 references
    0 references
    0 references
    computational content of proofs
    0 references
    functional interpretations
    0 references
    program extraction from proofs
    0 references
    light Dialectica interpretation
    0 references
    light/uniform quantifiers
    0 references
    automated program synthesis
    0 references
    0 references
    0 references