• Template:Mathlogic-stub

A

• Abstract logic
• Abstract model theory
• Algebraic definition
• Algebraic semantics (mathematical logic)
• Algorithmic logic

B

• Barwise compactness theorem
• Bernays–Schönfinkel class
• Beth definability

C

• Cantor–Dedekind axiom
• Cascode voltage switch logic
• Centered set
• Chang's conjecture
• Class logic
• Coherent space
• Complete theory
• Completeness of atomic initial sequents
• Computable isomorphism
• Computable measure theory
• Computable model theory
• Computable real function
• Constructive nonstandard analysis
• Continuous function (set theory)
• Continuum (set theory)
• Convergence (logic)
• Countryman line
• Cut rule
• Cyclic negation

D

• Deductive closure
• Diagonal intersection
• Diagram (mathematical logic)
• Double recursion
• Double turnstile

E

• Effective Polish space
• Elementary definition
• Elementary diagram
• Elementary theory
• End extension
• Equisatisfiability
• Extension (predicate logic)
• Extension by new constant and function names

F

• Finite character
• First-order reduction
• Friedberg numbering

G

• Gabbay's separation theorem
• Gödel logic
• Ground axiom

H

• Herbrand interpretation
• High (computability)
• Honest leftmost branch

I

• International Workshop on First-Order Theorem Proving

J

• Jensen's covering theorem
• Joint embedding property

K

• Kanamori–McAloon theorem
• Kleene–Rosser paradox
• Knaster's condition

L

• LEGO (proof assistant)
• Lightface analytic game
• Limited principle of omniscience
• Lindström's theorem
• Linked set
• Logic for Computable Functions
• Logical machine
• Łoś–Tarski preservation theorem
• Low (computability)
• Low basis theorem
• Lusin's separation theorem

M

• Martin's Conjecture
• Material nonimplication
• Maximal set
• Medvedev reducibility
• Milner–Rado paradox
• Modal collapse
• Michael D. Morley
• Mučnik reducibility
• Multiverse (set theory)

N

• Nested sequent calculus
• Non-standard model

O

• Omega-categorical theory
• Open formula
• Ordinal logic
• Overlap (term rewriting)

P

• Paraconsistent mathematics
• Paradoxes of the Infinite
• Polyadic algebra
• Principle of distributivity
• Proof mining

Q

• Quantifier rank

R

• Reduced product
• Robinson's joint consistency theorem

S

• Scattered order
• Semicomputable function
• Separating set
• Set constraint
• Soft set
• Strength (mathematical logic)
• Successor function
• Superposition calculus
• Systems of Logic Based on Ordinals

T

• Takeuti's conjecture
• Tarski–Kuratowski algorithm
• Theory of pure equality
• Thousands of Problems for Theorem Provers
• Truth-table reduction

U

• UTM theorem

W

• Weihrauch reducibility

Z

• Zero dagger