4 research outputs found

    A Uniform Method for Proving Lower Bounds of the Computational Complexity of Logical Theories

    Full text link
    https://deepblue.lib.umich.edu/bitstream/2027.42/154178/1/39015100081655.pd

    A normal form for natural deductions in a type theory with realizing terms

    Get PDF

    Spektralproblem and Completeness of Logical Decision Problems

    No full text
    corecore