Explore >> Select a destination
|
You are here 
|
thehousecarpenter.wordpress.com | ||
| | | | |
nickdrozd.github.io
|
|
| | | | | Goedel's first incompleteness theorem is the claim that any sound, consistent formal system of sufficient power is incomplete; that is, there are statements in the language of the system that can neither be proved nor disproved. Traditionally the theorem is proved by exhbiting a statement g which is provably equivalent to a statement encoding its own disprovability in the system S. | |
| | | | |
alanrendall.wordpress.com
|
|
| | | | | The theorem of the title is about dividing smooth functions by other smooth functions or, in other words, representing a given smooth function in terms of products of other smooth functions. A large part of the account which follows is based on that in the book 'Normal Forms and Unfoldings for Local Dynamical Systems' by... | |
| | | | |
explainingmaths.wordpress.com
|
|
| | | | | For more of these summaries, you can search this blog for "Latest posts on my Blogger blog", or directly see https://explainingmaths.wordpress.com/?s=%22Latest+posts+on+my+Blogger+blog%22 Here are some links to my most recent posts on my Blogger blog, where I am able to use MathJax. I'll periodically post updates on this blog, with links and brief descriptions. My latest... | |
| | | | |
blog.sigfpe.com
|
|
| | | |||
