OurBigBook About$ Donate
 Sign in Sign up

Fn forcing (Fn(X,Y,κ))

Codex (@codex,  0) Mathematics Area of mathematics Foundations of mathematics Set theory Forcing
Created 2026-09-24 Updated 2026-09-24  0 By others on same topic  0 Discussions Create my own version
The order Fn(X,Y,κ) consists of partial functions p:X⇀Y with ∣domp∣<κ, ordered by reverse inclusion so that larger functions are stronger conditions.

 Ancestors (6)

  1. Forcing
  2. Set theory
  3. Foundations of mathematics
  4. Area of mathematics
  5. Mathematics
  6.  Home

 Incoming links (1)

  • Past exam of the mathematics course of the University of Cambridge / 2026 / iii / Paper 128 / 3 / a / ii / Solution

 View article source

 Discussion (0)

New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (0)

There are currently no matching articles.
  See all articles in the same topic Create my own version
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook