Category:Mathematical logic
Here is a list of articles in the Mathematical logic category of the Computing portal that unifies foundations of mathematics and computations using computers.
Mathematical logic has several meanings in common usage. It originally referred to symbolic or formal logic, and then came to be associated with the study of the logical (and even philosophical) foundations of mathematics. In contemporary use by mathematical logicians, the term refers to several branches of pure mathematics whose study involves careful attention to formal axiom systems and formal definability.
Mathematical logic is divided into four parts:
- Model theory
- Proof theory
- Recursion theory, also known as computability theory
- Set theory
The divisions between these areas, along with the divisions between mathematical logic and the rest of mathematics, are not completely sharp, with many areas of research and methods overlapping and reinforcing each other.
Subcategories
This category has the following 24 subcategories, out of 24 total.
*
A
B
C
F
L
M
N
O
P
R
T
Pages in category "Mathematical logic"
The following 167 pages are in this category, out of 167 total.
- Mathematical logic (computing)
- Regular numerical predicate (computing)
- Computability theory (computing)
- List of mathematical logic topics (computing)
- Model theory (computing)
- Proof theory (computing)
- Set theory (computing)
A
- Absoluteness (computing)
- Abstract logic (computing)
- Abstract model theory (computing)
- Algebraic definition (computing)
- Algebraic semantics (mathematical logic) (computing)
- Algebraic sentence (computing)
- Algebraic theory (computing)
- Algorithm (computing)
- Algorithmic technique (computing)
- Algorithmic transparency (computing)
- Archive for Mathematical Logic (computing)
B
- Barwise compactness theorem (computing)
- Beth definability (computing)
- Boolean differential calculus (computing)
- Bunched logic (computing)
C
- Cartesian monoid (computing)
- Class logic (computing)
- Classical mathematics (computing)
- Coherent space (computing)
- Cointerpretability (computing)
- Complete theory (computing)
- Completeness (logic) (philosophy)
- Conservativity theorem (computing)
- Continuous predicate (computing)
- Contradiction (computing)
- Contraposition (computing)
- Converse relation (computing)
- Counting (computing)
- Craig interpolation (computing)
- Curry's paradox (computing)
- Cyclic negation (computing)
D
- Dedekind number (computing)
- Definable set (computing)
- Diagonal lemma (computing)
- Diagram (mathematical logic) (computing)
- Double turnstile (computing)
E
- Elementary definition (computing)
- Elementary sentence (computing)
- Elementary theory (computing)
- End extension (computing)
- Entitative graph (computing)
- Entscheidungsproblem (computing)
- Enumeration (computing)
- Equality (mathematics) (computing)
- Equational logic (computing)
- Equiconsistency (computing)
- Extension by definitions (computing)
- Extension by new constant and function names (computing)
- Extensions of First Order Logic (computing)
F
- Finitary (computing)
- Finitary relation (computing)
- List of first-order theories (computing)
- Formal calculation (computing)
- Formal grammar (computing)
- Formulario mathematico (computing)
- Foundations of mathematics (philosophy)
- Fragment (logic) (philosophy)
- Fraïssé limit (computing)
- Friedman's SSCG function (computing)
G
- Game semantics (computing)
- Glossary of Principia Mathematica (computing)
- Gödel numbering (computing)
- Gödel's β function (computing)
- Original proof of Gödel's completeness theorem (computing)
- Gödel logic (computing)
- Gödel's incompleteness theorems (computing)
- Ground expression (computing)
- Grundlagen der Mathematik (computing)
H
- Herbrand interpretation (computing)
- Herbrand structure (computing)
- Hilbert's program (computing)
- Hilbert–Bernays provability conditions (computing)
- Hub labels (computing)
- Hypostatic abstraction (philosophy)
I
- Implementation of mathematics in set theory (computing)
- Impredicativity (computing)
- Indicator function (computing)
- Infinitesimal (computing)
- Institutional model theory (computing)
- Interior algebra (computing)
J
- Judgment (mathematical logic) (computing)
K
- Knuth's Simpath algorithm (computing)
- Kripke semantics (computing)
- Kruskal's tree theorem (computing)
L
- Laver table (computing)
- Laws of Form (computing)
- Lévy hierarchy (computing)
- Lindenbaum's lemma (computing)
- Lindström's theorem (computing)
- Literal (mathematical logic) (computing)
- Löb's theorem (computing)
- Outline of logic (computing)
- List of Hilbert systems (computing)
- Logical assertion (computing)
- Logical equivalence (computing)
- Logical graph (computing)
- Logical machine (computing)
- LowerUnivalents (computing)
- Ludics (computing)
M
- Mereology (computing)
- Metalogic (computing)
- Metamathematics (computing)
- Mivar-based approach (computing)
- Modal logic (computing)
- Monadic second-order logic (computing)
N
- Non-wellfounded mereology (computing)
- Notre Dame Journal of Formal Logic (computing)
O
- Object language (computing)
- Ordinal logic (computing)
P
- Peano axioms (computing)
- Peirce's law (computing)
- Predicate (mathematical logic) (computing)
- Mathematical proof (computing)
- Proof of impossibility (computing)
- Proof sketch for Gödel's first incompleteness theorem (computing)
- Proposition (computing)
- Pure inductive logic (computing)
Q
- Quantum logic (physics)
R
- Recursive definition (computing)
- Relation algebra (computing)
- Residuated Boolean algebra (computing)
- Residuated lattice (computing)
- Reverse mathematics (computing)
- Reverse Mathematics: Proofs from the Inside Out
- Rewriting (computing)
- Robinson's joint consistency theorem (computing)
- Rosser's trick (computing)
- Rules of passage (logic) (philosophy)
S
- Schröder–Bernstein property (computing)
- Semicomputable function (computing)
- Slicing the Truth (computing)
- Solèr's theorem (computing)
- Special case (computing)
- Stratification (mathematics) (computing)
- Strength (mathematical logic) (computing)
- Structural induction (computing)
- Structuralism (philosophy of mathematics) (philosophy)
- Structure (mathematical logic) (computing)
- Subitizing (computing)
- Successor function (computing)
- Superposition calculus (computing)
- Surreal number (computing)
- Glossary of mathematical symbols (computing)
- List of mathematical symbols (computing)
- List of mathematical symbols by subject (computing)
T
- T-schema (computing)
- Tarski's undefinability theorem (computing)
- Tautology (logic) (philosophy)
- Term (logic) (philosophy)
- Term algebra (computing)
- Term logic (philosophy)
- Timeline of mathematical logic (computing)
- Truth function (computing)
- Turing's proof (computing)
- Turnstile (symbol) (computing)
U
- Universe (mathematics) (computing)
V
- Vacuous truth (computing)
W
- Well-formed formula (computing)
- WFF 'N PROOF (computing)
- Witness (mathematics) (computing)
Mathematics
Organizations
Books
About