Category:Mathematical logic

• Mathematical logic
• Regular numerical predicate
• Computability theory
• List of mathematical logic topics
• Model theory
• Proof theory
• Set theory

A

• Absoluteness
• Abstract logic
• Abstract model theory
• Algebraic definition
• Algebraic semantics (mathematical logic)
• Algebraic sentence
• Algebraic theory
• Algorithm
• Algorithmic technique
• Algorithmic transparency
• Archive for Mathematical Logic

B

• Barwise compactness theorem
• Beth definability
• Boolean differential calculus
• Bunched logic

C

• Cartesian monoid
• Class logic
• Classical mathematics
• Coherent space
• Cointerpretability
• Complete theory
• Philosophy:Completeness (logic)
• Conservativity theorem
• Continuous predicate
• Contradiction
• Contraposition
• Converse relation
• Counting
• Craig interpolation
• Curry's paradox
• Cyclic negation

D

• Dedekind number
• Definable set
• Diagonal lemma
• Diagram (mathematical logic)
• Double turnstile

E

• Elementary definition
• Elementary sentence
• Elementary theory
• End extension
• Entitative graph
• Entscheidungsproblem
• Enumeration
• Equality (mathematics)
• Equational logic
• Equiconsistency
• Extension by definitions

F

• Finitary
• Finitary relation
• List of first-order theories
• Formal calculation
• Formal grammar
• Formulario mathematico
• Foundations of mathematics
• Philosophy:Fragment (logic)
• Friedman's SSCG function

G

• Game semantics
• Glossary of Principia Mathematica
• Gödel numbering
• Gödel's β function
• Original proof of Gödel's completeness theorem
• Gödel logic
• Gödel's incompleteness theorems
• Ground expression
• Grundlagen der Mathematik

H

• Herbrand interpretation
• Herbrand structure
• Hilbert's program
• Hilbert–Bernays provability conditions
• Hub labels
• Hypostatic abstraction

I

• Implementation of mathematics in set theory
• Impredicativity
• Indicator function
• Infinitesimal
• Institutional model theory
• Interior algebra

K

• Knuth's Simpath algorithm
• Kripke semantics
• Kruskal's tree theorem

L

• Laver table
• Laws of Form
• Lévy hierarchy
• Lindenbaum's lemma
• Lindström's theorem
• Literal (mathematical logic)
• Löb's theorem
• Outline of logic
• List of Hilbert systems
• Logical equivalence
• Logical graph
• Logical machine
• LowerUnivalents
• Ludics

M

• Mereology
• Metalogic
• Metamathematics
• Mivar-based approach
• Monadic second-order logic

N

• Non-wellfounded mereology

O

• Object language
• Ordinal logic

P

• Peano axioms
• Peirce's law
• Predicate (mathematical logic)
• Mathematical proof
• Proof of impossibility
• Proof sketch for Gödel's first incompleteness theorem
• Proposition
• Pure inductive logic

Q

• Quantum logic

R

• Recursive definition
• Relation algebra
• Residuated Boolean algebra
• Residuated lattice
• Reverse mathematics
• Rewriting
• Robinson's joint consistency theorem
• Rosser's trick
• Philosophy:Rules of passage (logic)

S

• Schröder–Bernstein property
• Semicomputable function
• Solèr's theorem
• Special case
• Stratification (mathematics)
• Strength (mathematical logic)
• Structural induction
• Philosophy:Structuralism (philosophy of mathematics)
• Structure (mathematical logic)
• Subitizing
• Successor function
• Superposition calculus
• Surreal number
• List of mathematical symbols
• List of mathematical symbols by subject

T

• T-schema
• Tarski's undefinability theorem
• Philosophy:Tautology (logic)
• Philosophy:Term (logic)
• Term algebra
• Term logic
• Timeline of mathematical logic
• Truth function
• Turing's proof
• Turnstile (symbol)

U

• Universe (mathematics)

V

• Vacuous truth

W

• Well-formed formula
• WFF 'N PROOF
• Witness (mathematics)