A normalization theorem for set theory

DOI10.2307/2274565MaRDI QIDQ4732467zbMATH OpenOpenAlexFDO

Authors Sidney C. Bailin

Publication date 1988

Published in Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL https://doi.org/10.2307/2274565

zbMATH Keywords

cut-free algorithmnormal proofnormalization theorem for a natural proof system of Zermelo Set Theory

Mathematics Subject Classification ID

Mechanization of proofs and logical operations (03B35) Axiomatics of classical set theory and its fragments (03E30) Cut-elimination and normal-form theorems (03F05)

Recommendations

• scientific article; zbMATH DE number 3950526
• scientific article; zbMATH DE number 4091495
• Normality theorems on shared sets
• Computer Science Logic
• NORMALITY AND SHARED SETS
• Normal relations on sets and applications
• scientific article; zbMATH DE number 4178338
• A generalization of the theory of normal forms
• Norming sets and compactness

Cites work

• scientific article; zbMATH DE number 3348059 (Why is no real title available?)
• The lambda calculus, its syntax and semantics

Cited in

(4)

• \({\mathcal Z}\)-match: An inference rule for incrementally elaborating set instantiations
• scientific article; zbMATH DE number 3950526 (Why is no real title available?)
• scientific article; zbMATH DE number 4091495 (Why is no real title available?)
• Proof normalization modulo

This page was built for publication: A normalization theorem for set theory

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4732467)