Advertisement

The Stratified Foundations as a Theory Modulo

  • Gilles Dowek
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2044)

Abstract

The Stratified Foundations are a restriction of naive set theory where the comprehension scheme is restricted to stratifiable propositions. It is known that this theory is consistent and that proofs strongly normalize in this theory. Deduction modulo is a formulation of first-order logic with a general notion of cut. It is known that proofs normalize in a theory modulo if it has some kind of many-valued model called a pre-model. We show in this paper that the Stratified Foundations can be presented in deduction modulo and that the method used in the original normalization proof can be adapted to construct a pre-model for this theory.

Keywords

Free Variable Atomic Proposition Comprehension Scheme Natural Deduction Proof Search 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    M. Crabbé. Non-normalisation de ZF. Manuscript, 1974.Google Scholar
  2. 2.
    M. Crabbé. Stratification and cut-elimination. The Journal of Symbolic Logic, 56:213–226, 1991.zbMATHCrossRefMathSciNetGoogle Scholar
  3. 3.
    G. Dowek. La part du calcul. Université de Paris 7, 1999. Mémoire d’habilitation.Google Scholar
  4. 4.
    G. Dowek, About folding-unfolding cuts and cuts modulo. Journal of Logic and Computation (to appear).Google Scholar
  5. 5.
    G. Dowek, Th. Hardin, and C. Kirchner. Theorem proving modulo. Rapport de Recherche 3400, Institut National de Recherche en Informatique et en Automatique, 1998. Journal of Automated Reasoning (to appear).Google Scholar
  6. 6.
    G. Dowek, Th. Hardin, and C. Kirchner. HOL-λσ an intentional first-order expression of higher-order logic. Mathematical Structures in Computer Science, 11, 2001, pp. 1–25.CrossRefMathSciNetGoogle Scholar
  7. 7.
    G. Dowek and B. Werner. Proof normalization modulo. In Types for proofs and programs 98, volume 1657 of Lecture Notes in Computer Science, pages 62–77. Springer-Verlag, 1999.CrossRefGoogle Scholar
  8. 8.
    R.B. Jensen. On the consistency of a slight (?) modification of Quine’s new foundations. Synthese, 19, 1968-69, pp. 250–263.zbMATHCrossRefGoogle Scholar
  9. 9.
    J.W. Klop, V. van Oostrom, and F. van Raamsdonk. Combinatory reduction systems: introduction and survey. Theoretical Computer Science, 121:279–308, 1993.zbMATHCrossRefMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2001

Authors and Affiliations

  • Gilles Dowek
    • 1
  1. 1.INRIA-RocquencourtLe Chesnay CedexFrance

Personalised recommendations