Proof-Theoretic Semantics and Feasibility (Q5250217): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: An arithmetic for non-size-increasing polynomial-time computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4936120 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Intuitionistic Light Affine Logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear logic by levels and bounded time complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Light types for polynomial time computation in lambda calculus / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new recursion-theoretic characterization of the polytime functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new “feasible” arithmetic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5793487 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5573965 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial size proofs of the propositional pigeonhole principle / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5586401 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5565113 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A judgmental reconstruction of modal logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Logique, effectivité et faisabilité / rank
 
Normal rank
Property / cites work
 
Property / cites work: Light 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: Safe recursion with higher types and BCK-algebra / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear types and non-size-increasing polynomial time computation. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cambridge summer school in mathematical logic, held in Cambridge/England, August 1-21, 1971 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3688389 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On an interpretation of safe recursion in light affine logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5559220 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3347874 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Light affine set theory: A naive set theory of polynomial time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Light affine lambda calculus and polynomial time strong normalization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constructivism in mathematics. An introduction. Volume II / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strict finitism / rank
 
Normal rank

Latest revision as of 02:58, 10 July 2024

scientific article; zbMATH DE number 6436523
Language Label Description Also known as
English
Proof-Theoretic Semantics and Feasibility
scientific article; zbMATH DE number 6436523

    Statements

    Proof-Theoretic Semantics and Feasibility (English)
    0 references
    0 references
    19 May 2015
    0 references
    feasible logic
    0 references
    feasible arithmetic
    0 references
    light affine logic
    0 references
    idealisation
    0 references
    proof-theoretical semantics
    0 references

    Identifiers