Near Matches
Ignore Exact
Everything
2
first-order logic
Connectivity is not expressible in first-order logic
every partial order can be extended to a total order
definable number
NSA: Robinson's "overspill" lemma
propositional calculus
Kruskal's algorithm
Godel's completeness theorem
compactness theorem
formal logic
Pistachio honeycomb
model theory
Echoic Memory
HTML symbol reference
Fourier transform
Completeness
Modus Ponens
Douglas Hofstadter
Bertrand Russell
Lojban
logic
Log in
or
register
to write something here or to contact authors.