Computing in Cantor’s Paradise with λ ZFC

DOI10.1007/978-3-642-29822-6_23zbMATH Open1354.03010OpenAlexW102508903MaRDI QIDQ2900271FDOQ2900271

Authors: Neil Toronto, Jay McCarthy 

Publication date: 20 July 2012

Published in: Functional and Logic Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-29822-6_23

Recommendations

• scientific article; zbMATH DE number 3933051
• scientific article; zbMATH DE number 4087654
• Computability and representations of the zero set
• Computable structures and the hyperarithmetical hierarchy
• Generalizations of Cantor's theorem in \(\mathsf{ZF}\)
• On \(0'\)-computable reals
• Computability on the countable ordinals and the Hausdorff-Kuratowski theorem (extended abstract)
• scientific article; zbMATH DE number 1531927
• The axiom of choice in computability theory and reverse mathematics with a cameo for the continuum hypothesis

zbMATH Keywords

semanticslambda calculusset theory

Mathematics Subject Classification ID

Mechanization of proofs and logical operations (03B35) Combinatory logic and lambda calculus (03B40) Axiomatics of classical set theory and its fragments (03E30)

Cited In (1)

• Title not available (Why is that?)

This page was built for publication: Computing in Cantor’s Paradise with λ ZFC

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