nLab
mathematical logic
Skip the Navigation Links

Home Page

All Pages

Recently Revised

Authors

Feeds

Export

see at
logic  Mathematical logic
.
Revised on November 1, 2012 15:11:56 by
Urs Schreiber
(131.174.41.102)
Edit

Back in time
(3 revisions)

See changes

History
 Views:
Print

TeX

Source
 Linked from:
foundation of mathematics
,
axiom of choice
,
Set
,
set
,
equality
,
ETCS
,
Trimble on ETCS III
,
small category
,
logic
,
presentation axiom
,
finite set
,
natural number
,
constructive mathematics
,
predicative mathematics
,
Grothendieck universe
,
set theory
,
universe in a topos
,
hereditarily finite set
,
linear logic
,
decidable equality
,
cardinal number
,
inaccessible cardinal
,
type theory
,
intuitionistic logic
,
ordinal number
,
axiom of infinity
,
paraconsistent logic
,
Zorn's lemma
,
William Lawvere
,
countable choice
,
computer science
,
universe
,
propositional logic
,
higherorder logic
,
structural set theory
,
preset
,
ZFC
,
Whitehead theorem
,
element
,
proposition
,
predicate logic
,
large cardinal
,
classical mathematics
,
fully formal ETCS
,
axiom of multiple choice
,
theory
,
WISC
,
calculus of constructions
,
pure type system
,
supercompact cardinal
,
intuitionistic mathematics
,
foundations  contents
,
hyperdoctrine
,
homotopy type theory
,
theorem
,
contents of contents
,
axiom of separation
,
proof
,
logical connective
,
continuum hypothesis
,
sequent
,
universe polymorphism
,
logical framework
,
BuraliForti's paradox
,
judgment
,
Russell's paradox
,
elementary function arithmetic
,
secondorder arithmetic
,
proof theory
,
computation
,
natural deduction
,
metalanguage
,
paradox
,
typical ambiguity
,
contradiction
,
denial inequality
,
inconsistency
,
LF
,
Bishop set
,
predicative topos
,
Cantor's paradox
,
deductive system
,
ZFA
,
coinductive type
,
practical foundation of mathematics
,
meaning explanation
,
natural numbers type
,
inequality relation
,
Lectures on Logic
,
Hilbert's sixth problem
,
incompleteness theorem
,
Homotopy Type Theory  Univalent Foundations of Mathematics
,
recursive subset
,
countable ordinal
,
partial recursive function
,
Cohesive Toposes and Cantor's "lauter Einsen"
,
logos (in philosophy)
,
ForMath
,
Hegel's "Logic" as Modal Type Theory
,
modus ponens
,
computational type theory
,
cut rule
,
plump ordinal
,
realizability
,
The QED Project
,
MathScheme
,
synthetic mathematics