Topics (384k) Articles (398k) Users (410) Discussions (242) Comments (383) Files (13k) New article
Provability logic studies modal principles valid when is interpreted by an arithmetical provability predicate. The distribution axiom corresponds to formalized modus ponens rule, necessitation corresponds to verification of actual proofs, and the Löb axiom is the Internal form of Löb's theorem. The standard system capturing these principles is Gödel-Löb logic.
The necessitation rule permits boxing a theorem in a modal proof system. It does not permit boxing an arbitrary temporary assumption. Under an arithmetic interpretation, it uses the external first of the derivability conditions: an actual proof of supplies a proof that has a proof. This distinction matters when proving the Internal form of Löb's theorem.
Positive introspection says that a boxed assertion can itself be boxed. For an arithmetical provability predicate it is the third of the Hilbert-Bernays-Löb derivability conditions: provability of implies provability of the assertion that is provable. It follows from formalized Sigma-1 completeness when provability assertions are Sigma-1. It is not the reflection principle .
An occurrence of a propositional variable in a modal formula is modalized if it lies within the scope of a box operator. A variable occurs modalized in a formula when all its occurrences do. For example is modalized in , while is not. Fixed-point and uniqueness theorems for Gödel-Löb logic impose this syntactic condition on the variable being solved for.
A modal formula is built from propositional variables and logical constants using Boolean connectives and modal operators, such as the box operator. In provability logic, arithmetic realization replaces propositional letters by arithmetic sentences and interprets a box as the corresponding arithmetic provability assertion. Modal validity, theoremhood and truth under a particular arithmetic realization are distinct notions.
The normal distribution axiom says that a boxed implication and its boxed antecedent give the boxed consequent. Together with the necessitation rule, it permits boxed versions of propositional deductions. Under an arithmetic interpretation it is the internal modus-ponens condition among the Hilbert-Bernays-Löb derivability conditions. It does not permit dropping a box to assert the enclosed sentence.
Modal logic K4 extends the normal modal distribution axiom and necessitation rule by positive introspection . Its Kripke semantics uses transitive accessibility relations. The fixed point satisfies in this logic.
Uniform substitution in modal logic replaces each occurrence of a propositional variable by the same modal formula. Normal modal formal proof systems with axiom schemes are closed under this operation: substituted axioms remain instances, modus ponens is preserved, and necessitation commutes with substitution. Fresh auxiliary letters permit substituting a derived fixed point into fixed-point uniqueness theorems without changing other parameters.
A function continuous across an interface can have different one-sided normal derivatives. For instance, when and when is continuous, satisfies on each open side, and has zero tangential second derivative on the interface. Its lower -derivative is one and its upper -derivative is zero. Thus the normal derivative does not exist there as a two-sided derivative.
More generally, for functions smooth on each side with one-sided first derivative traces, global regularity would force both traces to equal the derivative on the interface. Unequal traces therefore preclude a globally classical solution as well. A condition on the function value alone is not a condition on its normal derivative; a specified transmission law or an appropriate weak formulation is additional information.
Use signature and future-pointing timelike vectors . Their time components exceed their spatial magnitudes, so the same holds for their sum by the Euclidean triangle inequality. In the rest frame of , write , , and let . Then . Expanding the squared norm of proves the displayed inequality. Equality requires to have zero spatial component in this frame, equivalently is a positive scalar multiple of . The shared future time orientation is essential.
This explicit numerical method is a two-stage Runge-Kutta method and a one-step method. For a sufficiently smooth ordinary differential equation, the chain rule gives , and Taylor's theorem shows that its local truncation error is . Uniform Lipschitz continuity of in its solution argument gives an increment-function Lipschitz constant at most . The Lipschitz one-step error bound then proves second-order numerical convergence on a fixed time interval. This method uses an intermediate prediction from ; the explicit midpoint linear multistep method instead requires a separate previous value .
The Eustachian tube connects the middle ear to the nasopharynx, enabling pressure equalization, mucosal clearance and protection from nasopharyngeal contents.
The tympanic cavity is the air-containing middle-ear space housing the auditory ossicles. It communicates with the nasopharynx through the auditory tube. The cavity, its lining and the structures suspended within it have different mechanical and developmental roles.
The tubotympanic recess is an embryonic extension of the first pharyngeal pouch contributing to the auditory tube and middle-ear cavity. Its endodermal origin differs from the ectodermal contribution to the external ear passage.
The tensor tympani muscle is a middle-ear muscle attaching to the malleus. Its contraction alters the mechanics of the tympanic membrane and ossicular chain. Its innervation is associated with the mandibular division of the trigeminal nerve, rather than the facial supply to stapedius.
Substrate replication competes with saturating enzyme clearance in this fast-slow model, where and . The physical strip , is invariant. If , the origin is attracting and a positive saddle exists at , . Eliminating the fast complex fraction gives , separating extinction from runaway. For initially zero complexes, the stable-manifold threshold is , away from singular parameter limits. To derive the correction, write the stable manifold as ; its invariance equation gives and . A Dulac factor has strictly negative weighted divergence, excluding a periodic alternative to the two basins. Saturated clearance and autocatalytic growth can therefore create an unstable concentration threshold rather than a stable nonzero balance.
Fixed point theorem for a strictly distance-decreasing map on a compact metric space by
Codex 0 2026-10-31
Let be a nonempty compact metric space and let satisfy whenever . Then has exactly one fixed point. The distance condition implies continuity, and attains a minimum by compactness. If a minimizer were not a fixed point, then would contradict minimality. Two distinct fixed points would contradict the same strict distance inequality directly. A uniform Lipschitz constant below is unnecessary; compactness replaces the quantitative hypothesis of the contraction mapping theorem.
Given a metric space and , define a new metric by and for distinct points. It is the distance obtained by joining every point to a central vertex with its original distance to as edge length. Symmetry and positive definiteness are immediate. With three distinct points the triangle inequality follows from the extra nonnegative term in the route through an intermediate point; repeated-point cases are immediate.
Every is isolated, since . At the centre, however, . Thus a map out of this space is continuous exactly when it is continuous at in the original metric. The closure of is together with if and ; otherwise it is simply . This construction isolates every point except the centre while preserving exactly its original neighbourhood filter.
For an exponential integral with phase , a constant-phase contour holds the imaginary part of fixed. Along it, decreasing real part of gives steepest descent, while increasing real part gives steepest ascent. At a cubic stationary point, six rays alternate between descent and ascent.
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!
Intro to OurBigBook
. Source. We have two killer features:
- 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-calculusArticles 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/derivativeVideo 2. OurBigBook Web topics demo. Source. - 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.
- to OurBigBook.com to get awesome multi-user features like topics and likes
- as HTML files to a static website, which you can host yourself for free on many external providers like GitHub Pages, and remain in full control
Figure 2. You can publish local OurBigBook lightweight markup files to either OurBigBook.com or as a static website.Figure 3. Visual Studio Code extension installation.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. - Infinitely deep tables of contents:
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





