by

Wikipedia Bot (@wikibot, 0)

Mathematical logic stubs

Table of contents

Programming language theory stubs

 0  0 

Container (type theory)

 0  0 

Efferent coupling

 0  0 

Jump threading

 0  0 

Latent typing

 0  0 

Option–operand separation

 0  0 

Principal type

 0  0 

Semantic analysis (compilers)

 0  0 

Stream (abstract data type)

 0  0 

Subject reduction

 0  0 

Syntactic closure

 0  0 

Type inhabitation

 0  0 

Type variable

 0  0 

Typing environment

 0  0 

Typing rule

 0  0 

Set theory stubs

 0  0 

Adequate pointclass

 0  0 

Admissible set

 0  0 

Almost

 0  0 

Cabal (set theory)

 0  0 

Chang's model

 0  0 

Coanalytic set

 0  0 

Cocountability

 0  0 

Code (set theory)

 0  0 

Critical point (set theory)

 0  0 

Effective descriptive set theory

 0  0 

Erdős cardinal

 0  0 

Extendible cardinal

 0  0 

Game-theoretic rough sets

 0  0 

Hereditarily countable set

 0  0 

Hierarchy (mathematics)

 0  0 

Homogeneous (large cardinal property)

 0  0 

Inductive set

 0  0 

Ineffable cardinal

 0  0 

Iterable cardinal

 0  0 

Jónsson cardinal

 0  0 

Kunen's inconsistency theorem

 0  0 

Kuratowski's free set theorem

 0  0 

Limitation of size

 0  0 

Ordinal definable set

 0  0 

Projection (set theory)

 0  0 

Pseudo-intersection

 0  0 

Reflecting cardinal

 0  0 

Remarkable cardinal

 0  0 

Rowbottom cardinal

 0  0 

Shelah cardinal

 0  0 

Shrewd cardinal

 0  0 

Square principle

 0  0 

Strong cardinal

 0  0 

Strongly compact cardinal

 0  0 

Subcompact cardinal

 0  0 

Subtle cardinal

 0  0 

Superstrong cardinal

 0  0 

Suslin representation

 0  0 

Tall cardinal

 0  0 

Ulam matrix

 0  0 

Unfoldable cardinal

 0  0 

Universally Baire set

 0  0 

Vopěnka's principle

 0  0 

Worldly cardinal

 0  0 

Abstract structure

 0  0 

Bernays–Schönfinkel class

 0  0 

Continuum (set theory)

 0  0 

Deductive closure

 0  0 

Extension (predicate logic)

 0  0 

Friedberg numbering

 0  0 

Gabbay's separation theorem

 0  0 

High (computability)

 0  0 

Honest leftmost branch

 0  0 

Jensen's covering theorem

 0  0 

Kleene–Rosser paradox

 0  0 

LEGO (proof assistant)

 0  0 

Low (computability)

 0  0 

Low basis theorem

 0  0 

Material nonimplication

 0  0 

Maximal set

 0  0 

Michael D. Morley

 0  0 

Milner–Rado paradox

 0  0 

Nested sequent calculus

 0  0 

Paraconsistent mathematics

 0  0 

Paradoxes of the Infinite

 0  0 

Proof mining

 0  0 

Separating set

 0  0 

Soft set

 0  0 

Takeuti's conjecture

 0  0 

Theory of pure equality

 0  0 

UTM theorem

 0  0 

Zero dagger

 0  0 

 Ancestors (4)

 View article source

 Discussion (0)

+ New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (0)

There are currently no matching articles.

  See all articles in the same topic + Create my own version