A normalization theorem for set theory (Q4732467)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4118365
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A normalization theorem for set theory |
scientific article; zbMATH DE number 4118365 |
Statements
A normalization theorem for set theory (English)
0 references
1988
0 references
normalization theorem for a natural proof system of Zermelo Set Theory
0 references
normal proof
0 references
cut-free algorithm
0 references
0 references
0.85763943
0 references
0.85387367
0 references
0 references
A normalization theorem for a natural proof system of Zermelo Set Theory is presented. To get around examples of non-normalizability, a new inference rule is added. With this modified definition of ``normal'', it is no longer true that the normalization theorem implies consistency of Zermelo Set Theory. However, the modified notion of normal proof is sufficient to prove the completeness of the cut-free algorithm that searches for a proof of a given formula in set theory. The paper is concluded by comments on this algorithm and its potential use in an automated theorem prover for set theory.
0 references