On Constructive Existence

  • Michel Parigot
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3839)


Baaz and Fermueller gave in 2003 an original characterization of constructive existence in classical logic [2]. In this note, we give a simple proof of this result based on cut-elimination in sequent calculus. The interest of this proof besides its simplicity is that it allows in particular to generalize the result to other logics enjoying cut-elimination. We also briefly discuss the significance of the characterization itself.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    Baaz, M.: Note on a translation to characterize constructivity. Proceedings of the Steklov Institute of Mathematics 242, 125,129 (2003)MathSciNetGoogle Scholar
  2. [2]
    Baaz, M., Fermueller, C.: A translation characterizing the constructive content of classical theories. In: Vardi, M.Y., Voronkov, A. (eds.) LPAR 2003. LNCS (LNAI), vol. 2850, pp. 107–121. Springer, Heidelberg (2003)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Michel Parigot
    • 1
  1. 1.Équipe “Preuves, Programmes, Systèmes”, CNRSUniversité Paris 7, Case 7024Paris

Personalised recommendations