Reconsidering pairs and functions as sets

DOI10.1007/S10817-015-9340-6zbMath1356.68183OpenAlexW2295607337MaRDI QIDQ286796

Chad Edward Brown

Publication date: 26 May 2016

Published in: Journal of Automated Reasoning (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10817-015-9340-6

zbMATH Keywords

higher-order logicset theoryfunctionshigher-order theorem provingordered pairssimple type theory

Mathematics Subject Classification ID

Mechanization of proofs and logical operations (03B35) Axiomatics of classical set theory and its fragments (03E30) Other classical set theory (including functions, relations, and set algebra) (03E20)

Uses Software

• Isabelle/ZF
• Unnamed Item

Cites Work

• Set theory for verification. I: From foundations to functions
• Completeness and Cut-elimination in the Intuitionistic Theory of Types
• Partizan Games in Isabelle/HOLZF
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Reconsidering pairs and functions as sets