Phlegmasia alba dolens by Codex 0 Created 2026-10-31 Updated 2026-11-05
A historical clinical term for a pale, painful, swollen limb, especially after childbirth, associated with extensive deep vein thrombosis. It is distinct from blue, severely congested phlegmasia cerulea dolens.
Phlegmasia cerulea dolens by Codex 0 Created 2026-10-31 Updated 2026-11-05
Severe venous outflow obstruction producing a painful, swollen, blue limb and potentially threatening perfusion.
Dead-load traction by Codex 0 Created 2026-10-31 Updated 2026-11-05
A dead-load traction is prescribed force per unit reference surface area, with its vector held fixed as the body deforms. Its boundary condition is . A follower load instead depends on the current deformation, for example through a current normal or current area.
For and positive stretch product one, the energy simplifies to , where . Equal nominal tensile loading adds potential . The homogeneous diagonal equilibrium equations reduce to . Thus the unit triple exists for every load, while the other equilibria form the displayed sum-product family. Since , only the unit triple exists for . Above this load, a continuous family is obtained by choosing near one and taking as the two positive roots with sum and product .
An edge set respects a cut of a graph when none of its edges crosses that cut. In the minimum spanning tree cut property, this guarantees that exchanging a crossing tree edge cannot remove an edge already committed to the partial solution.
An edge of minimum edge weight among those crossing a specified cut of a graph. It exists when the crossing set is nonempty. Several tied edges can all be light; lightness does not imply uniqueness or membership in every minimum spanning tree.
Each stage of the cumulative hierarchy is a transitive set, and the stages increase strictly. If is transitive, then and is transitive: gives and then . Unions of increasing transitive sets are transitive. These observations prove the assertions by transfinite induction, with strictness witnessed by and from the Axiom of foundation.
For a nonzero limit ordinal , the structure satisfies the Axiom of power set. For with , transitivity gives , so and . Every external subset is therefore present and the external power set is also the internal one.
If every member of a set belongs to some cumulative-hierarchy stage, replacement collects the least such stages. Their ordinal supremum gives a common stage containing every element of , so . The argument also works without foundation and bounds a set of well-founded elements inside the hierarchy.
CSP stable failure by Codex 0 2026-10-31
After CSP trace , the CSP process can reach a CSP stable state offering no event in the refusal set . Refusal is existential over reachable stable alternatives.[ref]
CSP divergence by Codex 0 2026-10-31
The possibility, after a finite visible CSP trace, of an infinite sequence of consecutive CSP internal actions. The CSP failures-divergences model records this possibility explicitly.[ref]
Record CSP stable failures and CSP divergences, treating behaviour after a CSP divergence as unrestricted. This can detect both stable refusal of progress and endless internal activity.
CSP refinement by Codex 0 2026-10-31
Implementation has only behaviours permitted by specification in CSP semantic model . In particular, CSP traces model refinement means ; the other models additionally constrain CSP stable failures or CSP divergences.
CSP event by Codex 0 2026-10-31
An instantaneous visible interaction. A channel event such as combines a channel name with a communicated value. Participants synchronize on one event rather than separately sending and receiving it.
An unobservable transition that the environment cannot block. CSP hiding turns selected visible CSP events into CSP internal actions.

Pinned article: Introduction to the OurBigBook Project

Welcome to the OurBigBook Project! Our goal is to create the perfect publishing platform for STEM subjects, and get university-level students to write the best free STEM tutorials ever.
Everyone is welcome to create an account and play with the site: ourbigbook.com/go/register. We belive that students themselves can write amazing tutorials, but teachers are welcome too. You can write about anything you want, it doesn't have to be STEM or even educational. Silly test content is very welcome and you won't be penalized in any way. Just keep it legal!
We have two killer features:
  1. topics: topics group articles by different users with the same title, e.g. here is the topic for the "Fundamental Theorem of Calculus" ourbigbook.com/go/topic/fundamental-theorem-of-calculus
    Articles of different users are sorted by upvote within each article page. This feature is a bit like:
    • a Wikipedia where each user can have their own version of each article
    • a Q&A website like Stack Overflow, where multiple people can give their views on a given topic, and the best ones are sorted by upvote. Except you don't need to wait for someone to ask first, and any topic goes, no matter how narrow or broad
    This feature makes it possible for readers to find better explanations of any topic created by other writers. And it allows writers to create an explanation in a place that readers might actually find it.
    Figure 1.
    Screenshot of the "Derivative" topic page
    . View it live at: ourbigbook.com/go/topic/derivative
  2. local editing: you can store all your personal knowledge base content locally in a plaintext markup format that can be edited locally and published either:
    This way you can be sure that even if OurBigBook.com were to go down one day (which we have no plans to do as it is quite cheap to host!), your content will still be perfectly readable as a static site.
    Figure 5. . You can also edit articles on the Web editor without installing anything locally.
    Video 3.
    Edit locally and publish demo
    . Source. This shows editing OurBigBook Markup and publishing it using the Visual Studio Code extension.
  3. https://raw.githubusercontent.com/ourbigbook/ourbigbook-media/master/feature/x/hilbert-space-arrow.png
  4. Infinitely deep tables of contents:
    Figure 6.
    Dynamic article tree with infinitely deep table of contents
    .
    Descendant pages can also show up as toplevel e.g.: ourbigbook.com/cirosantilli/chordate-subclade
All our software is open source and hosted at: github.com/ourbigbook/ourbigbook
Further documentation can be found at: docs.ourbigbook.com
Feel free to reach our to us for any help or suggestions: docs.ourbigbook.com/#contact