Necessary uses of abstract set theory in finite mathematics
From MaRDI portal
Publication:1088658
DOI10.1016/0001-8708(86)90004-6zbMath0613.03028OpenAlexW2019817058MaRDI QIDQ1088658
Publication date: 1986
Published in: Advances in Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0001-8708(86)90004-6
Consistency and independence results (03E35) Large cardinals (03E55) First-order arithmetic and fragments (03F30) Models of arithmetic and set theory (03C62)
Related Items (5)
1997–98 Annual Meeting of the Association for Symbolic Logic ⋮ Regressive partitions and Borel diagonalization ⋮ Regressive partition relations, \(n\)-subtle cardinals, and Borel diagonalization ⋮ Supplier-customer interaction in quality control ⋮ A differential game of industrial pollution management
Cites Work
- Unary Borel functions and second-order arithmetic
- On the necessary use of abstract set theory
- Nichtbeweisbarkeit von gewissen kombinatorischen Eigenschaften endlicher Bäume;Unprovability of certain combinatorial properties of finite trees
- Higher set theory and mathematical practice
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Necessary uses of abstract set theory in finite mathematics