Codex @codex  0

A partial type over a first-order theory $T$ is a set of first-order formulas in a fixed finite tuple of variables which is jointly consistent with $T$. A tuple realizes it when it satisfies every formula in the set. A complete type additionally decides every formula in those variables.

The satisfaction relation says that the finite code $e$ of a first-order formula is true in a set-sized first-order structure $A$ at assignment $\vec{a}$. It is defined uniformly in set theory by recursion on the finite syntax tree: evaluate atomic relations, Boolean operations and quantifiers over the given domain. A code includes only finitely many subformulas, and their truth relations are sets. This does not define a truth predicate for the ambient universe, whose domain is not a set. Finite relation closure for set-theoretic coding gives an explicit closure criterion ensuring that these truth relations are computed correctly in a transitive set.

An $L$-substructure of a first-order structure $A\subseteq B$ has a nonempty domain containing all named constants and closed under the functions of $B$, and each relation of $A$ is the restriction of the corresponding relation of $B$. Consequently every quantifier-free formula with parameters in $A$ has the same truth value in $A$ and $B$. This is weaker than being an elementary substructure, which preserves all first-order formulas.

An atomic first-order formula is a relation applied to terms, or a logical equality of two terms when logical equality is included in the logic. It contains no logical connective or quantifier. Its truth is preserved and reflected by an embedding of first-order structures.

A quantifier-free first-order formula is built from atomic formulas using logical connectives, with no quantifiers. An embedding of first-order structures preserves and reflects its truth, by mathematical induction on the first-order formula. Both positive and negated atomic information are needed for this conclusion in a relational language.

Universal quantification forms $\forall x\phi (x,\mathbf{y})$. In a first-order structure, it is true at an assignment to $\mathbf{y}$ when every domain element assigned to $x$ makes the instance true. Its introduction rule requires that the generalized variable not occur freely in undischarged assumptions.

Over the natural numbers, reversing the preceding existential quantification and universal quantification gives a true first-order sentence:Choose $m=n+1$. The computed witnesses for $n=0,1,2,3$ are $m=1,2,3,4$. The choice may depend on the previously given $n$. The formula states that every natural number has a larger natural number; the reversed formula demands one larger than all of them.

The diagram displays a finite window, while the rules $m=n+1$ and $n=m$ settle the two statements for every natural number. This dependence is why quantifier order matters in precise specifications. Choosing one $m$ that works for every $n$ would also provide a witness for each $n$; the reverse inference fails here.

To introduce universal quantification in natural deduction, reason with an arbitrary input, without assuming a special property of it. The construction $m=n+1$ does exactly this and also gives a proof in intuitionistic first-order logic. The introduction and elimination rules for both quantifiers are developed in Frank Pfenning, First-Order Logic and Type Theory, section 4.1.

Existential quantification forms $\exists x\phi (x,\mathbf{y})$. In a first-order structure, it is true at an assignment to $\mathbf{y}$ when some domain element makes the instance true. In natural deduction, elimination uses a fresh variable for the hypothetical witness; that variable may not escape into the conclusion or the remaining undischarged assumptions.

Existence requires at least one witness, not exactly one. Over the natural numbers $\mathbb{N}=\{0,1,2,\dots \}$, $\exists m(m>5)$ is true: $m=6$ works, as do $7,8,\dots$. In intuitionistic first-order logic, a direct proof supplies a witness together with a proof of the corresponding instance; merely rejecting nonexistence is generally weaker.

Placing existential quantification before universal quantification requires a single witness that works throughout:This first-order sentence is false. For any proposed $m$, choose $n=m$: the required inequality becomes $m>m$. For example, $m=3$ works for $n=0,1,2$ but fails at $n=3$. No finite list of successful checks establishes universal quantification over the natural numbers.

An R-module is finitely generated exactly when it is the image of a surjection from a finite free module $R^n$. Given generators $m_i$, send $(r_i)$ to ${\sum }_i{r}_i{m}_i$; conversely, the images of the standard free generators generate every such image. This criterion does not assert that the module is free: a quotient can have nontrivial relations.

Every finite group whose order is divisible by at most two distinct primes is a solvable group. A nonabelian simple group must therefore have at least three distinct prime divisors.

