<?xml version="1.0" encoding="UTF-8"?><rss version="2.0"
	xmlns:content="http://purl.org/rss/1.0/modules/content/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:atom="http://www.w3.org/2005/Atom"
	xmlns:sy="http://purl.org/rss/1.0/modules/syndication/"
	xmlns:georss="http://www.georss.org/georss" xmlns:geo="http://www.w3.org/2003/01/geo/wgs84_pos#" xmlns:media="http://search.yahoo.com/mrss/"
		>
<channel>
	<title>Comments on: Recently read</title>
	<atom:link href="http://slawekk.wordpress.com/2012/01/26/recently-read/feed/" rel="self" type="application/rss+xml" />
	<link>http://slawekk.wordpress.com/2012/01/26/recently-read/</link>
	<description>Just another WordPress.com weblog</description>
	<lastBuildDate>Mon, 03 Dec 2012 16:09:29 +0000</lastBuildDate>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
	<generator>http://wordpress.com/</generator>
	<item>
		<title>By: Jim Kingdon</title>
		<link>http://slawekk.wordpress.com/2012/01/26/recently-read/#comment-480</link>
		<dc:creator><![CDATA[Jim Kingdon]]></dc:creator>
		<pubDate>Thu, 16 Feb 2012 04:58:00 +0000</pubDate>
		<guid isPermaLink="false">http://slawekk.wordpress.com/?p=655#comment-480</guid>
		<description><![CDATA[One of the comments asks whether anyone has taught themselves math by writing and reading formal proofs. While I had an undergraduate math education before getting into formal proofs, I have learned significant areas from reading metamath ( http://metamath.org/ ), writing proofs at http://www.wikiproofs.org/ , reading coq geometry proofs of Julien Narboux at http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.158.8614 and perhaps a few other more minor sources.

Things I have learned include: (1) doing propositional logic via axioms and proofs, rather than truth tables (e.g. translating the propositional logic chapter of Principia Mathematica to a formal proof system which is metamath-like in the sense of not having it built in), (2) intuitionistic propositional logic (if there is a good textbook on this, I haven&#039;t yet found it, but as long as I start from a correct set of axioms, I feel like I won&#039;t go too far astray), (3) the difference between a class and a set (hinted at in my undergraduate days, but which actually has subtleties that come out, at least for me, much more in a formal proof system than in any amount of trying to explain it in terms of concepts), (4) predicate logic: I knew very little of this, beyond what the average non-logician uses in an intuitive way without trying to explain it in detail. Now I have proved enough predicate logic to use in, say, arithmetic or set theory, from two different axiomizations. (5) Formalizing geometry (in the point/line style of Euclid&#039;s elements or Tarski&#039;s geometry axioms). When I started I had no idea how the diagrams of high school geometry could be translated to a formal language with predicates like &quot;x is between y and z&quot; and &quot;x y is congruent to z w&quot;. (6) Logical concepts like the deduction theorem (although I haven&#039;t tried to express these in a formal proof system, or even read the work of people who have, it is hard to work in a system like metamath without gaining some insight into what kinds of informal reasoning translate into what kinds of formal proofs).

I&#039;m happy to use a relevant (non-computer-formalized) textbook, so I wouldn&#039;t say my learning has been exclusively by means of formal proofs, but the bulk of it has been focused on writing formal proofs and many of the source materials I have been reading are formal proofs.]]></description>
		<content:encoded><![CDATA[<p>One of the comments asks whether anyone has taught themselves math by writing and reading formal proofs. While I had an undergraduate math education before getting into formal proofs, I have learned significant areas from reading metamath ( <a href="http://metamath.org/" rel="nofollow">http://metamath.org/</a> ), writing proofs at <a href="http://www.wikiproofs.org/" rel="nofollow">http://www.wikiproofs.org/</a> , reading coq geometry proofs of Julien Narboux at <a href="http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.158.8614" rel="nofollow">http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.158.8614</a> and perhaps a few other more minor sources.</p>
<p>Things I have learned include: (1) doing propositional logic via axioms and proofs, rather than truth tables (e.g. translating the propositional logic chapter of Principia Mathematica to a formal proof system which is metamath-like in the sense of not having it built in), (2) intuitionistic propositional logic (if there is a good textbook on this, I haven&#8217;t yet found it, but as long as I start from a correct set of axioms, I feel like I won&#8217;t go too far astray), (3) the difference between a class and a set (hinted at in my undergraduate days, but which actually has subtleties that come out, at least for me, much more in a formal proof system than in any amount of trying to explain it in terms of concepts), (4) predicate logic: I knew very little of this, beyond what the average non-logician uses in an intuitive way without trying to explain it in detail. Now I have proved enough predicate logic to use in, say, arithmetic or set theory, from two different axiomizations. (5) Formalizing geometry (in the point/line style of Euclid&#8217;s elements or Tarski&#8217;s geometry axioms). When I started I had no idea how the diagrams of high school geometry could be translated to a formal language with predicates like &#8220;x is between y and z&#8221; and &#8220;x y is congruent to z w&#8221;. (6) Logical concepts like the deduction theorem (although I haven&#8217;t tried to express these in a formal proof system, or even read the work of people who have, it is hard to work in a system like metamath without gaining some insight into what kinds of informal reasoning translate into what kinds of formal proofs).</p>
<p>I&#8217;m happy to use a relevant (non-computer-formalized) textbook, so I wouldn&#8217;t say my learning has been exclusively by means of formal proofs, but the bulk of it has been focused on writing formal proofs and many of the source materials I have been reading are formal proofs.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: slawekk</title>
		<link>http://slawekk.wordpress.com/2012/01/26/recently-read/#comment-474</link>
		<dc:creator><![CDATA[slawekk]]></dc:creator>
		<pubDate>Sun, 12 Feb 2012 09:08:14 +0000</pubDate>
		<guid isPermaLink="false">http://slawekk.wordpress.com/?p=655#comment-474</guid>
		<description><![CDATA[Good ideas, thanks.]]></description>
		<content:encoded><![CDATA[<p>Good ideas, thanks.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Joe Rusky</title>
		<link>http://slawekk.wordpress.com/2012/01/26/recently-read/#comment-472</link>
		<dc:creator><![CDATA[Joe Rusky]]></dc:creator>
		<pubDate>Sat, 11 Feb 2012 03:48:14 +0000</pubDate>
		<guid isPermaLink="false">http://slawekk.wordpress.com/?p=655#comment-472</guid>
		<description><![CDATA[You don&#039;t have a massive number of posts, but there are enough that it would be good if you had an archives widget in the sidebar.

Also, you can list the post titles to every post by using a Wordpress shortcode. The instructions are on this page:

http://en.support.wordpress.com/archives-shortcode/

You would put the command &quot;[archives]&quot; in a new page, then drag a text widget into the sidebar, and then put a link to the page in the text widget. That&#039;s one way to do it.

Or, you would use a template that provides links to your pages (pages rather than posts). 

It&#039;s just a suggestion.]]></description>
		<content:encoded><![CDATA[<p>You don&#8217;t have a massive number of posts, but there are enough that it would be good if you had an archives widget in the sidebar.</p>
<p>Also, you can list the post titles to every post by using a WordPress shortcode. The instructions are on this page:</p>
<p><a href="http://en.support.wordpress.com/archives-shortcode/" rel="nofollow">http://en.support.wordpress.com/archives-shortcode/</a></p>
<p>You would put the command &#8220;[archives]&#8221; in a new page, then drag a text widget into the sidebar, and then put a link to the page in the text widget. That&#8217;s one way to do it.</p>
<p>Or, you would use a template that provides links to your pages (pages rather than posts). </p>
<p>It&#8217;s just a suggestion.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: JF</title>
		<link>http://slawekk.wordpress.com/2012/01/26/recently-read/#comment-467</link>
		<dc:creator><![CDATA[JF]]></dc:creator>
		<pubDate>Tue, 07 Feb 2012 23:28:36 +0000</pubDate>
		<guid isPermaLink="false">http://slawekk.wordpress.com/?p=655#comment-467</guid>
		<description><![CDATA[Thanks for the explanation. It sounded more difficult than only needing a definition and adding words such as &quot;Let ___ be a ___&quot; to your hypothesis. Maybe there are some subtleties, but it appears that you lose all the set operations when it&#039;s neither a set or a class, but a predicate.

My quote above by Andrews is what makes me paranoid. Naive sets rule, and he indicates that people occasionally define something as a set and violate the Axiom Scheme of Specification. If I&#039;m trying to duplicate math where that has happened, then maybe there&#039;s an easy way to fix the problem with the right framework.

I have to check out of here permanently. I can only use what people like you produce. I forget that because I&#039;ve been in a dormant state, having had to work.

I&#039;ll be working soon to try and produce some social-moral-political commentary-music-entertainment. That doesn&#039;t mix well with the professional scene.

However, out of this series of comments, I think I&#039;ve gotten one answer and one future possibility.

It appears that NBG set theory is not a practical solution to the &quot;more than a set&quot; problem. If you get too far from imitating naive set theory, it&#039;s probably a clumsy solution.

I put the idea about inaccessible cardinals in the back of my mind, as a future possibility.

Happy proving grounds.]]></description>
		<content:encoded><![CDATA[<p>Thanks for the explanation. It sounded more difficult than only needing a definition and adding words such as &#8220;Let ___ be a ___&#8221; to your hypothesis. Maybe there are some subtleties, but it appears that you lose all the set operations when it&#8217;s neither a set or a class, but a predicate.</p>
<p>My quote above by Andrews is what makes me paranoid. Naive sets rule, and he indicates that people occasionally define something as a set and violate the Axiom Scheme of Specification. If I&#8217;m trying to duplicate math where that has happened, then maybe there&#8217;s an easy way to fix the problem with the right framework.</p>
<p>I have to check out of here permanently. I can only use what people like you produce. I forget that because I&#8217;ve been in a dormant state, having had to work.</p>
<p>I&#8217;ll be working soon to try and produce some social-moral-political commentary-music-entertainment. That doesn&#8217;t mix well with the professional scene.</p>
<p>However, out of this series of comments, I think I&#8217;ve gotten one answer and one future possibility.</p>
<p>It appears that NBG set theory is not a practical solution to the &#8220;more than a set&#8221; problem. If you get too far from imitating naive set theory, it&#8217;s probably a clumsy solution.</p>
<p>I put the idea about inaccessible cardinals in the back of my mind, as a future possibility.</p>
<p>Happy proving grounds.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: slawekk</title>
		<link>http://slawekk.wordpress.com/2012/01/26/recently-read/#comment-466</link>
		<dc:creator><![CDATA[slawekk]]></dc:creator>
		<pubDate>Tue, 07 Feb 2012 08:14:32 +0000</pubDate>
		<guid isPermaLink="false">http://slawekk.wordpress.com/?p=655#comment-466</guid>
		<description><![CDATA[The truth is, I don&#039;t know much about classes. As I said, I never used them. I know an additional axiom about inaccessible cardinal allows to do some limited sort of category theory inside ZF. 
There is no way to formulate a theorem that uses classes in Isabelle/ZF as Isabelle/ZF implements the version of ZF without classes.
I can tell you how I understand the statement that classes can be modeled by predicates. This is very simple: suppose you want to prove a theorem that applies to all groups. In a foundation where classes are allowed you define the class $latex \mathbb{G}$ (consisting of pairs $latex \langle G,P \rangle$ where $latex P:G\times G\rightarrow G$ is a binary operation on $latex G$) of all groups and when you want to formulate a theorem about groups you put $latex \langle G,P\rangle \in  \mathbb{G}$ in the assumptions.
When you are not allowed to use classes, you define a predicate &quot;is a group&quot; that says what it means that a pair of sets is a group (something like &quot;$latex \langle G,P \rangle$ is a monoid and all elements in $latex G$ have an inverse with respect to the operation $latex P$, or some alternative definition) and then instead of writing &quot;$latex \langle G,P\rangle \in  \mathbb{G}$&quot;  you write &quot;$latex \langle G,P\rangle$ is a group&quot;.]]></description>
		<content:encoded><![CDATA[<p>The truth is, I don&#8217;t know much about classes. As I said, I never used them. I know an additional axiom about inaccessible cardinal allows to do some limited sort of category theory inside ZF.<br />
There is no way to formulate a theorem that uses classes in Isabelle/ZF as Isabelle/ZF implements the version of ZF without classes.<br />
I can tell you how I understand the statement that classes can be modeled by predicates. This is very simple: suppose you want to prove a theorem that applies to all groups. In a foundation where classes are allowed you define the class <img src='http://s0.wp.com/latex.php?latex=%5Cmathbb%7BG%7D&amp;bg=ffffff&amp;fg=333333&amp;s=0' alt='&#92;mathbb{G}' title='&#92;mathbb{G}' class='latex' /> (consisting of pairs <img src='http://s0.wp.com/latex.php?latex=%5Clangle+G%2CP+%5Crangle&amp;bg=ffffff&amp;fg=333333&amp;s=0' alt='&#92;langle G,P &#92;rangle' title='&#92;langle G,P &#92;rangle' class='latex' /> where <img src='http://s0.wp.com/latex.php?latex=P%3AG%5Ctimes+G%5Crightarrow+G&amp;bg=ffffff&amp;fg=333333&amp;s=0' alt='P:G&#92;times G&#92;rightarrow G' title='P:G&#92;times G&#92;rightarrow G' class='latex' /> is a binary operation on <img src='http://s0.wp.com/latex.php?latex=G&amp;bg=ffffff&amp;fg=333333&amp;s=0' alt='G' title='G' class='latex' />) of all groups and when you want to formulate a theorem about groups you put <img src='http://s0.wp.com/latex.php?latex=%5Clangle+G%2CP%5Crangle+%5Cin++%5Cmathbb%7BG%7D&amp;bg=ffffff&amp;fg=333333&amp;s=0' alt='&#92;langle G,P&#92;rangle &#92;in  &#92;mathbb{G}' title='&#92;langle G,P&#92;rangle &#92;in  &#92;mathbb{G}' class='latex' /> in the assumptions.<br />
When you are not allowed to use classes, you define a predicate &#8220;is a group&#8221; that says what it means that a pair of sets is a group (something like &#8220;<img src='http://s0.wp.com/latex.php?latex=%5Clangle+G%2CP+%5Crangle&amp;bg=ffffff&amp;fg=333333&amp;s=0' alt='&#92;langle G,P &#92;rangle' title='&#92;langle G,P &#92;rangle' class='latex' /> is a monoid and all elements in <img src='http://s0.wp.com/latex.php?latex=G&amp;bg=ffffff&amp;fg=333333&amp;s=0' alt='G' title='G' class='latex' /> have an inverse with respect to the operation <img src='http://s0.wp.com/latex.php?latex=P&amp;bg=ffffff&amp;fg=333333&amp;s=0' alt='P' title='P' class='latex' />, or some alternative definition) and then instead of writing &#8220;<img src='http://s0.wp.com/latex.php?latex=%5Clangle+G%2CP%5Crangle+%5Cin++%5Cmathbb%7BG%7D&amp;bg=ffffff&amp;fg=333333&amp;s=0' alt='&#92;langle G,P&#92;rangle &#92;in  &#92;mathbb{G}' title='&#92;langle G,P&#92;rangle &#92;in  &#92;mathbb{G}' class='latex' />&#8221;  you write &#8220;<img src='http://s0.wp.com/latex.php?latex=%5Clangle+G%2CP%5Crangle&amp;bg=ffffff&amp;fg=333333&amp;s=0' alt='&#92;langle G,P&#92;rangle' title='&#92;langle G,P&#92;rangle' class='latex' /> is a group&#8221;.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: JF</title>
		<link>http://slawekk.wordpress.com/2012/01/26/recently-read/#comment-465</link>
		<dc:creator><![CDATA[JF]]></dc:creator>
		<pubDate>Tue, 07 Feb 2012 04:47:35 +0000</pubDate>
		<guid isPermaLink="false">http://slawekk.wordpress.com/?p=655#comment-465</guid>
		<description><![CDATA[I am like a wave, driven by the wind and tossed. It&#039;s true I may be wasting your time, but I&#039;ve come full circle in my searches about proper classes, this time due to searching for books on NBG set theory. So, we can ignore, for the moment, my last comment, and delay the deleting of all of this.

Not wanting to talk unintelligently about what I don&#039;t understand, I had set aside part of what I originally wanted to ask about as a possible way to get proper classes with ZF.

In the &lt;a href=&quot;http://en.wikipedia.org/wiki/Class_%28set_theory%29&quot; rel=&quot;nofollow&quot;&gt;wiki article&lt;/a&gt; I linked to in my first comment, it says this:

&lt;blockquote&gt;Because classes do not have any formal status in the theory of ZF, the axioms of ZF do not immediately apply to classes. However, if an inaccessible cardinal κ is assumed, then the sets of smaller rank form a model of ZF (a Grothendieck universe), and its subsets can be thought of as &quot;classes&quot;.&lt;/blockquote&gt;

It seems to indicate that by simply adding an axiom, we get to mess around with classes like we get to mess around with sets, all in ZF or a model of ZF. 

I thought, can it be that simple? But then I also asked, &quot;What&#039;s a model of ZF?&quot; 

Grothendieck unverses, models of ZF, that&#039;s too many things to ask about, so I decided.

But, there is this link:

http://mathoverflow.net/questions/6423/set-theory-for-category-theory-beginners

And an arXiv article linked to in one of the answers, the pertinent sections being 6, 7, and 8:

http://arxiv.org/pdf/0810.1279v2.pdf

Those indicate that maybe I was on the right track. I think I&#039;m going to write up a question for math.stackexchange.com to ask about these things. Maybe it&#039;s so simple as adding an axiom assuming an inaccessible cardinal, whatever that means.

I don&#039;t really like putting all these lengthy comments on your blog, but these type of activities can help me work through things sometimes. That regrettable thread I started on the mailing list helped me think some things through faster than I would have without it.]]></description>
		<content:encoded><![CDATA[<p>I am like a wave, driven by the wind and tossed. It&#8217;s true I may be wasting your time, but I&#8217;ve come full circle in my searches about proper classes, this time due to searching for books on NBG set theory. So, we can ignore, for the moment, my last comment, and delay the deleting of all of this.</p>
<p>Not wanting to talk unintelligently about what I don&#8217;t understand, I had set aside part of what I originally wanted to ask about as a possible way to get proper classes with ZF.</p>
<p>In the <a href="http://en.wikipedia.org/wiki/Class_%28set_theory%29" rel="nofollow">wiki article</a> I linked to in my first comment, it says this:</p>
<blockquote><p>Because classes do not have any formal status in the theory of ZF, the axioms of ZF do not immediately apply to classes. However, if an inaccessible cardinal κ is assumed, then the sets of smaller rank form a model of ZF (a Grothendieck universe), and its subsets can be thought of as &#8220;classes&#8221;.</p></blockquote>
<p>It seems to indicate that by simply adding an axiom, we get to mess around with classes like we get to mess around with sets, all in ZF or a model of ZF. </p>
<p>I thought, can it be that simple? But then I also asked, &#8220;What&#8217;s a model of ZF?&#8221; </p>
<p>Grothendieck unverses, models of ZF, that&#8217;s too many things to ask about, so I decided.</p>
<p>But, there is this link:</p>
<p><a href="http://mathoverflow.net/questions/6423/set-theory-for-category-theory-beginners" rel="nofollow">http://mathoverflow.net/questions/6423/set-theory-for-category-theory-beginners</a></p>
<p>And an arXiv article linked to in one of the answers, the pertinent sections being 6, 7, and 8:</p>
<p><a href="http://arxiv.org/pdf/0810.1279v2.pdf" rel="nofollow">http://arxiv.org/pdf/0810.1279v2.pdf</a></p>
<p>Those indicate that maybe I was on the right track. I think I&#8217;m going to write up a question for math.stackexchange.com to ask about these things. Maybe it&#8217;s so simple as adding an axiom assuming an inaccessible cardinal, whatever that means.</p>
<p>I don&#8217;t really like putting all these lengthy comments on your blog, but these type of activities can help me work through things sometimes. That regrettable thread I started on the mailing list helped me think some things through faster than I would have without it.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: JF</title>
		<link>http://slawekk.wordpress.com/2012/01/26/recently-read/#comment-464</link>
		<dc:creator><![CDATA[JF]]></dc:creator>
		<pubDate>Tue, 07 Feb 2012 00:07:51 +0000</pubDate>
		<guid isPermaLink="false">http://slawekk.wordpress.com/?p=655#comment-464</guid>
		<description><![CDATA[Well, I think I&#039;ve wasted your time some. I have to make an attempt to go the HOL route. It&#039;s a lonely, painful route, but that&#039;s the nature of math anyway. If you were to be inclined to delete all these comments, that wouldn&#039;t particularly bother me.]]></description>
		<content:encoded><![CDATA[<p>Well, I think I&#8217;ve wasted your time some. I have to make an attempt to go the HOL route. It&#8217;s a lonely, painful route, but that&#8217;s the nature of math anyway. If you were to be inclined to delete all these comments, that wouldn&#8217;t particularly bother me.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: JF</title>
		<link>http://slawekk.wordpress.com/2012/01/26/recently-read/#comment-463</link>
		<dc:creator><![CDATA[JF]]></dc:creator>
		<pubDate>Mon, 06 Feb 2012 17:48:49 +0000</pubDate>
		<guid isPermaLink="false">http://slawekk.wordpress.com/?p=655#comment-463</guid>
		<description><![CDATA[My first statement in the last comment suggests that I know for sure that we can&#039;t know that there&#039;s not a dead end in Isabelle/ZF, because ZF doesn&#039;t formally have proper classes. I don&#039;t know that at all.

I&#039;ve only barely scraped the surface of axiomatic set theory, but as I understand it, the axioms absolutely prevent you from building certain types of sets, otherwise, you would get a paradox, such as Russel&#039;s paradox. I barely went through a certain exercise which showed that one of the axioms, call it Axiom X, prevents you from creating a set of sets which don&#039;t contain themselves, or whatever it did, it prevented Russel&#039;s Paradox. I&#039;m too lazy to look that up again...

Actually, I&#039;m not, and it&#039;s the Axiom Schema of Specification, referred to as the Axiom of Comprehension by Andrews, who I quote in my first comment. Not allowing unrestricted comprehension prevents the paradoxes. Here&#039;s the wiki link:

http://en.wikipedia.org/wiki/Axiom_schema_of_specification#Unrestricted_comprehension

I&#039;m not worried about axiomatic set theory at this time, but I would like to make a particular request of someone familiar with Isabelle, where my request is in the context of the quotes above about proper.

The request would be this:

&lt;blockquote&gt;Can someone please give me an example of a theorem involving a proper class that&#039;s implemented in Isabelle/ZF?&lt;/blockquote&gt;

I don&#039;t make that request, because I don&#039;t want to be a pest anymore than what I am, and who says anyone will answer it? But if you or Larry Paulson created a little example involving a proper class, then that would make me feel better about the future. I assume everyone has higher priorities than making me feel better about the future.

If everything is required to be a set, then certain sets can&#039;t exist, which puts limitations on what kind of objects you can have that contain sets. That sounds to me like a dead end. The other possibility is that it ends up being such a hassle to have these kind of objects, that it&#039;s not worth using them in ZF set theory.]]></description>
		<content:encoded><![CDATA[<p>My first statement in the last comment suggests that I know for sure that we can&#8217;t know that there&#8217;s not a dead end in Isabelle/ZF, because ZF doesn&#8217;t formally have proper classes. I don&#8217;t know that at all.</p>
<p>I&#8217;ve only barely scraped the surface of axiomatic set theory, but as I understand it, the axioms absolutely prevent you from building certain types of sets, otherwise, you would get a paradox, such as Russel&#8217;s paradox. I barely went through a certain exercise which showed that one of the axioms, call it Axiom X, prevents you from creating a set of sets which don&#8217;t contain themselves, or whatever it did, it prevented Russel&#8217;s Paradox. I&#8217;m too lazy to look that up again&#8230;</p>
<p>Actually, I&#8217;m not, and it&#8217;s the Axiom Schema of Specification, referred to as the Axiom of Comprehension by Andrews, who I quote in my first comment. Not allowing unrestricted comprehension prevents the paradoxes. Here&#8217;s the wiki link:</p>
<p><a href="http://en.wikipedia.org/wiki/Axiom_schema_of_specification#Unrestricted_comprehension" rel="nofollow">http://en.wikipedia.org/wiki/Axiom_schema_of_specification#Unrestricted_comprehension</a></p>
<p>I&#8217;m not worried about axiomatic set theory at this time, but I would like to make a particular request of someone familiar with Isabelle, where my request is in the context of the quotes above about proper.</p>
<p>The request would be this:</p>
<blockquote><p>Can someone please give me an example of a theorem involving a proper class that&#8217;s implemented in Isabelle/ZF?</p></blockquote>
<p>I don&#8217;t make that request, because I don&#8217;t want to be a pest anymore than what I am, and who says anyone will answer it? But if you or Larry Paulson created a little example involving a proper class, then that would make me feel better about the future. I assume everyone has higher priorities than making me feel better about the future.</p>
<p>If everything is required to be a set, then certain sets can&#8217;t exist, which puts limitations on what kind of objects you can have that contain sets. That sounds to me like a dead end. The other possibility is that it ends up being such a hassle to have these kind of objects, that it&#8217;s not worth using them in ZF set theory.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: JF</title>
		<link>http://slawekk.wordpress.com/2012/01/26/recently-read/#comment-462</link>
		<dc:creator><![CDATA[JF]]></dc:creator>
		<pubDate>Mon, 06 Feb 2012 16:50:31 +0000</pubDate>
		<guid isPermaLink="false">http://slawekk.wordpress.com/?p=655#comment-462</guid>
		<description><![CDATA[FIRST PART THAT YOU CAN SKIP

So I&#039;ll quote you on &quot;there is no dead end&quot;, and hold you to it. But that&#039;s a joke, because no one can know what the dead ends are or aren&#039;t, unless they&#039;ve formally proved what the dead ends are or aren&#039;t for a particular theorem prover.

As far as being able to learn math from a proof, In my mind, I was relating that to the idea that in mathematical writing, people have an expectation that they&#039;re going to be able to learn something that they don&#039;t know from studying a proof. On mathoverflow.net, they emphasize that even when you ask a question, the way that you ask it  &lt;a href=&quot;http://mathoverflow.net/howtoask#motivation&quot; rel=&quot;nofollow&quot;&gt;should be informative&lt;/a&gt;:

&lt;blockquote&gt;So when you ask for the help of those who know more than you, please also extend a hand to those who know less than you by explaining why you are asking the question.&lt;/blockquote&gt;

A person throwing out cryptic, mathematical statements that only serve his or her purpose is obnoxious to people.

A decently explained proof is the completion of something like a three or four step process: an informal discussion, an example, the formal statement of the theorem, and the proof. It&#039;s the understanding of the proof that takes you to a different level of understanding. The scope of mathematical writing runs the gamut, but the more unfriendly an author gets, such as going to a pure theorem, proof, theorem, proof, theorem, proof format, the less their book is going to be read. 

Additionally, if an author gets to a point where they&#039;re not filling in huge logical steps in their proofs, it becomes totally unacceptable to the mathematical masses. The use of &quot;by auto&quot; and other automatic proof methods is the equivalent of a textbook author not providing a proof, or providing a cryptic proof. The level of mathematics in a book will determine what steps can be left out, but still, you don&#039;t get to say, &quot;Proof: It&#039;s true. Figure it out yourself.&quot;.

As it is, to learn an Isabelle statement applied to math, I have to understand the math to figure out the logical reason underlying why the person used that statement. If I already knew how to use Isabelle, I would just start proving the standard, textbook theorems I want to prove.

For me, learning Isabelle can&#039;t be a three-month process. Part of my complaint is people&#039;s use of commands like &quot;by auto&quot;. For me to be able to fill in the gaps of &quot;by auto&quot; and &quot;simp&quot;, I&#039;ll have to know where the theorems are that those methods use. That will require me going through a certain amount of foundational code.

Additionally, I need to learn how to use natural deduction and the Isabelle methods that go along with that, which all starts down in Isabelle/FOL. The fact that Isabelle/ZF and Isabelle/HOL are based on natural deduction is part of what keeps me coming back. 

The idea of matching conclusions of theorems with hypothesis is something I like. Backward proof is not considered good form when writing up a formal proof, but it&#039;s an important part of proving math. You figure a proof out by going backwards, many times, and then you write it up forwards style. Not knowing a lot, it still appears to me that natural deduction tactics are simple, but yet potentially very powerful.

SECOND PART

I don&#039;t really like all that social-networking style voting, especially because of what I see on mathoverflow.net. Math.stackexchange.com is more tolerant of questions, but even on that forum, I suspect you end up with math supercops wanting to police everyone. I haven&#039;t been watching math.stackeschange to know how bad it is.

I can get pedantic with the best of the pedantics, but if someone gets snippy with me, then I want to go inflammatory on them, and that&#039;s not good on a site like that. These days, I don&#039;t like to see my name out on the web much, so you might see me ask questions under a pseudonym, not that JF is a pseudonym, though it&#039;s not my full name. I don&#039;t even like the idea of opening up an account on stackexchange.com, but a man has to do what he has to do to get ahead in life.

THIRD PART

You have to understand that I have no interest in making any contribution to IsarMathLib. I only care to learn from what you&#039;ve written, both in how to use Isabelle, in reviewing math I&#039;ll be familiar with in IsarMathLib, and learning math I don&#039;t know as a result of trying to figure out a proof.

All I&#039;m interested in right now is proving theorems in textbooks that I&#039;ll be studying. Eventually that&#039;s supposed to lead into something original, but that&#039;s not of ultimate importance to me. If something can be extracted out of what I do, or if I want something I don&#039;t know how to get, and it causes you to add definitions and theorems to IsarMathLib, then that&#039;ll be good, but having that happen is not my primary goal.

I&#039;ll be marking up what you&#039;ve done to suit my purposes. Renaming definitions and theorems, maybe. Expanding steps in proofs to make the logic more clear, hopefully. Anything to help me out and put what I study into a more verbose format.

Creating a fork based on your IsarMathLib wouldn&#039;t be desirable for a number of reasons, but forks are a fact of life, because people want what they want, the way they want it. ProofPeer is a fork off of both Isabelle and HOL-Light (I guess I&#039;m using &quot;fork&quot; in the right way). I wouldn&#039;t want to create a fork off of IsarMathLib, but I want what I want. I just tell you these things.

This is all lofty talk, but after I get laid off from my current job, I expect to make faster progress. I should start making some progress even now. This all assumes I won&#039;t look again in the Isabelle/ZF files and again say, &quot;Forget this. I&#039;m not going this route.&quot;

I hope to get out of &quot;opinion mode&quot; here and go purely technical. Expressing my opinions and talking about the future suck up my time in a bad way.]]></description>
		<content:encoded><![CDATA[<p>FIRST PART THAT YOU CAN SKIP</p>
<p>So I&#8217;ll quote you on &#8220;there is no dead end&#8221;, and hold you to it. But that&#8217;s a joke, because no one can know what the dead ends are or aren&#8217;t, unless they&#8217;ve formally proved what the dead ends are or aren&#8217;t for a particular theorem prover.</p>
<p>As far as being able to learn math from a proof, In my mind, I was relating that to the idea that in mathematical writing, people have an expectation that they&#8217;re going to be able to learn something that they don&#8217;t know from studying a proof. On mathoverflow.net, they emphasize that even when you ask a question, the way that you ask it  <a href="http://mathoverflow.net/howtoask#motivation" rel="nofollow">should be informative</a>:</p>
<blockquote><p>So when you ask for the help of those who know more than you, please also extend a hand to those who know less than you by explaining why you are asking the question.</p></blockquote>
<p>A person throwing out cryptic, mathematical statements that only serve his or her purpose is obnoxious to people.</p>
<p>A decently explained proof is the completion of something like a three or four step process: an informal discussion, an example, the formal statement of the theorem, and the proof. It&#8217;s the understanding of the proof that takes you to a different level of understanding. The scope of mathematical writing runs the gamut, but the more unfriendly an author gets, such as going to a pure theorem, proof, theorem, proof, theorem, proof format, the less their book is going to be read. </p>
<p>Additionally, if an author gets to a point where they&#8217;re not filling in huge logical steps in their proofs, it becomes totally unacceptable to the mathematical masses. The use of &#8220;by auto&#8221; and other automatic proof methods is the equivalent of a textbook author not providing a proof, or providing a cryptic proof. The level of mathematics in a book will determine what steps can be left out, but still, you don&#8217;t get to say, &#8220;Proof: It&#8217;s true. Figure it out yourself.&#8221;.</p>
<p>As it is, to learn an Isabelle statement applied to math, I have to understand the math to figure out the logical reason underlying why the person used that statement. If I already knew how to use Isabelle, I would just start proving the standard, textbook theorems I want to prove.</p>
<p>For me, learning Isabelle can&#8217;t be a three-month process. Part of my complaint is people&#8217;s use of commands like &#8220;by auto&#8221;. For me to be able to fill in the gaps of &#8220;by auto&#8221; and &#8220;simp&#8221;, I&#8217;ll have to know where the theorems are that those methods use. That will require me going through a certain amount of foundational code.</p>
<p>Additionally, I need to learn how to use natural deduction and the Isabelle methods that go along with that, which all starts down in Isabelle/FOL. The fact that Isabelle/ZF and Isabelle/HOL are based on natural deduction is part of what keeps me coming back. </p>
<p>The idea of matching conclusions of theorems with hypothesis is something I like. Backward proof is not considered good form when writing up a formal proof, but it&#8217;s an important part of proving math. You figure a proof out by going backwards, many times, and then you write it up forwards style. Not knowing a lot, it still appears to me that natural deduction tactics are simple, but yet potentially very powerful.</p>
<p>SECOND PART</p>
<p>I don&#8217;t really like all that social-networking style voting, especially because of what I see on mathoverflow.net. Math.stackexchange.com is more tolerant of questions, but even on that forum, I suspect you end up with math supercops wanting to police everyone. I haven&#8217;t been watching math.stackeschange to know how bad it is.</p>
<p>I can get pedantic with the best of the pedantics, but if someone gets snippy with me, then I want to go inflammatory on them, and that&#8217;s not good on a site like that. These days, I don&#8217;t like to see my name out on the web much, so you might see me ask questions under a pseudonym, not that JF is a pseudonym, though it&#8217;s not my full name. I don&#8217;t even like the idea of opening up an account on stackexchange.com, but a man has to do what he has to do to get ahead in life.</p>
<p>THIRD PART</p>
<p>You have to understand that I have no interest in making any contribution to IsarMathLib. I only care to learn from what you&#8217;ve written, both in how to use Isabelle, in reviewing math I&#8217;ll be familiar with in IsarMathLib, and learning math I don&#8217;t know as a result of trying to figure out a proof.</p>
<p>All I&#8217;m interested in right now is proving theorems in textbooks that I&#8217;ll be studying. Eventually that&#8217;s supposed to lead into something original, but that&#8217;s not of ultimate importance to me. If something can be extracted out of what I do, or if I want something I don&#8217;t know how to get, and it causes you to add definitions and theorems to IsarMathLib, then that&#8217;ll be good, but having that happen is not my primary goal.</p>
<p>I&#8217;ll be marking up what you&#8217;ve done to suit my purposes. Renaming definitions and theorems, maybe. Expanding steps in proofs to make the logic more clear, hopefully. Anything to help me out and put what I study into a more verbose format.</p>
<p>Creating a fork based on your IsarMathLib wouldn&#8217;t be desirable for a number of reasons, but forks are a fact of life, because people want what they want, the way they want it. ProofPeer is a fork off of both Isabelle and HOL-Light (I guess I&#8217;m using &#8220;fork&#8221; in the right way). I wouldn&#8217;t want to create a fork off of IsarMathLib, but I want what I want. I just tell you these things.</p>
<p>This is all lofty talk, but after I get laid off from my current job, I expect to make faster progress. I should start making some progress even now. This all assumes I won&#8217;t look again in the Isabelle/ZF files and again say, &#8220;Forget this. I&#8217;m not going this route.&#8221;</p>
<p>I hope to get out of &#8220;opinion mode&#8221; here and go purely technical. Expressing my opinions and talking about the future suck up my time in a bad way.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: slawekk</title>
		<link>http://slawekk.wordpress.com/2012/01/26/recently-read/#comment-461</link>
		<dc:creator><![CDATA[slawekk]]></dc:creator>
		<pubDate>Mon, 06 Feb 2012 10:59:36 +0000</pubDate>
		<guid isPermaLink="false">http://slawekk.wordpress.com/?p=655#comment-461</guid>
		<description><![CDATA[I wouldn&#039;t worry about &quot;hitting a dead end&quot; just because Isabelle/ZF implements the version of ZF that does not have classes. For a long time I didn&#039;t even know there are other versions (until I attempted a translation from Metamath that uses classes). There is no dead end, at worst there may be some inconvenience in expressing some concepts. Having all objects of the same kind (set) simplifies things.
I think you also overestimate  the effort needed to learn writing proofs using Isabelle. Indeed years are needed to learn mathematics, but then learning Isabelle is more like three months of additional effort rather than three years. Learning math by reading and writing formal proofs is an interesting way, but I don&#039;t think anybody has attempted it yet. I am curious myself how it would go. I agree with you that formal proofs written without any informal commentary are useless for this purpose.
One big disadvantage of a mailing list is that math notation is not available. It is very inconvenient to discuss math without having math notation. Some public forum with LaTeX support would be good. I like your idea of using StackExchange. If they complain, another possibility is to set up a wiki on wikidot.com .]]></description>
		<content:encoded><![CDATA[<p>I wouldn&#8217;t worry about &#8220;hitting a dead end&#8221; just because Isabelle/ZF implements the version of ZF that does not have classes. For a long time I didn&#8217;t even know there are other versions (until I attempted a translation from Metamath that uses classes). There is no dead end, at worst there may be some inconvenience in expressing some concepts. Having all objects of the same kind (set) simplifies things.<br />
I think you also overestimate  the effort needed to learn writing proofs using Isabelle. Indeed years are needed to learn mathematics, but then learning Isabelle is more like three months of additional effort rather than three years. Learning math by reading and writing formal proofs is an interesting way, but I don&#8217;t think anybody has attempted it yet. I am curious myself how it would go. I agree with you that formal proofs written without any informal commentary are useless for this purpose.<br />
One big disadvantage of a mailing list is that math notation is not available. It is very inconvenient to discuss math without having math notation. Some public forum with LaTeX support would be good. I like your idea of using StackExchange. If they complain, another possibility is to set up a wiki on wikidot.com .</p>
]]></content:encoded>
	</item>
</channel>
</rss>
