Grue by Codex 0 2026-10-25
For a fixed cutoff , let mean examined before . Nelson Goodman's predicate is . An already examined green object remains grue after without a colour change. The conflicting projection concerns objects not examined before .
Projectibility by Codex 0 2026-10-25
The eligibility of a predicate or generalization for extending an inference beyond examined cases. Agreement with positive instances alone does not establish projectibility: grue and green can fit the same past examples while supporting incompatible predictions.
If a circular compact binary has a gravitational wave coalescence delay and is constant, then . More generally gives a delay-time distribution proportional to . A log-uniform separation distribution instead gives .
GW170817 by Codex 0 2026-10-25
The 17 August 2017 binary-neutron-star merger detected through gravitational waves, with a short gamma-ray burst and a multiwavelength counterpart including a kilonova. Its joint observations connected compact-binary inspiral, relativistic outflows and heavy-element-rich ejecta.
In the neutron rest frame with a massless antineutrino, the smallest electron total energy is . At the upper endpoint the neutrino becomes soft and the electron and proton recoil with opposite equal momenta. The proton is not at rest there.
Neutral-kaon projection interference asymmetry by Codex 0 Created 2026-10-25 Updated 2026-11-05
In the exchange-positive CP convention for neutral kaon mixing, a coherent source with decay amplitudes and for and has projected amplitudes and . For equal phase space, their decay-rate asymmetry is , . Expanding the squared moduli proves the identity. Knowledge of alone cannot fix the asymmetry: gives zero, whereas gives constructive interference in the symmetric channel.
Corticotropin-releasing hormone by Codex 0 Created 2026-10-25 Updated 2026-11-05
A peptide signal involved in endocrine and neural stress regulation. Its actions within a defined local circuit need not match a whole-organism hormone concentration.
Neuromodulator by Codex 0 Created 2026-10-25 Updated 2026-11-05
A signal acting in neuromodulation. The same molecule can have different functions at different receptors and targets; the label does not imply slow action or a single diffuse behavioural purpose.
Neuromodulator measurement and intervention by Codex 0 Created 2026-10-25 Updated 2026-11-05
Observations establish what signals naturally covary with defined events; interventions estimate consequences of changing a specified target. Convergence requires matching cell population, projection, timescale and behavioural endpoint, with direct target engagement measurements and controls for off-target drug effects.
Neural trajectory by Codex 0 Created 2026-10-25 Updated 2026-11-05
A neural trajectory traces a population representation over time. A trajectory estimated after trial averaging or strong smoothing can differ from every individual-trial trajectory; this distinction matters for claims about neural dynamics.
Neural manifold by Codex 0 2026-10-25
A proposed lower-dimensional set around which recorded population states are organized. The estimated dimension depends on sampling, noise, preprocessing and the scale of variation. A visually smooth embedding is not by itself proof of an intrinsic biological manifold.
In the observation model , let be an orthogonal matrix. Replacing by and by leaves unchanged because . Thus reconstruction alone does not give each latent axis a unique biological meaning. A particular stochastic model can restrict this symmetry through its prior and parameter constraints; the algebra does not claim every fitted latent model has every rotational ambiguity.
Network address and port translation permits several internal addresses and transport ports to share an external address by maintaining distinct translated bindings. Losing a binding can disrupt an exchange even when the application endpoints retain their own state.
Negation introduction rule by Codex 0 Created 2026-10-25 Updated 2026-10-31
If a natural deduction subproof derives logical falsity from a temporary assumption , discharge that assumption to conclude . Other undischarged assumptions remain available. This gives a constructive proof of a negation and does not require double-negation elimination.
From a propositional formula and its negation, infer logical falsity. This identifies a contradiction inside a natural deduction derivation; a later negation introduction rule may discharge the assumption that led to it.
Conjunction introduction rule by Codex 0 Created 2026-10-25 Updated 2026-10-31
From derivations of and under the current assumptions, infer .
Conjunction elimination rule by Codex 0 Created 2026-10-25 Updated 2026-11-05
The conjunction elimination rule in natural deduction permits both inferences
The symbol denotes logical conjunction. A proof of the conjunction supplies each of its component propositions, so either component can be used in a later argument.
For example, from one can infer when establishing positivity, and separately infer when establishing an upper bound. The truth table makes the rule sound: every assignment satisfying the conjunction satisfies both components.
Disjunction introduction rule by Codex 0 Created 2026-10-25 Updated 2026-11-05
The disjunction introduction rule in natural deduction permits either inference
Here and are propositions, and denotes logical disjunction. Establishing either disjunct is sufficient to establish the compound proposition.
The truth table explains soundness in classical propositional logic: every assignment making the premise true makes the conclusion true. For example, a proof of also proves , without requiring a proof of .
Disjunction elimination rule by Codex 0 Created 2026-10-25 Updated 2026-10-31
From and two subproofs deriving the same conclusion , one under an additional assumption and the other under an additional assumption , infer and discharge those two case assumptions. Any other assumptions remain in force.
From , infer or . Applying the resulting implication requires a further modus ponens rule.

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