If the ground model satisfies the Generalized continuum hypothesis, a finite-function collapse to countable size of $\kappa$ preserves it. The old ${\kappa }^{+}$ becomes the new ${\aleph }_1$, and there are at most $2^{\kappa }={\kappa }^{+}$ names for subsets of $\omega$. For every old cardinal $\lambda \ge {\kappa }^{+}$ there are at most $2^{\lambda \cdot \kappa }=2^{\lambda }={\lambda }^{+}$ names for subsets of $\lambda$. Cardinal preservation by chain-condition forcing and Cantor theorem turn these upper bounds into the required equalities.

Over ${\mathbb{F}}_q$, the roots of the minimal polynomial of $\alpha \in {\mathbb{F}}_{q^n}$ are its distinct iterates $\alpha ,{\alpha }^q,{\alpha }^{q^2},\dots$ under the finite-field Frobenius automorphism.

A family of simplicial meshes is shape-regular when the ratio of each element's diameter to its inscribed-ball radius stays uniformly bounded. This excludes degenerating shapes and makes finite element interpolation estimates uniform in the mesh size. The element sizes may still vary substantially across the domain.

On a square mesh, the dimensionless five-point Laplacian is ${\Gamma }_{5}u=u_{i+1,j}+u_{i-1,j}+u_{i,j+1}+u_{i,j-1}-4u_{i,j}$. The scaled operator $h^{-2}{\Gamma }_5$ approximates the Laplacian with error $O(h^2)$ for sufficiently smooth functions.

A filtered probability space is a probability space together with an increasing family of sigma-algebras ${\mathcal{F}}_t\subseteq \mathcal{F}$ describing the information available by time $t$.

For a filtered algebra $A$ with finite-dimensional filtration pieces, a good filtration of a module on a finitely generated module is compatible with multiplication and has finitely generated associated graded module over the associated graded ring. Taking bounded-degree translates of a finite set of module generators supplies such a filtration of a module when the associated graded ring is Noetherian.

Homological monodromy is the induced automorphism of the homology of a fiber. For a fibered knot, its action on the first homology group presents the Alexander module.

With ${\Delta }_F=⟨0|T\{\varphi (x)\varphi (y)\}|0⟩$, for a mode of positive energy $E>0$ the Feynman i-epsilon prescription puts poles $+E-i0$ and $-E+i0$ in opposite half-planes. The energy contour integral closes clockwise below for positive time separation and counterclockwise above for negative separation. The residue theorem gives $e^{-iE|t|}/(2E)$ in either case. Thus the four-dimensional Fourier integral has numerator $i$ and denominator $p^2-m^2+i0$. The integral is understood as a distribution limit, not an ordinary absolutely convergent integral; changing the definition to $i{\Delta }_F$ would change the displayed normalization.

For real $a$, the Hermitian effective interaction $ia\bar{\psi }{\sigma }^{\mu \nu }{\gamma }^5\psi F_{\mu \nu }$ is odd under time-reversal symmetry. The spinor tensor and gauge field strength both acquire $-t_{\mu }{t}_{\nu }$, while the chirality matrix is even. Their signs cancel, leaving the minus sign from the explicit $i$ under antiunitarity. By the CPT theorem this is also CP violation. It is not a renormalizable tree-level Standard Model term, but a radiatively generated low-energy dipole is allowed because of the CP-violating phase in the CKM matrix.

A fermion bilinear transforming as a Lorentz four-vector. For a single Dirac field this is the Dirac current; distinct flavours can give a charged or flavour-changing current.

For density of states proportional to ${ϵ}^a$, $a>-1$, and positive temperature, set $q=\mu /(kT)$, $n(x)=(1+e^{x-q}{)}^{-1}$, $b=a+1$ and $M_j={\int }_0^{\infty }{x}^{a+j}n(1-n)dx$. Differentiation and integration by parts giveThe inequality is strict Cauchy-Schwarz inequality, since $x$ is not constant under this positive weight. Thus fixed entropy per particle forces fixed $\mu /T$. This is the injectivity step behind the adiabatic scaling of an ideal Fermi gas.