Discrete mathematics Created 2026-10-31 Updated 2026-11-05
Discrete mathematics studies structures built from distinct objects and finite or countable choices. Its main connections include combinatorics, graph theory, number theory, mathematical logic and the analysis of algorithms. The distinction concerns the structures under study, rather than a ban on using real numbers or analysis in proofs.
For example, a graph with vertices has possible unordered edges when loops and repeated edges are excluded. Counting possible edge sets gives labeled simple graphs. A small modeling assumption about allowed edges has turned a structural question into an exact counting formula. Such translations underpin scheduling, networks and computer science.
Foundations of mathematics Created 2026-09-24 Updated 2026-10-13
Foundations of mathematics asks what our objects mean, what we assume about them, and why an argument establishes its conclusion. Set theory gives a common language for collections and functions; mathematical logic makes the structure of statements and deductions precise. A mathematical definition fixes a meaning, an axiom supplies an assumption, and a mathematical proof explains what follows. Separating these roles makes results reusable: once the group axioms are enough for a conclusion, that conclusion applies to every group, regardless of how its members are represented.
The assumptions can change the answer to a familiar calculation. Over the real numbers, factors as , so is zero or one. The same reasoning holds in any integral domain, because a product can be zero only when a factor is zero. In the ring of integers modulo six, however, and : there are four solutions, represented by . The extra solutions are idempotents, and the failed step involves zero divisors. Writing the domain is part of explaining the answer.
This precision also reveals surprising possibilities. A two-dimensional grid of natural numbers is a countable set, while all infinite binary sequences form an uncountable set. The Cantor pairing function supplies a complete enumeration of the first; Cantor's diagonal argument defeats every proposed enumeration of the second. Both arguments are short, yet distinguish two sizes of infinity. The subject's appeal is this ability to turn a vague question into one whose assumptions, construction, and limits can all be inspected.
Free variable in a linear system 2026-10-18
A free variable in a linear system is an unknown whose coefficient column is not a pivot column in row echelon form. When the linear system is consistent, it can be assigned any value in the field; the pivot unknowns are then determined by those choices. This use of “free” differs from a free variable in mathematical logic.
George Boole 2026-10-24
Author of An Investigation of the Laws of Thought by George Boole, applying symbolic operations to mathematical logic.
Portrait of George Boole
. Public-domain portrait, via Wikimedia Commons. Source. Logic programming Created 2026-10-31 Updated 2026-11-05
Logic programming represents knowledge and queries through logical clauses, letting an inference procedure search for substitutions making a query true. A fact such as
parent(ada, ben) and a rule saying that a parent of a parent is a grandparent can answer a grandparent query without listing every answer explicitly. Prolog commonly combines unification with ordered goal search and backtracking. Declarative meaning and execution strategy must be distinguished: two logically equivalent rule orders can have different termination behaviour. The method connects mathematical logic to executable symbolic inference. Mathematical logic Created 2026-09-24 Updated 2026-10-18
Mathematical logic studies formal languages, formal proofs, model theory, computability theory, and the foundations of mathematics. It makes the rules of reasoning explicit enough that reasoning itself becomes an object of mathematics. Proof theory studies deductions; model theory studies interpretations in which statements hold.
Three questions organize the subject: is an expression a well-formed first-order formula, is it true in a specified first-order structure, and does it have a formal proof from specified axioms? These questions are distinct. For example, is a first-order sentence in an appropriate first-order language; it is false in the natural numbers but true in the rational numbers, with .
The beauty of mathematical logic is that the same logical connectives and rules of universal quantification and existential quantification organize arguments across mathematics. Classical propositional logic uses two truth values; Intuitionistic propositional logic interprets logical implication through constructions on proofs, without unrestricted law of excluded middle. This proof-based framework is developed in Frank Pfenning, Natural Deduction, sections 1–3.
This University of Oxford Part B paper is cross-listed for Mathematics, Mathematics and Computer Science, Mathematics and Philosophy, and Mathematics and Statistics. Section A concerns mathematical logic and section B concerns set theory. [ref]
https://www.whatdotheyknow.com/request/maths_past_papers_3. Source release
The archive contains a complete editable five-page transcription. Bounded official-source searches found no advertised answers to this exact paper. All 29 source leaves and the attached unnumbered tasks are covered below. In Q7(v), the convergence condition is retained exactly as printed, without adding absolute-value bars.This University of Oxford Part B paper is cross-listed for Mathematics, Mathematics and Computer Science, Mathematics and Philosophy, and Mathematics and Statistics. It contains mathematical logic in section A and set theory in section B. [ref]
https://www.whatdotheyknow.com/request/maths_past_papers_3. Source release
The archive contains the full editable five-page transcription. Bounded official-source searches found no advertised answers for this exact 2008 paper. All source leaves are solved below, including all five optional arguments in A1(e) and the unnumbered preliminary tasks in B5, B6 and B7. Ramsey theory Created 2026-09-24 Updated 2026-10-13
Ramsey theory studies configurations that every finite coloring of a sufficiently large structure must contain. Its striking message is that some order is unavoidable even when no organized construction was used. A basic example is the Ramsey number for triangles: color every edge of a complete graph on six vertices red or blue, in any way, and some triangle in a graph has all three edges the same color. Five vertices do not suffice.
The objects receiving colors matter. In the Ramsey number for triangles, colors belong to edges, which represent all unordered pairs of distinct vertices; the vertices themselves have no colors. In the finite Ramsey theorem, colors can instead belong to all -element subsets of a finite set. A monochromatic set or homogeneous set for a colouring expresses agreement among the appropriate colored objects.
Why is this useful? Ramsey theory provides existence guarantees in combinatorics that survive every possible assignment of a fixed finite number of colors. The Ramsey theorem turns this into a structural dichotomy: every sufficiently large graph contains a large clique or a large independent set. In arithmetic, the Van der Waerden theorem guarantees monochromatic arithmetic progressions. The beauty is the universal quantifier: an adversary can choose every color and still cannot prevent the promised configuration.
These guarantees concern precisely specified configurations under stated hypotheses. They do not justify selecting arbitrary patterns in empirical data after seeing the data, or attributing statistical significance to a selected pattern. A mathematical guarantee of some monochromatic configuration alone says nothing about the empirical meaning of that configuration.
The subject's name comes from F. P. Ramsey's [ref]. The [ref]
https://www.cs.umd.edu/~gasarch/BLOGPAPERS/ramseyorig.pdf. original paper, pp. 264-268, Theorems A and B
records receipt on 28 November 1928 and presentation on 13 December 1928. Ramsey introduced the Ramsey theorem for r-sets and finite Ramsey theorem as tools for a problem in mathematical logic, while recognizing their independent interest in combinatorics. He also distinguished proving that a finite threshold exists from finding its smallest value, the quantitative question captured by a Ramsey number. Richard Kaye 2026-11-05
Richard Kaye works on mathematical logic and arithmetic model theory. His exposition of Tennenbaum's theorem studies why countable nonstandard arithmetic cannot have an ordinary computable presentation with computable operations.[ref]
Tennenbaum’s Theorem for Models of Arithmetic by Richard Kaye (2006). Author byline and theorem exposition
The proof encodes a standard nonrecursive set inside a nonstandard model, using recursively inseparable sets and overspill. If the model's arithmetic were computable in the required way, the coded set could be recovered algorithmically, giving a contradiction. Kaye's account makes the interaction between model theory and computability theory explicit.[ref]
Tennenbaum’s Theorem for Models of Arithmetic by Richard Kaye (2006). Construction preceding Theorem 2.8
Temporal logic Created 2026-10-31 Updated 2026-11-05
Temporal logic extends ordinary mathematical logic with assertions about successive states or times. Temporal operators express properties such as eventually holding, always holding, or holding until another condition occurs.
In linear temporal logic, says that every request is eventually answered along a trace. A safety property rules out a bad finite behavior; a liveness property requires future progress. Computation tree logic additionally distinguishes possible execution paths. The choice of linear or branching time determines exactly which system behaviors a formula quantifies over.
Theoretical computer science Created 2026-09-24 Updated 2026-11-05
Theoretical computer science studies computation through mathematical models, algorithms and proofs. Computability theory asks which problems admit algorithms at all; computational complexity theory asks what resources solving them requires. Automata theory, mathematical logic and formal languages describe machines and representations. For example, a finite-state automaton recognizes a language using finitely many states, while a Turing machine provides a more general model with unbounded working storage. Separating a problem's specification from a particular implementation makes it possible to prove both algorithmic upper bounds and impossibility results.
Weakly compact cardinal Created 2026-09-24 Updated 2026-11-05
A weakly compact cardinal is an uncountable cardinal satisfying the weak compactness properties of infinitary mathematical logic and set theory. One formulation requires compactness for theories of size at most : if every subtheory of size below has a model of a first-order theory, the whole theory has one. The logic permits conjunctions and quantifier blocks of length below .
Equivalently, is strongly inaccessible and has the tree property, and it satisfies the partition relation . These link logical consistency, the existence of long branches in trees, and homogeneous subsets for pair colorings. Such a cardinal is therefore a substantial strengthening of uncountability, rather than an arbitrary infinite cardinal.
Yiannis N. Moschovakis 2026-11-05
Yiannis N. Moschovakis works on descriptive set theory and its connections with mathematical logic and definability. His Descriptive Set Theory by Yiannis N. Moschovakis (2009) develops the classification of sets of real numbers through definability and games.[ref]
Descriptive Set Theory by Yiannis N. Moschovakis (2009). Title page and introductory framework
The Friedman–Moschovakis coding lemma illustrates how uniform descriptions can be constructed for complicated sets. Coding games and ordinal codes turn existence questions into structured definability arguments. The framework makes it possible to compare not just the sizes of sets but the complexity of specifying their members.[ref]
