Repository landing page

We are not able to resolve this OAI Identifier to the repository landing page. If you are the repository manager for this record, please head to the Dashboard and adjust the settings.
oaioai:episciences.org:lmcs:845

On completeness of reducibility candidates as a semantics of strong normalization

Authors
Publication date
16 February 2012
Publisher
Doi

    Abstract

    This paper defines a sound and complete semantic criterion, based onreducibility candidates, for strong normalization of theories expressed inminimal deduction modulo \`a la Curry. The use of Curry-style proof-termsallows to build this criterion on the classic notion of pre-Heyting algebrasand makes that criterion concern all theories expressed in minimal deductionmodulo. Compared to using Church-style proof-terms, this method provides both asimpler definition of the criterion and a simpler proof of its completeness.Comment: 24 page

    Similar works

    Full text

    thumbnail-image

    Episciences.org

    redirect
    oaioai:episciences.org:lmcs:845
    Last time updated on 02/12/2023

    This paper was published in Episciences.org.

    Having an issue?

    Is data on this page outdated, violates copyrights or anything else? Report the problem now and we will take corresponding actions after reviewing your request.