The Stratified Foundations as a Theory Modulo

  title={The Stratified Foundations as a Theory Modulo},
  author={Gilles Dowek},
  • Gilles Dowek
  • Published in TLCA 2 May 2001
  • Mathematics, Computer Science
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… 
1 Citations

Foundations of Mathematics from the Perspective of Computer Verification

It is argued that most philosophical views over-emphasize a particular aspect of the mathematical endeavor.



Stratification and cut-elimination

  • M. Crabbé
  • Mathematics
    Journal of Symbolic Logic
  • 1991
This paper shows the normalization of proofs of NF (Quine's New Foundations; see [15]) minus extensionality, which mirrors in proof theory the construction, by iteration of the power set operation, of a natural model of type theory.

Proof Normalization Modulo

A generic cut elimination theorem is proved showing that the cut elimination property holds for all theories having a so-called pre-model, including Church's simple type theory.

On the Consistency of a Slight (?) Modification of Quine’s New Foundations

Quine’s system of set theory, New Foundations (NF), can be conveniently formalized as a first-order theory containing two predicates ≡ (identity) and e (set membership). One of the most attractive

Combinatory Reduction Systems: Introduction and Survey

Theory and applications of explicit substitutions: Introduction

  • D. Kesner
  • Computer Science
    Mathematical Structures in Computer Science
  • 2001
This special issue of Mathematical Structures in Computer Science is dedicated to the theory and applications of explicit substitutions, which have attracted a growing community of researchers in the

HOL-λσ: an intentional first-order expression of higher-order logic

It is shown that the Extended Narrowing and Resolution first-order proof-search method can be applied to this theory, and a step-by-step simulation of higher-order resolution is given, showing that the well-studied improvements of proof search for first- order logic could be reused at no cost for higher- order automated deduction.

About Folding-Unfolding Cuts and Cuts Modulo

We show in this note that cut elimination in deduction modulo subsumes cut elimination in deduction with the folding and unfolding rules.

Non-normalisation de ZF

HOL-an intentional rst-order expression of higher-order logic

  • Mathematical Structures in Computer Science
  • 2001

Stratiication and cut-elimination. The Journal of Symbolic Logic

  • Stratiication and cut-elimination. The Journal of Symbolic Logic
  • 1991