António Manuel Dinis Ribeiro Marques

Extracting Algorithms from Intuitionistic Proofs

This paper presents a new method - which does not rely on the cut-elimination theorem - for characterizing the provably total functions of certain intuitionistic subsystems of arithmetic. The new method hinges on a realizability argument within an infinitary language. We illustrate the method for the intuitionistic counterpart of Busss theory S, and we briefly sketch it for the other levels of bounded arithmetic and for the theory IΣ1.

Academic background as an influencing factor in the Gen Y’s sustainable consumption habits

This work is financed by FEDER funds through the Competitivity Factors Operational Programme - COMPETE and by national funds through FCT – Foundation for Science and Technology within the scope of the project POCI-01-0145-FEDER-007136