5919:
concepts, object, class, attribute. but since an attribute is in class-of-attribute and so on, you can start classifying attributes by class (type) and so forth in a very very generic and powerful way, and have behaviour that does not just apply to objects, but to classes, but classes of classes, entirely uniformly. The problem old earl russell had was that he got himself in a twist over infinite sets or classes, indeed made it imperative that classes could not be members of themselves, the cheat, but it is perfectly all right when everything is finite, and a database may be large, but it is finite, so a lot of those extension problems vanish as frost will blacken a dahliah.
2370:, and most of the metatheoretical results that one would prove are indeed provable in that setting. For example, the proof of Gödel's incompleteness theorem for a theory T can be formalized into PRA to obtain a primitive recursive function that would take a proof-in-T of T's Gödel sentence and return as output a proof-in-T of 0=1. Similarly, results about set theory can be converted, in a mechanical way, into relative consistency results that are provable in PRA. For example, there is a primitive recursive function that takes any proof-in-ZFC of the continuum hypothesis as input and returns a proof-in-ZFC of 0=1 as output.
1634:"Computability theory" was a dab page that included both mathematical logic and computer science. Those particular articles have topics that are more on the computer science side than on the mathematical logic side, so I would categorize them in the CS categories rather than the math categories. In the math logic approach, all problems are converted into decision problems; this is the framework used to determine uncomputability. I wasn't aware that the other types of problems had any significance until someone pointed out to me that the conversion from one type to another cannot always be done in polynomial time. — Carl
3197:
3166:
2799:
2672:
31:
5852:
4961:
846:
reviews. They are soon going to vote on putting even FA and GA together on a single page, along with an open-ended review system that is not sufficiently active. If we had a single page for reviewing the classification of maths articles, I think it would soon be watchlisted by enough project members and therefore get a lot more activity. But it may be best to start such a system in term time to give it a chance to prosper from the beginning.
661:
reviews. They are soon going to vote on putting even FA and GA together on a single page, along with an open-ended review system that is not sufficiently active. If we had a single page for reviewing the classification of maths articles, I think it would soon be watchlisted by enough project members and therefore get a lot more activity. But it may be best to start such a system in term time to give it a chance to prosper from the beginning.
1853:, which describes itself as the "nation's largest, independent English language monthly newspaper". If the source that was in the article is not from the Polish-American Journal, can you tell me where it actually came from? The actual reference provided was "The 150'th Anniversary of Polish-American Pastoral Ministry, Webster, Massachusetts (September, 11, 2005)", which doesn't even list where the article was published. — Carl
5678:." The issue is that this "option" was being implemented automatically by AWB; I think AWB has tweaked its behavior recently to avoid this. This is one problem with AWB: its developers do not always pay attention to this sort of thing. But a bot has to be more careful than a human editor, because humans are expected to review each of their AWB edits by hand, while bots are not.
6128:
Yes, I think I can do this. However, I am going to be on vacation soon, so it will be
January before I can look at it. I have been under the impression that not very many pages are renamed during their peer review, so this is a somewhat infrequent problem. Still, it seems like it can be fixed. — Carl
6046:
recompiled to display the latest version, but for performance this is a half-hearted recompile that does not actually update anything in the database. This system has the side effect that a page can look like it is in a category when you view the page directly, when it is not actually in the category.
6045:
When a highly-used template is edited, job queue entries are created to recompile the pages that use the template (as if the pages had all been given a null edit). This recompilation updates the category membership records in the database. When a logged-in user views a page, the page is automatically
5912:
No worries, I know how sometimes these things sound when written down. Was not offended by it, just amused. The pity is having worked in defence and then for computer companies most of my work is either secret or commercially confidential, so I can't say some of the great things I have done, but they
5703:
Additionally, the named-reference problem is only one of several issues with the bot. The most recent block is for a different issue, that Rich F. agreed to fix a while back but, apparently, didn't fix completely. I didn't realize at the time the bot was still adding named references, since I trusted
5542:
That's an interesting question; it never occurred to me before, and I don't know the answer you are looking for off the top of my head. It looks like Hinman's exercise 4.32 is trying to give a hint, but I need to think about it a little more. I am sure I used "closely related" because I didn't know a
3124:
I need to set up another script to do the messages for WT:Update, since you are only interested in some, but not all, guideline changes. I thought I would be able to do it last weekend, but it will be another few days. Until then, I have set the scripts to only post to WT:Update about policy changes.
2240:
You and the others in the math department (as recently exemplified by "Pohma" and his attitude) should be ashamed of yourselves. Writing for WP is full of nuance, but you guys think in black and white. So I am always just wrong wrong wrong. I'm never just a little bit off. It always gets personal too
1960:
Wait; all I did was add them to the list of things that are marked as "policies". If you want to track pages that are moved from one of the subcats to another, that's a separate issue. I would have to write new code to do that, and it seems like a pain. Maybe you could just look at when each page was
1439:
Somebody did point out an analogy with obfuscated C programs as not being that useful at the end of the paper. Probably a better analogy would have been Tarski's quest for minimal axiomatization, e.g. his axiom of an abelian group is not what you'd think of simple, even though it's the shortest by an
807:
I am afraid the A-class process is somewhat defunct at the moment; once the academic year has started in
September I want to propose something more lightweight. I would be glad to read through the article and the previous review and let you know if I see any issues in the present version. Please give
622:
I am afraid the A-class process is somewhat defunct at the moment; once the academic year has started in
September I want to propose something more lightweight. I would be glad to read through the article and the previous review and let you know if I see any issues in the present version. Please give
564:
Yes, that should be fine. The switchover should entail editing the PR header so that new peer review pages link to the toolserver app, and then disabling the SAPR task from PeerReviewBot. Actually the bot task can be disabled a day or two later; as long as you don't create any more SAPRs on the wiki,
4421:
One thing that may be confusing at first is that the literature uses "PRA" both to mean a quantifier-free theory and also to mean a theory that does have quantifiers but where the induction scheme is restricted to quantifier-free formulas. These are basically the same, but it is much more convenient
2636:
The general "Boolean satisfiability problem" is for arbitrary formulas. However, a special case of the problem is for formulas in conjunctive normal form with at most three literals per clause. That problem, known as 3SAT, is already NP-complete. Since the general satisfiability problem is in NP for
2361:
One can argue that we do not need a formalized set theory, such as ZFC, in order to study ZFC. We leave our metatheory informal, and attempt to only use arguments in the metatheory that are clearly correct. This is often called the "Platonist" approach to set theory, and it is probably what
Aaronson
2220:
I am quite sick and tired of this, and I have every right to be angry because it involves deletion, not incorporation. PLEASE BE CORRECTED: COVERAGE OF METALOGIC IS NOT POV. It is a legitimate academic field of study, just like so called "formal language theory." Show some interdisciplinary respect.
2210:
Again, you are trying to wrongly characterize me, so should back that statement up or take it back. The lead of the new article contains no error that I am aware of, and your statement has still not revealed one either. I did read and consider your input on metatheorem, and yes the language needs to
2174:
It does seem to me that the new article exists primarily to present your own POV on the subject, rather than the broad consensus viewpoint that is shared by the vast majority of the literature. The lede of the new article also contains your characteristic type of erroneous statements. If you did not
1830:
Who said, that the sources about
Chalupka is a newspaper article? You really do not have a clue what are you talking about. If you think that the source is wrong. Prove it or leave it!. My request was a referral to the person who removed the article. Therefore, I consider our discussions ended. Have
5886:
patronising. But I am not here to give you my CV, just to help. I worked for a company for about eight years doing object oriented databases, not pretend ones flattening it to SQL or whatever, so am well on the ins and outs of relational theory, if you care for that kind of thing. It sounds like a
5817:
Yes, I was aware of that. I must have misread your comment; I thought you said you have disabled the GFs again until the other issues were worked out. But, like I said, I'm not going to pre-emptively re-block the bot based on a misreading. If the bot has more problematic edits, I'll point them out.
5745:
The devs have kindly made a modification to not apply naming to articles that don't use it. So this is a moot point now - although the main objection seemed to be that numbers could go down as well as up. The sticking point it over the situation where is changed to . Numbers it seems can go down
3742:
The problem is that the proofs you add are not actually clear, although you believe they are. I could rephrase them to use standard terminology and be clear, but that's besides the point, since I could do that to essentially any proof text even if it had more serious flaws than just poor writing. I
2375:
The formalist approach is not generally considered a fruitful way to investigate mathematics, and so most mathematicians use the
Platonist approach when writing. This is because mathematicians tend to think in a semantical way, rather than a syntactical way. But we all know that, if we cared to, we
2200:
So you don't know what POV means or you are just willing to just throw any accusation out there. I mean it Carl. I think I may have to make a bigger deal out of this because in reality you are being POV not me. My interest is coverage of material that has passed academic muster, and Hunter has. The
383:
The problem is that the proofs you add are not actually clear, although you believe they are. I could rephrase them to use standard terminology and be clear, but that's besides the point, since I could do that to essentially any proof text even if it had more serious flaws than just poor writing. I
5469:
Well, the first one defines even using another concept possibly obscure if you don't know what being a multiple of 2 is. Not everyone knows math. Just by chance in that very same course a guy proving that a number was divisible by 9 withing a proof by induction stated that 9(a/3) was multiple of 9
3606:
While you see your proof of the incompleteness theorem as self-contained, I see it it as incomplete, since it does not prove the key aspects of arithmetization that it uses. This makes it a proof sketch, like the one with that title in the article. Also, none of the proofs we are talking about use
892:
Sounds reasonable. Per the A-class requirements, they are not as stringent as FA, and, interestingly, they are somewhat different than GA (A-class articles that have passed Ga are supposed to be nominated for FA - GA relates more to polish, A relates more to math content). I think I will open an A
827:
I think that recent nominations for A-class review did not get the sort of thorough review we had in mind when the system was put in place; this makes everyone reluctant to close the discussion and say the article is promoted, so it drags out indefinitely. However, you could always open the review
707:
Sounds reasonable. Per the A-class requirements, they are not as stringent as FA, and, interestingly, they are somewhat different than GA (A-class articles that have passed Ga are supposed to be nominated for FA - GA relates more to polish, A relates more to math content). I think I will open an A
642:
I think that recent nominations for A-class review did not get the sort of thorough review we had in mind when the system was put in place; this makes everyone reluctant to close the discussion and say the article is promoted, so it drags out indefinitely. However, you could always open the review
543:
Thanks. I am fine with switching to a link to the toolserver in the peer reviews. I assume it would be article specific (so the article on Foo would link to the SAPR for Foo) and that it would appear as soon as the PR was listed. I have asked about this at the PR talk page just to make sure no one
247:
While you see your proof of the incompleteness theorem as self-contained, I see it it as incomplete, since it does not prove the key aspects of arithmetization that it uses. This makes it a proof sketch, like the one with that title in the article. Also, none of the proofs we are talking about use
5620:
was just a variant of Kleene's hyperarithmetical hierarchy." Since
Addison invented the effective Borel hierarchy in the first place, I'll take his word for it being "just a variant". :-) But that doesn't answer my question, so I asked on the sci.math.research newsgroup, we'll see if someone can
5181:
The article has quite a few inline citations in
Harvard reference (author and year) form. Not as many as are the fashion here on the English Knowledge, but just about what would be considered the ideal density on the German Knowledge. (There I once had to reduce the footnote density of an article
3270:
I don't think it's necessary, because the format of the page the bot creates is straightforward enough that people could edit it manually in a pinch. Also, the most common causes of failure (in my experience) are changes to mediawiki itself and network/toolserver failures. It isn't obvious that a
2250:
I still have a lot of respect for you, but you need to actually point out an actual false sentence in that article before accusing me of "characteristic type of erroneous statements." That is an insulting, arrogant, and inappropriate statement Carl. It is the product of a narrow view. If no false
1810:
In order to recreate the article, you need to locate additional secondary sources that give significant coverage to
Chalupka. These could be biographies, articles directly about Chalupka, etc. The source that we have so far is a newspaper article that spends one paragraph on Chalupka; this is not
1214:
So I removed the instructions on how to place a hangon tag, pointed out the page had been deleted, and also pointed out that we discourage users from making their own biographies. I did this in a brief, clear way, so that the user could very quickly see what they need to do, which is avoid making
2051:
The
Wolfram institute accepted a proof that the 2,3 machine is universal and awarded the corresponding prize (ref). Some researchers have argued the proof is flawed (ref). The proof uses a new definition of "universality", in which the initial tape configuration is not finite. For an overview of
877:
The process started off well, with 7 nominations and 4 promotions in 2007. But then there was only one nomination in 2008, which died before it could really come to closure. There have been 3 nominations in 2009 but 2 were just reviews of articles that are already A-class, and the third (maximum
845:
I guess the problem is that in our project we simply don't have the critical mass for a review system that spreads over individual pages. Not enough people watchlist them. The German Knowledge has the same problem for FA and GA reviews, so they have one page for all FA reviews and one for all GA
692:
The process started off well, with 7 nominations and 4 promotions in 2007. But then there was only one nomination in 2008, which died before it could really come to closure. There have been 3 nominations in 2009 but 2 were just reviews of articles that are already A-class, and the third (maximum
660:
I guess the problem is that in our project we simply don't have the critical mass for a review system that spreads over individual pages. Not enough people watchlist them. The German Knowledge has the same problem for FA and GA reviews, so they have one page for all FA reviews and one for all GA
5365:
When you are first learning set theory, my advice is to learn the set theory first, and worry about the philosophical issues once you have a good feeling for the technical details. Also, some form of realism is the most common position among set theorists today, so even if you find it a strange
2354:
This is a well-understood topic within the mathematical logic community, but it is often raised in a confusing way by people who from other areas (popularizations are the worst, of course). The question is: how can one study set theory using the tools of mathematical logic, when those tools are
1551:
Those pages had image descriptions, but no images. Even now, when I look at the page where I could undelete them, there is no "file history" – no deleted version of the image that could be restored. There is only history of the text of the image description page. This is most likely because the
6094:
The WP 1.0 bot is going well and moving forward. I am working today on making the new system upload tables to the wiki, which I think is the last feature that is absolutely required to roll over to the new system after beta testing. There are still quite a few new feature requests that will be
2230:
It is a key point of understanding to realize that these are ideas we are talking about and the marks on the page are tokens of ideas. This is because this understanding is required to have an accurate, precise definition. To neglect these points isn't sparing the reader from irrelevance. It's
1783:
Rev. Franciszek Chalupka founded St. Joseph Basilica in Webster in 1887, the first Polish American parish in New England. He later went on to found a number of other Polish American parishes including St. Stanislaus Basilica in Chicopee, Masss. in 1891 and Our Lady of Czestochowa Church in
1387:
is: find finitistic proofs that the infinitary methods of mathematics are consistent. Our article on Hilbert's program is, unfortunately, very brief. In the context of finitism, the benefit of primitive recursive functions is that it is extremely easy to prove that each one is actually a total
862:
1) I wasn't even aware it exists, even though it's on my watchlist. 2) It's not the kind of page that appears on your watchlist at least once every 30 minutes. And if it did, it would still not make you notice if an article on a topic you don't care much about has issues related to a style or
677:
1) I wasn't even aware it exists, even though it's on my watchlist. 2) It's not the kind of page that appears on your watchlist at least once every 30 minutes. And if it did, it would still not make you notice if an article on a topic you don't care much about has issues related to a style or
5918:
As your logicians head on you might be interested in OO databases we did, basically we threw out bertie russell and said "a class IS a class", classified class as itself and then you build up not just class hierarchies, but levels of hierarchies, and it is incredibly powerful from three basic
1996:
is probably the most informative post in that thread w.r.t. small Turing machines— the paper given there should be used for writing about small machines because it clearly states what model of universality is used for each machine. If I understand this correctly, it's not known if the weaker
1370:). ¶ One might think that these two processes, substitution and recursion, would have to be supplemented with other elementary methods of definition . . . ¶ It turns out, however, that any such definition can be represented as a special case of the use of substitutions and recursions.
2605:" is: given a propositional formula, return "yes" if there is an assignment that satisfies it, "no" otherwise. This was the first problem to be proven to be NP-complete. You are missing a logarithm in your mental calculations somehow. In general there are 2 truth assignments for
3557:
OK, I have set up a different script for WT:Update that is only meant to post about the categories listed above. I will try to follow it for a while to see if it makes any errors, but also please let me know if it does so I can fix it. It should run starting tomorrow. — Carl
2557:. In short: Gregbard created a logic-stubs category, and I didn't really care, so I moved some of the more "general logic" articles out of the mathematical-logic-stubs category into the logic-stubs category. They could be marked as both types of stubs, if you prefer. — Carl
3921:
I know there are two citations in the article on the incompleteness theorems. If I remember correctly, Smoryński gives the usual syntactic proofs and discusses how they can be formalized into PRA, while Kukuchi and Tanaka discuss how the semantic proof can be formalized in
2885:
The problem was that they switched the toolserver webserver to a different computer a while back, which did not have all the libraries I need installed. I had already installed them for some other scripts, but I didn't realize this one had broken too. It works now. — Carl
5260:
Shoving in, sorry-- I put this on the ANI but wanted to mention it to you personally since it at least looks like rather dubious evidence. Not a coding master (or apprentice past about 2003) I will claim ignorance as a defense if this is pointless, but of possible note,
1905:
1409:
Because ZFC is consistent, this definition yields a total computable function. However, because of Gödel's second incompleteness theorem, ZFC cannot prove that this is a definition of a total function. Such issues cannot arise with primitive recursive functions. — Carl
5746:
as we as up in that circumstance, in case the ordering was deliberate and important. The fact that there is no case where it has been shown to be deliberate or important in all the hundreds of articles that have had this fix applied is enough reason to allow the fix.
5470:
but never checked if a/3 was integer. So, not even the second statement is quite formal since we should say that m is integer. I understand your point but it does make a difference for those not familiar with the topic. Thanks for fixing it. I think it is fine now.
4934:
OK, but I don't plan to police the discussion or to revert if anyone moves it back to the village pump. I have been trying to stay out of the discussion, since I am also involved as an administrator with a bot that was implementing this change automatically. — Carl
2581:
Truth tables are a relatively minor topic in math logic these days. So from that perspective, the only thing that I wish was in the article is the fact that truth tables can be used to decide the satisfiability problem for formulas in propositional logic. — Carl
893:
discussion again now that a few people have chimed in here, and we'll see what happens. If nothing happens after a week or so, I guess it should be closed and I'll consider running the FA gauntlet. Thanks again, Carl, Hans, and everyone, for your suggestions. --
708:
discussion again now that a few people have chimed in here, and we'll see what happens. If nothing happens after a week or so, I guess it should be closed and I'll consider running the FA gauntlet. Thanks again, Carl, Hans, and everyone, for your suggestions. --
5029:
Halting problem is really a computability theory article, so I wouldn't object it being classified under foundations. Complexity theory, on the other hand, I feel should be discrete math. But as you said, multiple categories will solve this problem soon enough.
2221:
If you don't want it in "your" articles, then you had better be prepared to see it moved elsewhere without this attitude. If you are still under the impression that it is POV, then I will have to take the issue to a broader audience including non-mathematicians.
1592:
I think I can only give you svn access if you have a toolserver account. If you don't, you can send me a patch by email, and I will be glad to apply it. Either way I will add you to the list of authors if you tell me how you would like to be attributed. — Carl
5418:
Feel free to continue editing, of course. The old paragraph had two problems. First, the initial clause was ungrammatical. Second, the article gave the same definition twice but called it "formal" the second time. That is, the old text was parallel to this:
2021:
nicely summarizes the mathematical and social issues surrounding this "proof", in particular that the definition of universality was whatever the "committee" wanted it to be, and the academic referees weren't really asked for their opinion. I think both
3628:
Yes, yes, but if you allow pseudo-code in proofs, then it is a simple matter to present injury priority arguments in readily understandable ways. But there needs to be consensus that pseudo-code is OK when it is a simple translation of recursion-theory
2080:
also requires that), but in the 2-3 case, the initial configuration is also aperiodic. Infinite but periodic initial conditions seem acceptable as long as one clearly makes the distinction because the relaxed definition allows for smaller machines (see
1486:
269:
Yes, yes, but if you allow pseudo-code in proofs, then it is a simple matter to present injury priority arguments in readily understandable ways. But there needs to be consensus that pseudo-code is OK when it is a simple translation of recursion-theory
3464:
and therefore pages in this category are counted as guidelines. They used to be just categorized as guidelines, I believe, until that category was split into a bunch of subcategories. Are you saying naming conventions should be considered as MOS pages
2461:
To get Richard's paradox, one has to not only use a metatheory and theory with overlapping vocabulary, one must also forget that the referent of a phrase in the metatheory may not be the same as the referent of a phrase in the theory itself. — Carl
1088:
I think it might be. In my opinion, "hiding" content, is always less desirable, even when it potentially might collide with other content or be "visually broken". It is not perfect, but i don't see a "perfect" solution to this problem to be honest.
2201:
reason I use it, is that is the best coverage I've seen of the material. You can deny, and disparage all you want, but that is the real product of your own POV. If it was not we'd be finding ways to edit and incorporate it, rather than destroy it.
4873:
4581:
tag is added). In any case, now that the checkuser page is fixed, the bot won't report it again unless it is removed from the policy category for some reason. We can just delete the announcement from when the categorization was fixed. — Carl
1699:
5371:
From a realist point of view, the terms "every set that could exist" and "every set that does exist" mean the same thing. When realists say "all sets" without qualification, this is what they mean. Or, actually, they mean "all sets in the
5161:
You could change the rating yourself if you think it's not correct, but I would simply ignore it. The philosophy project is free to assess the article however they like. There are numerous inline citations in the article, of course. — Carl
2707:
5094:
4110:
1466:) is kind of lame. I do remember some other article arguing that ZFC was close to optimal in some sense. But the guy who wrote that article Pcap cites claims to be a platonist, so he ought to know that "true" logic is infinitary... ;-)
4478:
2697:
2665:
4982:. It says that the field covers "combinatorics, algorithms and theoretical computer science." Moreover, the articles on complexity theory, theoretical computer science, P verses NP, etc. are all listed on that page. Also, for instance
3106:
2529:
3836:
3821:
3816:
3422:
2343:
for axioms? This is the kind of paradox that I think vanishes once we give up the idea of putting mathematics on a ‘more secure foundation,’ and see formal systems as just codifying forms of reasoning we’ve already accepted as valid.
4923:
4908:
3851:
886:
The discussion is conducted on the talk page of the article, with an announcement posted at WT:WPM. Any three editors agreeing is enough for the article to be promoted to A-class, provided there are no significant objections to the
701:
The discussion is conducted on the talk page of the article, with an announcement posted at WT:WPM. Any three editors agreeing is enough for the article to be promoted to A-class, provided there are no significant objections to the
477:
6088:
I'm going to be traveling all of the coming week, and during the first part especially I will have very limited internet access. So I won't be able to make the meeting Tuesday. However, please keep me informed of the decisions you
4473:
3412:
462:
457:
2717:
492:
2692:
1525:
2365:
One can argue in favor of formalism, in which we do not study models at all, only provability. In this setting, one does not need set theory to define a "formal language" as a "set"; one can study countable formal languages in
2355:
themselves formalized in set theory? Or: how can one study logic using set theory, when set theory itself is defined using logic? There is too much to say about that to fit into this comment. But here are some relevant points:
6152:
2722:
1773:
1329:
The categories look reasonable. Many of the references are to mainstream, respectable mathematical logic journals, so I think the issue is just that the article here is written in a vague, somewhat promotional manner. — Carl
6059:
So the pages will be added to the categories whenever they are edited (even a null edit), or when the job queue entries to update them are run. It may be several days before the job queue entries all make it through. — Carl
5564:
Yeah, I noticed that exercise, but I wasn't able to make use of the hint. :-( Anyway, you can leave "closely related" as it stands; and I can even provide a "reference" of some kind, even though it's far from satisfactory:
3846:
3831:
544:
can think of any problems with the idea. I would make a notice in the link that they should not paste the SAPR into the Peer review (since that messes up transclusion). WOuld a target switchover of August 1 be OK with you?
487:
2105:
elaboration of that argument points out that such an initialization may be equivalent to adding a counter to the machine. Such detailed, and not entirely settled, discussions don't really belong in general articles like
1552:
images were both deleted in 2005, as the deletion logs show. At that time, image deletion was not reversible. So, when the image description pages were undeleted in 2007, the images themselves were already lost. — Carl
939:
I have been slowly working on it this week, and finished this afternoon. The following revision IDs should be used instead of the ones selected before. Of course I might have missed something – manual review is only so
913:; I didn't know that this was going on. Part of the problem may be that few of us have serious knowledge of any given area of mathematics; we all know our own, and are reluctant to offer technical criticism outside it.
734:
I have been slowly working on it this week, and finished this afternoon. The following revision IDs should be used instead of the ones selected before. Of course I might have missed something – manual review is only so
472:
5011:
to be classified under "discrete mathematics" rather than under recursion theory. In the next WP 1.0 bot it will be possible to have an article in multiple categories, which will solve the problem soon enough. — Carl
4605:
3856:
3806:
4570:
I realize this sounds somewhat legalistic, but the entire point of the bot is to watch which pages are literally "marked as policies" by being placed into the corresponding category (which will always happen if the
3432:
2163:
1447:
would be a really good example why the simplest axiomatization in some metric isn't the most convenient to work with. It took some 60 years and an automated theorem prover to even show that it is a Boolean algebra.
5135:
2241:--having to do with what "type"of person I am, etcetera. It's getting old Carl. It's oversimplification. It's ideological thinking. I'm sorry Carl, but I am the mature adult in the room here. Cut this nonsense out.
5675:
a few days ago; several other people there objected to the idea that bots should automatically implement "named references". WP:CITE says, "Optionally, one may add the name attribute by using <ref name="name":
3811:
3014:
2660:
1481:
497:
447:
4853:
1535:
5874:
4893:
4468:
1428:
452:
3780:
I am getting more used to it, but it is still a headache. There are many cases of priority arguments where the algorithm is still opaque to me, even after close reading. Usually I can reconstruct it, but not
421:
I am getting more used to it, but it is still a headache. There are many cases of priority arguments where the algorithm is still opaque to me, even after close reading. Usually I can reconstruct it, but not
2655:
166:
3417:
2935:
With the list articles, do people want to be able to include them in both the subject-area section of peer review, and the lists section? That might use up the postinclude size in a nonoptimal way. — Carl
2534:
1530:
1805:
The article was deleted because it did not appear, based on its contents, that Chalupka has been the subject of significant coverage. I made some attempt to find additional sources, but I didn't find any.
5939:
3427:
3019:
2524:
1611:
1238:
1211:
So I deleted the page. At that point, lengthy descriptions of how to put a hangon tag on the page were no longer of much use to the user. Moreover, in light of #4, they were likely to just be confusing.
4413:
3935:
the incompleteness theorems in PRA. Once that is done, the fact that they are provable in PRA comes by just mimicking the standard proofs within PRA. To see one way how things can be represented, let
3530:
OK, I will implement that. The style guidelines are excluded from the "guideline" code, and are tracked separately as "MOS pages". I removed the style guidelines from WT:Update some time back. — Carl
2490:
I mentioned Finnell's name only because I broke up the discussion and so it was not clear that I was replying to him. Of course everyone is free to not respond to comments whenever they like. — Carl
2395:
P.S. There is also a great deal of skepticism about claims that P=NP is independent, since such claims seem to rely on analogies rather than deductions. Here are some typical posts from the FOM list
4898:
2752:
I will see to it that the policy changes are listed there. I think I may have added only the MOS changes by mistake. I am traveling for a couple days, so the problem could reoccur tomorrow. — Carl
1138:
2057:
As long as nobody is going to get confused, we don't need to go out of our way to put down Wolfram in the article on Church's thesis. I don't know how the articles directly on Wolfram are. — Carl
1570:
2048:
The Wolfram group is somewhat embarrassing, but at least we don't have intelligent design to deal with like the biologists do. The safest thing is to hedge in article and be scrupulously clear:
4953:
2539:
2358:
For many purposes, one can simply declare that the metatheory in use is ZFC. This is reasonable (that is, non-circular) for the study of most areas of mathematics outside of mathematical logic.
2290:
The citation templates (citation and cite foo) create HTML anchors down in the references section. You can either look these up in the source of the page, or use the templates in the family of
1491:
5784:
I thought you said you had disabled GFs until AWB fixes the things that led to the block. If I misread, I'll still wait until I (or someone else) sees a bad edit before blocking again. — Carl
3867:
I fixed the lists issue. For the archive log, I just delete the old entries from time to time. They are still in the page history, and this is simpler than keeping a bunch of archives. — Carl
4903:
3096:
1433:
4212:
5225:
4979:
1800:
If a topic has received significant coverage in reliable secondary sources that are independent of the subject, it is presumed to satisfy the inclusion criteria for a stand-alone article.
4446:"First order logic with equality" is not a first order theory; perhaps it is a framework in which one can study first order theories. Some examples of first-order theories are given at
3492:
2628:
In complexity theory, the Boolean satisfiability problem (SAT) is a decision problem, whose instance is a Boolean expression written using only AND, OR, NOT, variables, and parentheses.
2005:
that he doesn't quite know how "universal" the 2,3 machine is; Vaughn Pratt couldn't help but lecture him on the basics of computability theory. The Wolfram definition of universality
1882:
1284:
4264:
4863:
1139:
4883:
3031:
5154:
4746:
1372:
The method of search for the recursions required is in essence equivalent to that reflection by which one recognizes that the procedure used for the given definition is finitary.
3402:
1723:
It could, but it doesn't at the moment. Policy pages are very rarely renamed, so it's probably easier to just remove the notices in the rare cases when they are renamed. — Carl
5189:
4878:
2855:
2712:
2137:
5236:
I think that Geometry guy beat me to it. In case you have trouble reaching me sometime, I have sent you an email with instructions on how you can do this without me. — Carl
2787:
1348:
5498:
Yes, I see what you mean. It's not my research area but I can rewrite it somewhat, and then I'll post to the math project to see if anyone else wants to work on it. — Carl
1151:
At some point it was disabled (probably mediawiki changed and I never fixed the script to follow). I fixed the script this evening and it should run once a day now. — Carl
4610:
3372:
1942:
They are (or were last time I checked), but I have to report on monthly changes to the subcats as well, and it's nice to catch changes as they happen. Thanks. - Dank (
5618:
5208:
Absolutely no need to feel silly! Some of the mathematics articles are a bit eccentric in this respect, so this is not the first time something like this has happened.
2001:
that he doesn't quite know. ("There is no doubt some nice theoretical computer science that can be done in tightening up all these notions.", yay!) Alex Smith himself
1694:
2093:
and other prime CS venues.) Although this is not made abundantly clear, Vaughn Pratt suggested that even though the initial configuration of the 2-3 machine does not
1710:
This is a false positive due to a page move, resulting in duplicate notices. Could the bot detect page moves, and make appropriate "policy page moved" notifications?
5536:
3841:
3826:
3407:
1540:
881:
I only count about 10 editors in the 2009 archive, with a lot of overlap. I think this is the more serious problem. The question is how to get more editors involved.
696:
I only count about 10 editors in the 2009 archive, with a lot of overlap. I think this is the more serious problem. The question is how to get more editors involved.
482:
5543:
reference for anything more precise. But maybe I should just remove that sentence, and leave the other link to hyperarithmetical sets lower in the article. — Carl
4515:
3712:
That is not true of any pages on Knowledge on technical or scientific matters. You are opposing a clear presentation of your own field. You cannot hope to succeed.
2211:
be looked at. However it is not as simple as you portray it either. (and this is irrelevant to the current discussion unless your aim is to attack my credibility).
1743:
537:
353:
That is not true of any pages on Knowledge on technical or scientific matters. You are opposing a clear presentation of your own field. You cannot hope to succeed.
3948:
1199:
The editor created an apparent test page, but the title of that page is the name given on the editor's user page, so perhaps it is an attempt to start a biography
945:
I'm going to be traveling on and off the next two weeks. I will have good internet access during that time, but not access to my home computer to do release work.
740:
I'm going to be traveling on and off the next two weeks. I will have good internet access during that time, but not access to my home computer to do release work.
4565:
template. Whenever that template is used, the appropriate category is added automatically, so the bot has the effect of also tracking when the template is added.
1910:
1704:
1289:
467:
181:
4815:
I don't have a source, but I believe the term predates them. I do think that, in most cases, it's just argot, which is why nobody bothers to define it. — Carl
3911:
4555:
template takes care of the categorization, but in this case a custom-written message is used instead, so this page was not (recently) already marked with the
2637:
the same reason that 3SAT is in NP, that means that the general satisfiability problem is also NP-complete. I edited the article to clarify this some. — Carl
5597:
2149:
2043:
1962:
1894:
1457:
6147:
3317:
1041:
Thanks very much - I also noticed that the hidden comment <!--semi-automated peer review placeholder -- please do not edit or delete this comment--: -->
6023:
Thanks for creating them. I see that the talk page I mentioned above has not yet shown up in the category to which it was added. Do you know why that is?
4489:
That was strange. I must have meant Bridges and Richman, but why did I get the name and year wrong? I'll see if I can look up a page number later. — Carl
5983:
I'm going to create them later today, I just haven't gotten to it yet. It will be a while before the categories are fully populated, in any case. — Carl
5951:
3101:
193:
It is not a date submitted issue that I can see - some submitted recently have been listed both places, some have not. I checked as far back as July 19.
4993:
is the P = NP problem. I believe that most people associate complexity theory with combinatorics and discrete math, rather than logic and set theory. --
1475:
2554:
1145:
5658:
5209:
5183:
864:
847:
679:
662:
1811:
considered "significant coverage" for our purposes. At the moment, I have not found any source that even gives the year of Chalupka's birth. — Carl
1788:
Please remember that I did not delete the article; I am simply trying to explain the policies that Knowledge uses to decide when to delete articles.
1232:
5591:
1294:
2274:
1017:
I forgot to "Notify Carl (CBM) that the current month's category needs to be listed, but the category from two month's ago has been stabilized. "
5756:
2918:
That should not cause my toolserver program to crash, though. I ran it by hand from the command line on the webserver to see what the error was.
1849:
The information in the reference that was in the article did not give very many details, which is why I asked you earlier if the source was the
5944:
2414:
1778:
186:
5215:
5203:
4847:
2362:
alludes to. If one already has a good idea what sets are, one can view ZFC as simply giving a set of axioms for studying reasoning about sets.
5959:
About getting lists of articles, I don't mind doing it at all, although sometimes I may need a day or two depending on how busy I am. — Carl
5913:
really pushed the boundaries of the art and were considered for patent, but it is such an onerous process for software it is rarely worth it.
5531:
2876:
2728:
You might want to add an exception for page moves like this... I removed the identical notices from VPP and came here to comment on them. --
2569:
2388:
2320:
2306:
2127:
2069:
1832:
1767:
1684:
1663:
1646:
1342:
1261:
1132:
5725:
As far as that goes I simply turned off GFs until the devs changed the naming behaviour, with the exception of 376 edits you are aware of.
1514:
1205:
It is a well known that we tend to overwhelm new users with multiple lengthy messages, full of dozens of links. The usual response is TL:DR.
4708:(provided we understand that when the witness is a number rather than a person, a witness only testifies to what is true)." (B B J 2000:81)
3251:
Thanks for your helpful comments. Should I read from them that you don't believe it is necessary to have a back-up bot operation in place?
2904:
1840:
870:
5933:
5830:
5811:
5796:
5774:
5735:
5694:
5329:
3396:
3311:
3049:
2737:
2013:: "my third submission was accepted on the basis that I'd demonstrated universality to an extent sufficient for whoever was judging it." (
1057:
1032:
559:
522:
208:
5971:
5801:
Rjwilmsi set the General Fixes not to name references unless the article already had references. I had thought you were aware of that.
5523:
5510:
5406:
4858:
4615:
3448:
1545:
685:
5145:
is only a c because it lacks inline citations. I am certain that the lack of references is the article's biggest problem at the moment.
3600:
4534:
4519:
4501:
3283:
3257:
3242:
2976:
2959:
2948:
2913:
2898:
2115:
853:
5482:
5458:
3334:
1714:
5069:
3214:
3183:
2849:
2812:
2685:
2516:
2502:
962:
922:
668:
176:
171:
6072:
6032:
6014:
5995:
5716:
5248:
5002:
4594:
3903:
3879:
3790:
3755:
3721:
3695:
3670:
3638:
3619:
3086:
3066:
2996:
902:
840:
820:
601:
577:
241:
233:
6116:
5887:
job for a reduced table set, but I will check out what you are trying to achieve. We won't just get it right, we'll get it written.
5630:
5555:
5174:
4827:
4808:
4434:
3661:. Both of these are only presented in the most vague generalities right now. But I am discouraged by the ruckus on Godel's theorem.
2649:
2621:
2594:
2474:
2448:
2284:
2260:
2191:
1605:
1564:
1422:
1315:
757:
302:. Both of these are only presented in the most vague generalities right now. But I am discouraged by the ruckus on Godel's theorem.
134:
120:
4947:
3362:
2631:
The Boolean satisfiability problem considers formulae that are conjunctions of clauses (i.e. formulae in conjunctive normal form).
717:
655:
635:
431:
396:
362:
336:
311:
279:
260:
6141:
5300:
5039:
5024:
2743:
1865:
1823:
1404:
itself is the Gödel number of a proof of 0=1 from the axioms of ZFC. If it is not, return 0. Otherwise, go into an infinite loop.
1177:
1163:
1042:
is still in the PR template - removing this would save some space I think. I will also let Geometry guy know about this, thanks,
5088:
3519:
1735:
1106:
1083:
5127:
5117:
4970:
3582:
3570:
3552:
3542:
3482:
3151:
3137:
2774:
2764:
1977:
1947:
1933:
5194:
I feel rather silly. I had simply taken a quick look for references at the bottom of the article. I changed the class to a b.
5882:
All you say I understand, this is just a quick reply. I will go through the links. A "background in software is enough" is a
5575:
4928:
4336:
3457:
3221:
1915:
1906:
Knowledge:Manual of Style (pronunciation)/IPA vs. other pronunciation symbols has been marked as part of the Manual of Style
6082:
5306:
4839:
1467:
1303:. The bot runs automatically, and it seems that after they recreated its files from a backup, it has started again. — Carl
801:
3444:
4483:
3743:
find it very surprising when you appear to claim that you cannot learn the usual terminology in recursion theory. — Carl
1279:
384:
find it very surprising when you appear to claim that you cannot learn the usual terminology in recursion theory. — Carl
5142:
2294:
to generate them automatically. Either way, you just need to get a link to that anchor into the inline citation. — Carl
108:
No problem, I'll see if I can get that script running over those revisions. I should be able to do it this week. — Carl
4511:
3437:
1243:
1071:
Do you think that it would be reasonable to add overflow: visible to the appropriate declaration in common.css? — Carl
616:
5366:
position at first it's good to get familiar with it, because it would not be the most popular viewpoint for no reason.
4462:
2097:
to require a Turing-complete machine to produce (i.e. truly universal), allowing non-periodic infinite config may be
1669:
5394:
When V means "all sets that really exist", it's tautologous that there is no way to add additional sets to V. — Carl
2819:
2484:
5954:, which is updated by a bot and probably up to date. The top part was created by hand is is probably not up to date.
1208:
You had substituted a CSD notice template on the page, and ClueBot had since then left a different template message.
2540:
1900:
1748:
5182:
considerably to get it accepted as a Good Article.) Are there any specific claims that you think need a citation?
3210:
3179:
4541:. The former category is just a meta-category to gather up all the related categories. This is why, for example,
4152:
5567:
Addison, John W. "Warsaw 1957: Memories of Mostowski". In Ehrenfeucht, A., Marek, V. W. and Srebrny, M. (ed.).
5099:
2867:
2702:
2602:
2367:
1987:
3461:
3348:
3054:
I can certainly set something up to detect these, but it will take me a couple days to accomplish it. — Carl
2376:
could recast all of our results into PRA, at the cost of obscuring the mathematical content somewhat. — Carl
1622:
5353:
5263:
4835:
4447:
4440:
3913:
3111:
2782:
2315:
2269:
2144:
2122:
2038:
1889:
1658:
1452:
4217:
3230:
I'm somewhat swamped today, but I should be able to look over it tomorrow and leave some comments. — Carl
1388:
function. This is in contrast to total recursive functions, some of which may be very hard to prove total.
5412:
4538:
2575:
2076:
The issue with the 2-3 machine is not (only) that the initial config is infinite (machines that simulate
2030:
need to be updated to reflect this. Probably some Wolfram-specific articles too. Should we take this to
1321:
1274:
1102:
142:
5842:
5704:
Rich when he said he had fixed everything. Some other editor drew my attention to the bad edits. — Carl
1202:
The page was tagged for speedy deletion, but I found it due to it being listed as a manual of style page
5977:
4868:
4542:
1921:
I added them to the list, but I think the policies are all in the main policy category as well. — Carl
1651:
1496:
1185:
218:
147:
38:
4716:
2678:
2671:
1487:
Knowledge:Manual of Style (France & French-related) has been marked as part of the Manual of Style
5806:
5769:
5751:
5730:
5653:
5274:
2953:
It's been set up as a separate topic, so list articles should be listed in their own section (only).
2291:
928:
5384:
It can mean "Every set that exists in the cumulative hierarchy", in the realist sense just described
4874:
Knowledge:WikiProject Swiss municipalities/Article title conventions has been marked as a guideline
4843:
2860:
2111:
2027:
1471:
1267:
94:
89:
84:
72:
67:
3926:, which suffices to show that its conclusion is provable in PRA, because of a conservation result.
3470:
Could you give me a list of what specific categories you'd like me to track for WT:Update? — Carl
2609:
variables, so any method that exhaustively tests all of them will run in exponential time. — Carl
2339:
How can we use axioms to define sets, if we need the concept of set even to say what we mean by a
6104:
has expressed interest in helping with the bot as well (see above), which is great news. — Carl
4600:
2312:
2266:
2141:
2119:
2035:
1886:
1655:
1449:
723:
59:
4978:
On Knowledge, the precedent seems to be to put complexity theory in Discrete. See, for instance
4301:
is a coded proof in the sense just described. Moreover, there is a primitive recursive function
582:
Thanks - I will mot make any more SAPRs after July 31. That way I will have the July number for
5442:
The second sentence there is not really "more formal" than the first. However, for the article
5254:
5199:
5150:
5076:
No problem. I am glad you and Bill are looking at the pages on Euler and Venn diagrams. — Carl
3547:
Thanks. Just to be clear, let's not track any of the guidelines, including MOS pages. - Dank (
3378:
Why have all those articles been considered reassessed when their talk pages have not changed?
3253:
3203:
3196:
3172:
3165:
2955:
2909:
2872:
2082:
1700:
Knowledge:Knowledge talk:Naming conventions/Draft policy rewrite has been marked as a guideline
1065:
5387:
When viewed from the interior of a model, V denotes the sets that are in that particular model
1301:
6122:
5869:
4918:
4105:{\displaystyle ((a_{0},t_{0}),(a_{1},t_{1}),\ldots ,(a_{k},t_{k}),p_{0},p_{1},\ldots ,p_{m})}
3117:
2745:
2014:
933:
728:
5603:
2102:
2098:
2094:
2018:
2010:
2006:
2002:
1997:
definitions of universal, such as those used by Wolfram, really are universal. Wolfram also
5803:
5766:
5748:
5727:
5650:
5638:
5373:
5212:
5186:
5095:
Knowledge:WikiProject Hawaii/Manual of Style has been marked as part of the Manual of Style
4479:
Knowledge:Naming conventions (categories)/Usage of American no longer marked as a guideline
2666:
Knowledge:WikiProject Video games/Article guidelines/Naming no longer marked as a guideline
2512:
2400:
2328:
1998:
1993:
1511:
918:
867:
850:
682:
665:
5052:
Carl I think it is me that Dagme is refering to. See my comments re my history section in
2708:
Knowledge:WikiProject Comics/Style guidance has been marked as part of the Manual of Style
2698:
Knowledge:WikiProject Comics/Style guidance has been marked as part of the Manual of Style
2398:
8:
6028:
5929:
5690:
5672:
5520:
4913:
3893:
3389:
3107:
Knowledge:WikiProject Belgium/Brussels naming conventions no longer marked as a guideline
3076:
3039:
3024:
2986:
2805:
2798:
2733:
1322:
1047:
1022:
591:
549:
512:
198:
102:
3423:
Knowledge:WikiProject Manual of Style is no longer marked as part of the Manual of Style
2530:
Knowledge:WikiProject Belgium/Brussels naming conventions has been marked as a guideline
2396:
5665:
5626:
5585:
5359:
5335:
5105:
I just added those to the list for WT:UPDATE (and to the regular list as well). — Carl
5065:
3190:
3159:
2547:
2444:
2256:
2133:
2101:(2nd to last paragraph) to make a smaller non-universal machine into an universal one;
1873:
1575:
1520:
1384:
1186:
1114:
910:
130:
4924:
Knowledge:WikiProject Music terminology has been marked as part of the Manual of Style
4909:
Knowledge:Discuss and draft graphical layout overhauls no longer marked as a guideline
1354:"Clearly, the elementary means that we have at our disposal for forming functions are
5572:
5195:
5146:
5007:
OK, feel free to move it back. I do feel, quite strongly, that it is absurd for e.g.
3861:
3786:
3717:
3666:
3634:
3330:
3116:
1011:
898:
713:
427:
358:
307:
275:
5288:. The second bug there is the main obstacle left to rolling out a beta test. — Carl
4474:
Knowledge:Centralized discussion/Macedonia/consensus no longer marked as a guideline
5473:
5443:
5311:
5230:
5035:
4998:
3837:
Knowledge:Arbitration Committee/CheckUser and Oversight has been marked as a policy
3822:
Knowledge:Arbitration Committee/CheckUser and Oversight has been marked as a policy
3817:
Knowledge:Naming conventions (settlements)/Counties no longer marked as a guideline
3413:
Knowledge:Manual of Style (Kosovo-related articles) no longer marked as a guideline
2792:
2176:
1836:
1617:
1268:
1173:
478:
Knowledge:Arbitration Committee/CheckUser and Oversight has been marked as a policy
463:
Knowledge:Arbitration Committee/CheckUser and Oversight has been marked as a policy
458:
Knowledge:Naming conventions (settlements)/Counties no longer marked as a guideline
4987:
3852:
Knowledge:WikiProject Music/MUSTARD has been marked as part of the Manual of Style
2718:
Knowledge:Naming conventions (royalty and nobility) has been marked as a guideline
493:
Knowledge:WikiProject Music/MUSTARD has been marked as part of the Manual of Style
5446:, I edited it just now to add some variables to the sentence in question. — Carl
5057:
5008:
4888:
4575:
4559:
4549:
3658:
3654:
2829:
2693:
Knowledge:WikiProject Comics/editorial guidelines no longer marked as a guideline
2508:
2432:
1797:, which is what the admin who deleted your article was applying. That policy is,
1526:
Knowledge:Knowledge talk:Naming conflict/Archive 2 has been marked as a guideline
1503:
1463:
1444:
1098:
914:
299:
295:
5644:
Of course if you were a Cambridge mathematician you might be more interested in
1744:
1502:
I'll also add the page moves to my list of bones to pick with the bot author. --
1441:
46:
If you wish to start a new discussion or revive an old one, please do so on the
6153:
Knowledge:Subject specific Notability Guidelines has been marked as a guideline
6101:
6024:
5925:
5864:
5686:
5123:
4960:
4527:
3889:
3578:
3548:
3515:
3380:
3147:
3072:
3035:
2982:
2770:
2729:
2723:
Knowledge:Naming conventions (names and titles) no longer marked as a guideline
2107:
2023:
1943:
1774:
Knowledge:Category:Knowledge content guidelines no longer marked as a guideline
1627:
1043:
1018:
587:
545:
508:
194:
154:
3683:
Any page like that would also need to follow the published literature. — Carl
2981:
Thanks to both of you - I agree lists as their own separate topic seems best.
324:
Any page like that would also need to follow the published literature. — Carl
167:
Knowledge:Peer review/List of World Heritage Sites in the Netherlands/archive1
6136:
6111:
6067:
6009:
5990:
5966:
5825:
5791:
5711:
5622:
5550:
5505:
5492:
5453:
5401:
5348:
5324:
5295:
5243:
5169:
5112:
5083:
5061:
5053:
5019:
4942:
4822:
4803:
4589:
4496:
4457:
4429:
3874:
3750:
3690:
3614:
3565:
3537:
3477:
3357:
3306:
3293:
3278:
3237:
3223:
3132:
3061:
2971:
2943:
2893:
2844:
2759:
2644:
2616:
2589:
2564:
2497:
2469:
2440:
2409:
2383:
2301:
2252:
2186:
2064:
2031:
1972:
1928:
1860:
1818:
1762:
1730:
1679:
1641:
1600:
1559:
1417:
1337:
1310:
1256:
1227:
1193:
I apologize if I offended you. Here is the analysis I made of the situation:
1158:
1127:
1078:
957:
835:
815:
752:
650:
630:
583:
572:
391:
331:
255:
228:
126:
115:
47:
17:
5376:", because these are the sets that contemporary set theory is interested in.
5285:
5281:
4422:
to work in the latter, because then not as much coding is necessary. — Carl
3847:
Knowledge:Deletion of articles on living persons has been marked as a policy
3832:
Knowledge:Deletion of articles on living persons has been marked as a policy
488:
Knowledge:Deletion of articles on living persons has been marked as a policy
473:
Knowledge:Deletion of articles on living persons has been marked as a policy
5685:
Thank you for the link. I have added my opinion to the discussion as well.
4782:
is inconsistent". In each case, the concept involved ("the computation of φ
4606:
Knowledge:Naming conventions (common names) no longer marked as a guideline
3782:
3713:
3662:
3630:
3326:
2179:
about the error you introduced there, you may want to check it out. — Carl
1006:
894:
709:
423:
354:
303:
271:
158:
3433:
Knowledge:Taxobox usage is no longer marked as part of the Manual of Style
2423:
Isn't this apparent paradox of attempting to describe a formalism in what
2164:
Knowledge:Naming conventions (broadcasting) has been marked as a guideline
5031:
4994:
3857:
Knowledge:Naming conventions (UK stations) has been marked as a guideline
3807:
Knowledge:Naming conventions (UK counties) has been marked as a guideline
3015:
Knowledge:Naming conventions (adjectives) no longer marked as a guideline
2661:
Knowledge:Naming conventions (video games) has been marked as a guideline
2168:
1965:, and then investigate the ones that are less than one month old? — Carl
1794:
1482:
Knowledge:Anarchism referencing guidelines has been marked as a guideline
1169:
611:
498:
Knowledge:Naming conventions (UK stations) has been marked as a guideline
448:
Knowledge:Naming conventions (UK counties) has been marked as a guideline
5851:
4854:
Knowledge:Naming conventions (precision) no longer marked as a guideline
1536:
Knowledge:Knowledge talk:Naming conflict no longer marked as a guideline
1358:(that is, replacement of an argument by a new variable or function) and
4983:
4894:
Knowledge:Naming conventions (precision) has been marked as a guideline
4469:
Knowledge:Naming conventions (Macedonia) has been marked as a guideline
3812:
Knowledge:WikiProject/Naming convention no longer marked as a guideline
2251:
sentence identified, you need to be able to admit it and take it back.
1874:
1711:
1429:
Knowledge:Knowledge talk:Naming conflict has been marked as a guideline
1196:
The editor was extremely inexperienced, having made fewer than 10 edits
1090:
532:
453:
Knowledge:WikiProject/Naming convention no longer marked as a guideline
2656:
Knowledge:WikiProject Numismatics/Style has been marked as a guideline
5422:
A number is even if it is a multiple of two. More formally, a number
4327:
is a coded proof whose conclusion is "0=1". Then the statement "Con(
3447:, which was to a transcluded template. You can find these edits with
3418:
Knowledge:WikiProject Aircraft/Naming no longer marked as a guideline
2535:
Knowledge:Naming conventions (Clergy) no longer marked as a guideline
1531:
Knowledge:How to write a plot summary no longer marked as a guideline
1362:(according to the schema of the derivation of the function value for
5940:
Knowledge:Colours is no longer marked as part of the Manual of Style
4980:
Knowledge:WikiProject_Mathematics/Wikipedia_1.0/Discrete_mathematics
3428:
Knowledge:Related is no longer marked as part of the Manual of Style
3020:
Knowledge:Naming conventions (verbs) no longer marked as a guideline
2525:
Knowledge:Naming conventions (clergy) has been marked as a guideline
1612:
Not sure about adding/removing some articles to recursion theory cat
6132:
6107:
6063:
6005:
5986:
5962:
5821:
5787:
5707:
5546:
5501:
5449:
5397:
5344:
5320:
5291:
5239:
5165:
5108:
5079:
5015:
4938:
4818:
4799:
4585:
4492:
4453:
4425:
3870:
3746:
3686:
3610:
3561:
3533:
3473:
3353:
3302:
3274:
3233:
3128:
3057:
2967:
2939:
2889:
2840:
2755:
2640:
2612:
2585:
2560:
2493:
2465:
2405:
2379:
2297:
2182:
2077:
2060:
1968:
1924:
1856:
1814:
1758:
1726:
1675:
1637:
1596:
1555:
1413:
1333:
1306:
1252:
1223:
1154:
1123:
1074:
953:
831:
811:
748:
646:
626:
568:
387:
327:
251:
224:
111:
4796:
is inconsistent") is defined via an existential statement. — Carl
2439:? (cf the proof and van Heijenoort's discussion p. 438-440)? Bill
4899:
Knowledge:Copying within Knowledge has been marked as a guideline
3495:, so perhaps it would be best if we just track the 5 policy cats:
2009:. Alex himself basically doesn't what definition of universality
1239:
Thanks for adding the example in Kleene's first recursion theorem
1140:
User:VeblenBot/C/Wikipedia featured topic candidate main articles
5519:
Thanks very much for your help there. It's well beyond me. :) --
2553:
I must have changed them back then because of the discussion at
1581:
Give me SVN access to that proj. & let me commit the changes
1571:
Since you understand (un)decidability and apparently perl too...
5645:
4954:
Orphaned non-free image (File:Computability in Europe logo.jpg)
4537:
are not "marked as policies"; that is the role of the category
1850:
1492:
Knowledge:Category deletion policy no longer marked as a policy
3071:
It is no rush at all - thanks as always for all of your help,
2837:
Thanks. I'm sure other people will also appreciate it. — Carl
5875:"Info about new WP 1.0 bot (additional developers wanted...)"
5136:"Goedel's incompleteness theorems" rated C by the philosphers
4904:
Invitation to participate in SecurePoll feedback and workshop
3097:
Knowledge:Volunteer response team has been marked as a policy
2136:
had some beef with the latter article as recent as 2009, see
1434:
Comparing various foundations of mathematics with bar charts!
5226:
Knowledge:Notability (events) has been marked as a guideline
3217:
at any time by removing the {{Talkback}} or {{Tb}} template.
3186:
at any time by removing the {{Talkback}} or {{Tb}} template.
2815:
at any time by removing the {{Talkback}} or {{Tb}} template.
2688:
at any time by removing the {{Talkback}} or {{Tb}} template.
1793:
Please let me try to explain one more time. Knowledge has a
1393:
For example, consider the function that does the following:
565:
the bot will not add links to any peer review pages. — Carl
5600:) There Addison writes: "The effective Borel hierarchy on
3271:
second bot would be more robust for those problems. — Carl
2090:
828:
with the expectation that it might not go anywhere. — Carl
643:
with the expectation that it might not go anywhere. — Carl
125:
Thanks! I can see the light at the end of the tunnel now!
1285:
Knowledge:Use common sense no longer marked as a guideline
507:
Thanks so much - I appreciate all of your help as always.
4864:
Knowledge:Naming conflict no longer marked as a guideline
1300:
There were grave problems with the toolserver today; see
1249:
I don't know; I am not very fluent in λ-calculus. — Carl
4884:
Knowledge:No page blanks no longer marked as a guideline
4408:{\displaystyle \forall n(F_{T}(n)=1\to G_{T}(n)\not =1)}
4545:
is in the former category, not the latter. Usually the
3403:
Knowledge:Revision deletion has been marked as a policy
3146:
Ah, okay, I didn't understand. Thanks kindly. - Dank (
2825:
One admin who requested not to be listed in these lists
182:
Knowledge:Peer review/1968 Illinois earthquake/archive2
5280:
That's great news. I have requested access for you in
4879:
Knowledge:Page blanking has been marked as a guideline
3943:. Define a "coded proof" to be a sequence of the form
3491:
More readers are interested in changes to policy than
2856:
Knowledge:Code of conduct no longer marked as a policy
2713:
Knowledge:Non-free content has been marked as a policy
5606:
4719:
4339:
4220:
4155:
3951:
2788:
Knowledge:Code of conduct has been marked as a policy
1349:
The finitary Hilbert and primitive recursion, a quote
5924:
I think it would be great to work on this together.
5896:
I can't say too much about what I do professionally.
1443:(can't seem to find it in an article here). Perhaps
586:(will use the archived number there in the future).
5952:
Knowledge:Pages needing attention/Mathematics/Lists
5381:The thing with "V" is that it can mean two things:
4611:
Knowledge:Talk page no longer marked as a guideline
3373:
Bot needs to be updated for WikiProject Biographies
1670:
Decision_problem#Equivalence_with_function_problems
5612:
4740:
4407:
4258:
4206:
4104:
2555:Knowledge:Stub_types_for_deletion/Log/2007/July/12
2052:several definitions of universality, see X (ref)."
1695:Knowledge:Edit warring has been marked as a policy
153:I have found the following peer reviews listed at
5764:Thanks for that, even though I don't understand.
5537:Lightface Borel vs. hyperarithmetical hierarchies
3408:Knowledge:Related no longer marked as a guideline
1541:Knowledge:Gravity no longer marked as a guideline
4834:The term is also used in computer science, e.g.
4214:is a formal proof all of whose axioms are among
3931:I think the hardest part is figuring out how to
2089:universality; Woods and Neary have published in
538:Bot request to further automate the SAPR process
3842:Knowledge:CheckUser has been marked as a policy
3827:Knowledge:CheckUser has been marked as a policy
3299:I wasn't offended; thanks for the note. — Carl
2964:I also think that is the best solution. — Carl
1911:Knowledge:Help desk has been marked as a policy
1705:Knowledge:Edit war no longer marked as a policy
1290:Offer to mediate in the Office Open XML article
483:Knowledge:CheckUser has been marked as a policy
468:Knowledge:CheckUser has been marked as a policy
2114:, but are probably okay in the article on the
187:Knowledge:Peer review/St. Johns River/archive1
4989:that one of the central unsolved problems of
4271:Note there is a primitive recursive function
1215:test pages that appear to be autobiographies.
217:I think it is fixed now. I left a comment at
6148:Knowledge:SNG has been marked as a guideline
5590:: CS1 maint: multiple names: editors list (
3318:Showing that a computer embeds in arithmetic
4207:{\displaystyle (p_{0},p_{1},\ldots ,p_{m})}
3102:Knowledge:OTRS no longer marked as a policy
808:me a day or two to get back to you. — Carl
623:me a day or two to get back to you. — Carl
5569:Andrzej Mostowski and Foundational Studies
4764:be a computation history witnessing that φ
4760:) is true. For example, we might say "let
4697:may be called a 'witness' to the relation
4535:Category:Knowledge policies and guidelines
4331:)" is represented by this formula of PRA:
1146:VeblenBot and policy guideline tag changes
4836:NP_(complexity)#Verifier-based_definition
4778:be a proof of 0=1 witnessing that theory
4134:is a computation sequence verifying that
2903:Interesting: I fixed a different problem
2116:Wolfram's 2-state 3-symbol Turing machine
1002:Uniform_Resource_Locator 260836131
987:Geography_of_the_United_States 257653908
797:Uniform_Resource_Locator 260836131
782:Geography_of_the_United_States 257653908
177:Knowledge:Peer review/99p Stores/archive1
172:Knowledge:Peer review/Pavel Bure/archive1
2427:to be the language of the formalism the
1295:VeblenBot/SPERtable updates have stopped
863:structure problem you care a lot about.
678:structure problem you care a lot about.
6002:They should all be created now. — Carl
4713:A witness for an existential statement
14:
5945:Mathematics articles needing attention
5341:I responded on your talk page. — Carl
4627:(positively) recursively semidecidable
3202:Hello, CBM. You have new messages at
3171:Hello, CBM. You have new messages at
2804:Hello, CBM. You have new messages at
2677:Hello, CBM. You have new messages at
1779:Removal of Franciszek Chałupka article
1587:Not interested, I should just fork it.
44:Do not edit the contents of this page.
6095:possible with the new system as well.
5532:Building consensus on copyright issue
4641:by existential quantification, thus:
4259:{\displaystyle (a_{0},\ldots ,a_{k})}
3607:priority or injury arguments. — Carl
3458:Category:Knowledge naming conventions
2828:A bug in the bot that doesn't handle
2435:? Also Finsler's (1926) failed proof
878:spacing estimation) also petered out.
693:spacing estimation) also petered out.
248:priority or injury arguments. — Carl
5677:details of the citation</ref: -->
3649:By the way, I would like to write a
2332:
2265:I see a (topic) ban in your future.
290:By the way, I would like to write a
25:
5566:
4859:ArbCom Election RFC courtesy notice
4616:Definition of Witness (mathematics)
1546:Could you please explain further...
1120:I have seen others as well. — Carl
23:
5850:
4959:
4720:
4340:
3939:be a computable theory with index
3195:
3164:
2797:
2670:
2507:Thank you. That makes sense now.
1584:Have me email you the changed code
24:
6163:
4741:{\displaystyle \exists x\phi (x)}
3493:Category:General style guidelines
1374:" (boldface added Hilbert (1925)
975:Carlton_Football_Club 260909556
969:Alexandria,_Louisiana 257071494
770:Carlton_Football_Club 260909556
764:Alexandria,_Louisiana 257071494
2541:Category:Systems of formal logic
2437:Formal proofs and undecidability
2285:How is this citation trick done?
2034:first to get a wider consensus?
1749:Numbering (computability theory)
29:
5143:Gödel's incompleteness theorems
4621:"We define an n-place relation
1378:in van Heijenoort 1967:385-386)
5950:Most of that page consists of
4971:List of PPAD-complete problems
4735:
4729:
4633:, if it is obtainable from an
4402:
4393:
4387:
4374:
4365:
4359:
4346:
4253:
4221:
4201:
4156:
4143:is in the r.e. set with index
4099:
4051:
4025:
4013:
3987:
3981:
3955:
3952:
3601:I didn't mean to speak for you
2870:. I'm trying to find out why.
2868:Knowledge:Peer_reviews_by_date
2775:01:55, 29 September 2009 (UTC)
2765:00:50, 29 September 2009 (UTC)
2738:03:03, 29 September 2009 (UTC)
2650:21:34, 20 September 2009 (UTC)
2622:19:31, 20 September 2009 (UTC)
2603:Boolean satisfiability problem
2595:19:45, 19 September 2009 (UTC)
2570:13:00, 20 September 2009 (UTC)
2543:proposed to be merge somewhere
2517:12:24, 20 September 2009 (UTC)
2503:21:17, 18 September 2009 (UTC)
2475:21:20, 18 September 2009 (UTC)
2449:18:18, 18 September 2009 (UTC)
2415:17:40, 18 September 2009 (UTC)
2389:17:40, 18 September 2009 (UTC)
2368:primitive recursive arithmetic
2321:14:56, 18 September 2009 (UTC)
2307:13:48, 18 September 2009 (UTC)
2275:06:16, 18 September 2009 (UTC)
2261:05:36, 18 September 2009 (UTC)
2192:02:39, 18 September 2009 (UTC)
2150:21:11, 17 September 2009 (UTC)
2128:21:07, 17 September 2009 (UTC)
2070:11:45, 17 September 2009 (UTC)
2044:08:30, 17 September 2009 (UTC)
1978:00:55, 17 September 2009 (UTC)
1948:00:50, 17 September 2009 (UTC)
1934:22:12, 16 September 2009 (UTC)
1895:17:54, 14 September 2009 (UTC)
1866:20:19, 12 September 2009 (UTC)
1841:12:27, 12 September 2009 (UTC)
1824:11:29, 12 September 2009 (UTC)
1784:Turners Falls, Mass. in 1909.
1755:Sure, I'll look at it. — Carl
242:I didn't mean to speak for you
13:
1:
6142:23:17, 20 December 2009 (UTC)
6117:21:22, 20 December 2009 (UTC)
6073:20:13, 20 December 2009 (UTC)
6033:19:49, 20 December 2009 (UTC)
6015:19:27, 20 December 2009 (UTC)
5996:19:09, 20 December 2009 (UTC)
5972:12:39, 19 December 2009 (UTC)
5934:13:33, 18 December 2009 (UTC)
5831:12:14, 15 December 2009 (UTC)
5812:08:26, 15 December 2009 (UTC)
5797:01:09, 15 December 2009 (UTC)
5775:01:07, 15 December 2009 (UTC)
5757:23:26, 14 December 2009 (UTC)
5736:23:29, 14 December 2009 (UTC)
5717:23:23, 14 December 2009 (UTC)
5695:23:43, 14 December 2009 (UTC)
5659:16:26, 14 December 2009 (UTC)
5631:15:08, 14 December 2009 (UTC)
5556:14:27, 14 December 2009 (UTC)
5524:23:00, 11 December 2009 (UTC)
5511:22:52, 11 December 2009 (UTC)
5483:12:40, 10 December 2009 (UTC)
5459:12:12, 10 December 2009 (UTC)
5426:is even if there is a number
5307:RE: New Knowledge 1.0 system
5128:19:01, 30 November 2009 (UTC)
5118:18:09, 30 November 2009 (UTC)
5089:00:11, 23 November 2009 (UTC)
5070:23:22, 22 November 2009 (UTC)
5040:16:56, 22 November 2009 (UTC)
5025:16:21, 22 November 2009 (UTC)
5003:16:03, 22 November 2009 (UTC)
4948:17:55, 19 November 2009 (UTC)
4929:Parallel footnote discussions
3462:Category:Knowledge guidelines
1961:added to the category, using
1916:Policy subcats for VeblenBot?
1768:13:05, 8 September 2009 (UTC)
1736:13:05, 8 September 2009 (UTC)
1715:08:02, 8 September 2009 (UTC)
1685:10:00, 8 September 2009 (UTC)
1664:08:30, 8 September 2009 (UTC)
1647:01:10, 8 September 2009 (UTC)
1623:Counting problem (complexity)
1606:15:53, 6 September 2009 (UTC)
1565:02:49, 6 September 2009 (UTC)
1515:13:42, 3 September 2009 (UTC)
1476:22:47, 3 September 2009 (UTC)
1458:15:14, 1 September 2009 (UTC)
6083:Article selection discussion
5621:clarify things. Cheers! --
5407:02:42, 8 December 2009 (UTC)
5354:15:10, 7 December 2009 (UTC)
5330:21:05, 6 December 2009 (UTC)
5317:I unblocked the bot. — Carl
5301:18:43, 5 December 2009 (UTC)
5264:User:SmackBot/References Log
5249:00:56, 3 December 2009 (UTC)
5216:21:26, 1 December 2009 (UTC)
5204:21:08, 1 December 2009 (UTC)
5190:20:28, 1 December 2009 (UTC)
5175:21:02, 1 December 2009 (UTC)
5155:16:37, 1 December 2009 (UTC)
4848:07:11, 30 October 2009 (UTC)
4828:00:21, 29 October 2009 (UTC)
4809:17:38, 28 October 2009 (UTC)
4595:15:41, 26 October 2009 (UTC)
4520:16:44, 26 October 2009 (UTC)
4502:10:26, 26 October 2009 (UTC)
4463:00:46, 26 October 2009 (UTC)
4448:list of first-order theories
4435:12:52, 25 October 2009 (UTC)
3914:Primitive recursive function
3904:02:25, 25 October 2009 (UTC)
3880:12:03, 24 October 2009 (UTC)
3791:22:31, 23 October 2009 (UTC)
3756:01:48, 23 October 2009 (UTC)
3722:23:44, 22 October 2009 (UTC)
3696:22:47, 21 October 2009 (UTC)
3671:22:43, 21 October 2009 (UTC)
3639:21:47, 21 October 2009 (UTC)
3620:20:51, 21 October 2009 (UTC)
3583:03:11, 21 October 2009 (UTC)
3571:03:04, 21 October 2009 (UTC)
3553:02:57, 21 October 2009 (UTC)
3543:02:50, 21 October 2009 (UTC)
3520:02:47, 21 October 2009 (UTC)
3511:Knowledge enforcement policy
3483:02:22, 21 October 2009 (UTC)
3397:21:50, 18 October 2009 (UTC)
3363:00:53, 19 October 2009 (UTC)
3335:18:39, 18 October 2009 (UTC)
3284:13:13, 11 October 2009 (UTC)
3258:12:19, 11 October 2009 (UTC)
432:22:31, 23 October 2009 (UTC)
397:01:48, 23 October 2009 (UTC)
363:23:44, 22 October 2009 (UTC)
337:22:47, 21 October 2009 (UTC)
312:22:43, 21 October 2009 (UTC)
280:21:47, 21 October 2009 (UTC)
261:20:51, 21 October 2009 (UTC)
157:(sorted by date) but not at
7:
4838:where I just added a link.
4539:Category:Knowledge policies
4484:Computable number reference
3312:15:04, 9 October 2009 (UTC)
3243:01:06, 9 October 2009 (UTC)
3211:02:19, 8 October 2009 (UTC)
3180:01:50, 8 October 2009 (UTC)
3152:00:53, 8 October 2009 (UTC)
3138:00:50, 8 October 2009 (UTC)
3087:01:08, 6 October 2009 (UTC)
3067:00:59, 6 October 2009 (UTC)
3050:00:57, 6 October 2009 (UTC)
3034:I just found and archived.
2997:01:51, 5 October 2009 (UTC)
2977:01:29, 5 October 2009 (UTC)
2960:01:29, 5 October 2009 (UTC)
2949:01:21, 5 October 2009 (UTC)
2914:01:17, 5 October 2009 (UTC)
2899:00:25, 5 October 2009 (UTC)
2877:00:14, 5 October 2009 (UTC)
2850:13:24, 3 October 2009 (UTC)
1795:policy on article inclusion
1423:23:37, 30 August 2009 (UTC)
1343:23:41, 30 August 2009 (UTC)
1316:23:39, 24 August 2009 (UTC)
1280:Useless template ... or not
1262:04:31, 22 August 2009 (UTC)
1233:20:34, 20 August 2009 (UTC)
1178:09:25, 19 August 2009 (UTC)
1164:00:02, 19 August 2009 (UTC)
1133:11:02, 15 August 2009 (UTC)
10:
6168:
4637:-place recursive relation
4543:Knowledge:List of policies
3443:For the first one, it was
3438:Some oddities at WT:Update
2866:The culprit appears to be
2007:is not even clearly stated
1668:We mention it a little at
1244:By the way, you might know
1107:19:41, 7 August 2009 (UTC)
1084:17:42, 7 August 2009 (UTC)
1058:15:08, 5 August 2009 (UTC)
1033:11:56, 2 August 2009 (UTC)
923:20:02, 4 August 2009 (UTC)
802:Maximum spacing estimation
617:Maximum spacing estimation
219:Wikipedia_talk:Peer_review
5056:article at his talk page
4625:on natural numbers to be
3514:Knowledge policy - Dank (
3508:Knowledge deletion policy
2820:re: inactive admin counts
2485:Personal favor on WT: MoS
2292:Template:Harvard citation
1383:One executive summary of
993:Motocross 260870626
984:Film_producer 252804496
981:Cytoskeleton 260340380
978:Cucumber 260779941
972:Barnacle 253921506
963:19:21, 31 July 2009 (UTC)
903:15:25, 31 July 2009 (UTC)
871:21:45, 30 July 2009 (UTC)
854:18:01, 30 July 2009 (UTC)
841:03:04, 30 July 2009 (UTC)
821:13:23, 27 July 2009 (UTC)
788:Motocross 260870626
779:Film_producer 252804496
776:Cytoskeleton 260340380
773:Cucumber 260779941
767:Barnacle 253921506
758:19:21, 31 July 2009 (UTC)
718:15:25, 31 July 2009 (UTC)
686:21:45, 30 July 2009 (UTC)
669:18:01, 30 July 2009 (UTC)
656:03:04, 30 July 2009 (UTC)
636:13:23, 27 July 2009 (UTC)
602:23:42, 26 July 2009 (UTC)
578:22:14, 26 July 2009 (UTC)
560:20:55, 26 July 2009 (UTC)
523:16:50, 22 July 2009 (UTC)
234:16:05, 22 July 2009 (UTC)
209:15:55, 22 July 2009 (UTC)
135:17:46, 22 July 2009 (UTC)
121:22:09, 21 July 2009 (UTC)
3505:Knowledge content policy
3502:Knowledge conduct policy
3325:Are you happy with this?
2112:universal Turing machine
2028:universal Turing machine
2011:his (3rd) submission met
1901:Logic math and computing
909:It would help to notify
5613:{\displaystyle \omega }
4748:is some specific value
3577:Thanks kindly. - Dank (
3222:Proposed automation of
1851:Polish-American Journal
5855:
5671:This was discussed at
5614:
5100:Two new policy subcats
4965:
4792:) halts", "the theory
4742:
4409:
4260:
4208:
4106:
3200:
3169:
2802:
2744:Veblenbot request for
2703:A couple of 1.0 issues
2675:
1988:NKS, non-standard UTMs
5854:
5615:
4963:
4743:
4410:
4323:) = 1 if and only if
4297:) = 1 if and only if
4261:
4209:
4107:
3204:Skittleys's talk page
3199:
3173:Skittleys's talk page
3168:
2801:
2769:Thanks much. - Dank (
2674:
2085:where this is called
2015:proof by intimidation
42:of past discussions.
5604:
5374:cumulative hierarchy
4717:
4441:First-order theories
4337:
4218:
4153:
3949:
3460:is a subcategory of
3456:For the second one,
3112:Thanks for being you
2783:Peer review requests
5413:Assumes every value
5284:(now resolved) and
4533:Actually, pages in
2576:Truth Table article
1462:Meh, that article (
1323:Computability logic
1275:Algorithm footnotes
1168:Blimey, thank you.
143:Pedantic correction
5978:Category red-links
5856:
5610:
4986:says in his essay
4966:
4869:Logical connective
4738:
4405:
4280:such that for all
4256:
4204:
4102:
3215:remove this notice
3201:
3184:remove this notice
3170:
2813:remove this notice
2803:
2686:remove this notice
2679:Rjanag's talk page
2676:
2134:User:Vaughan Pratt
1497:Re: Move & Bot
1187:User talk:Brandy15
161:(sorted by topic):
148:PR listing problem
6140:
6115:
6071:
6013:
5994:
5970:
5862:
5861:
5829:
5795:
5715:
5598:Google books link
5577:978-1-58603-782-6
5554:
5509:
5481:
5457:
5405:
5352:
5328:
5299:
5275:WP 1.0 bot, again
5247:
5173:
5122:thx mch. - Dank (
5116:
5087:
5023:
4946:
4826:
4807:
4774:) halts" or "let
4593:
4500:
4461:
4433:
3912:Ref for claim in
3900:
3878:
3754:
3694:
3618:
3569:
3541:
3481:
3361:
3310:
3282:
3241:
3136:
3083:
3065:
3046:
2993:
2975:
2947:
2897:
2848:
2763:
2648:
2620:
2593:
2568:
2501:
2473:
2413:
2387:
2351:
2350:
2318:
2305:
2272:
2253:Pontiff Greg Bard
2190:
2147:
2125:
2068:
2041:
1976:
1932:
1892:
1881:I see there's an
1864:
1822:
1766:
1734:
1683:
1661:
1645:
1604:
1563:
1455:
1440:objective metric
1421:
1385:Hilbert's program
1366:+1 from that for
1341:
1314:
1260:
1231:
1176:
1162:
1131:
1082:
1054:
1029:
999:Swindon 260578526
996:Pear 259155615
990:Ghetto 204335950
961:
921:
839:
819:
794:Swindon 260578526
791:Pear 259155615
785:Ghetto 204335950
756:
654:
634:
598:
576:
556:
519:
395:
335:
259:
232:
205:
119:
100:
99:
54:
53:
48:current talk page
6159:
6130:
6105:
6061:
6003:
5984:
5960:
5847:
5846:
5843:Happy CBM's Day!
5819:
5785:
5705:
5619:
5617:
5616:
5611:
5595:
5589:
5581:
5544:
5499:
5480:
5478:
5471:
5447:
5444:Darboux function
5395:
5342:
5318:
5289:
5237:
5163:
5106:
5077:
5013:
4968:
4936:
4816:
4797:
4747:
4745:
4744:
4739:
4583:
4580:
4574:
4564:
4558:
4554:
4548:
4490:
4451:
4423:
4414:
4412:
4411:
4406:
4386:
4385:
4358:
4357:
4265:
4263:
4262:
4257:
4252:
4251:
4233:
4232:
4213:
4211:
4210:
4205:
4200:
4199:
4181:
4180:
4168:
4167:
4111:
4109:
4108:
4103:
4098:
4097:
4079:
4078:
4066:
4065:
4050:
4049:
4037:
4036:
4012:
4011:
3999:
3998:
3980:
3979:
3967:
3966:
3898:
3888:Thanks so much!
3868:
3744:
3684:
3608:
3559:
3531:
3471:
3395:
3392:
3386:
3351:
3300:
3272:
3231:
3218:
3187:
3126:
3081:
3055:
3044:
2991:
2965:
2937:
2887:
2861:Possible problem
2838:
2816:
2806:Dank's talk page
2753:
2689:
2638:
2610:
2583:
2558:
2491:
2463:
2403:
2377:
2333:
2316:
2295:
2270:
2180:
2177:Talk:Metatheorem
2145:
2123:
2058:
2039:
2003:basically admits
1966:
1922:
1890:
1854:
1812:
1756:
1724:
1673:
1659:
1635:
1618:Function problem
1594:
1553:
1509:
1453:
1411:
1400:, check whether
1331:
1304:
1269:History of Logic
1250:
1221:
1172:
1152:
1121:
1094:
1072:
1052:
1027:
951:
917:
829:
809:
746:
644:
624:
596:
566:
554:
517:
385:
325:
249:
222:
203:
109:
81:
56:
55:
33:
32:
26:
6167:
6166:
6162:
6161:
6160:
6158:
6157:
6156:
6155:
6150:
6125:
6085:
5980:
5947:
5942:
5877:
5872:
5867:
5845:
5668:
5641:
5605:
5602:
5601:
5583:
5582:
5578:
5539:
5534:
5495:
5474:
5472:
5415:
5362:
5338:
5314:
5309:
5277:
5268:Log of ref runs
5257:
5233:
5228:
5138:
5102:
5097:
5058:User talk:Dagme
5009:halting problem
4973:
4957:
4956:
4931:
4926:
4921:
4916:
4911:
4906:
4901:
4896:
4891:
4886:
4881:
4876:
4871:
4866:
4861:
4856:
4787:
4769:
4718:
4715:
4714:
4706:
4701:holding of the
4695:
4674:
4670:
4656:
4652:
4618:
4613:
4608:
4603:
4601:Axiom of choice
4578:
4572:
4562:
4556:
4552:
4546:
4530:
4486:
4481:
4476:
4471:
4443:
4381:
4377:
4353:
4349:
4338:
4335:
4334:
4318:
4309:
4292:
4279:
4247:
4243:
4228:
4224:
4219:
4216:
4215:
4195:
4191:
4176:
4172:
4163:
4159:
4154:
4151:
4150:
4142:
4133:
4093:
4089:
4074:
4070:
4061:
4057:
4045:
4041:
4032:
4028:
4007:
4003:
3994:
3990:
3975:
3971:
3962:
3958:
3950:
3947:
3946:
3925:
3918:
3897:
3864:
3859:
3854:
3849:
3844:
3839:
3834:
3829:
3824:
3819:
3814:
3809:
3659:priority method
3603:
3440:
3435:
3430:
3425:
3420:
3415:
3410:
3405:
3390:
3381:
3379:
3375:
3320:
3296:
3227:
3219:
3208:
3193:
3188:
3177:
3162:
3121:
3114:
3109:
3104:
3099:
3080:
3043:
3030:Here's another
3027:
3022:
3017:
2990:
2863:
2858:
2830:user:ProcseeBot
2822:
2817:
2810:
2795:
2790:
2785:
2749:
2725:
2720:
2715:
2710:
2705:
2700:
2695:
2690:
2683:
2668:
2663:
2658:
2578:
2550:
2545:
2537:
2532:
2527:
2487:
2433:Richard paradox
2331:
2287:
2175:see my note on
2171:
2166:
1990:
1918:
1913:
1908:
1903:
1878:
1785:
1781:
1776:
1752:
1707:
1702:
1697:
1614:
1578:
1573:
1548:
1543:
1538:
1533:
1528:
1523:
1507:
1499:
1494:
1489:
1484:
1445:Robbins algebra
1436:
1431:
1376:On the Infinite
1351:
1326:
1297:
1292:
1287:
1282:
1277:
1272:
1246:
1241:
1190:
1148:
1143:
1117:
1092:
1068:
1051:
1026:
1014:
1009:
936:
931:
929:For the record…
915:Septentrionalis
804:
731:
726:
724:For the record…
619:
614:
595:
553:
540:
535:
516:
500:
495:
490:
485:
480:
475:
470:
465:
460:
455:
450:
300:priority method
244:
202:
150:
145:
105:
77:
30:
22:
21:
20:
12:
11:
5:
6165:
6154:
6151:
6149:
6146:
6145:
6144:
6124:
6121:
6120:
6119:
6102:User:SimonTrew
6097:
6096:
6091:
6090:
6084:
6081:
6080:
6079:
6078:
6077:
6076:
6075:
6052:
6051:
6050:
6049:
6048:
6047:
6038:
6037:
6036:
6035:
6018:
6017:
5999:
5998:
5979:
5976:
5975:
5974:
5956:
5955:
5946:
5943:
5941:
5938:
5937:
5936:
5921:
5920:
5915:
5914:
5909:
5908:
5907:
5906:
5905:Best wishes S.
5900:
5899:
5898:
5897:
5891:
5890:
5889:
5888:
5876:
5873:
5871:
5868:
5866:
5863:
5860:
5859:
5857:
5844:
5841:
5840:
5839:
5838:
5837:
5836:
5835:
5834:
5833:
5779:
5778:
5761:
5760:
5742:
5741:
5740:
5739:
5720:
5719:
5700:
5699:
5698:
5697:
5680:
5679:
5667:
5664:
5663:
5662:
5640:
5637:
5636:
5635:
5634:
5633:
5609:
5576:
5559:
5558:
5538:
5535:
5533:
5530:
5529:
5528:
5527:
5526:
5521:Moonriddengirl
5514:
5513:
5494:
5491:
5490:
5489:
5488:
5487:
5486:
5485:
5462:
5461:
5440:
5439:
5438:
5414:
5411:
5410:
5409:
5391:
5390:
5389:
5388:
5385:
5378:
5377:
5368:
5367:
5361:
5358:
5357:
5356:
5337:
5334:
5333:
5332:
5313:
5310:
5308:
5305:
5304:
5303:
5276:
5273:
5272:
5271:
5256:
5255:SmackBot again
5253:
5252:
5251:
5232:
5229:
5227:
5224:
5223:
5222:
5221:
5220:
5219:
5218:
5178:
5177:
5158:
5157:
5137:
5134:
5133:
5132:
5131:
5130:
5101:
5098:
5096:
5093:
5092:
5091:
5073:
5072:
5049:
5048:
5047:
5046:
5045:
5044:
5043:
5042:
4972:
4969:
4955:
4952:
4951:
4950:
4930:
4927:
4925:
4922:
4920:
4917:
4915:
4912:
4910:
4907:
4905:
4902:
4900:
4897:
4895:
4892:
4890:
4887:
4885:
4882:
4880:
4877:
4875:
4872:
4870:
4867:
4865:
4862:
4860:
4857:
4855:
4852:
4851:
4850:
4840:69.228.171.150
4831:
4830:
4812:
4811:
4783:
4765:
4737:
4734:
4731:
4728:
4725:
4722:
4710:
4709:
4704:
4693:
4680:
4679:
4678:
4672:
4668:
4654:
4650:
4617:
4614:
4612:
4609:
4607:
4604:
4602:
4599:
4598:
4597:
4567:
4566:
4529:
4526:
4525:
4524:
4523:
4522:
4505:
4504:
4485:
4482:
4480:
4477:
4475:
4472:
4470:
4467:
4466:
4465:
4442:
4439:
4438:
4437:
4418:
4417:
4416:
4415:
4404:
4401:
4398:
4395:
4392:
4389:
4384:
4380:
4376:
4373:
4370:
4367:
4364:
4361:
4356:
4352:
4348:
4345:
4342:
4314:
4305:
4288:
4275:
4269:
4268:
4267:
4255:
4250:
4246:
4242:
4239:
4236:
4231:
4227:
4223:
4203:
4198:
4194:
4190:
4187:
4184:
4179:
4175:
4171:
4166:
4162:
4158:
4147:
4138:
4131:
4114:
4113:
4112:
4101:
4096:
4092:
4088:
4085:
4082:
4077:
4073:
4069:
4064:
4060:
4056:
4053:
4048:
4044:
4040:
4035:
4031:
4027:
4024:
4021:
4018:
4015:
4010:
4006:
4002:
3997:
3993:
3989:
3986:
3983:
3978:
3974:
3970:
3965:
3961:
3957:
3954:
3928:
3927:
3923:
3917:
3910:
3909:
3908:
3907:
3906:
3894:
3883:
3882:
3863:
3860:
3858:
3855:
3853:
3850:
3848:
3845:
3843:
3840:
3838:
3835:
3833:
3830:
3828:
3825:
3823:
3820:
3818:
3815:
3813:
3810:
3808:
3805:
3804:
3803:
3802:
3801:
3800:
3799:
3798:
3797:
3796:
3795:
3794:
3793:
3767:
3766:
3765:
3764:
3763:
3762:
3761:
3760:
3759:
3758:
3731:
3730:
3729:
3728:
3727:
3726:
3725:
3724:
3703:
3702:
3701:
3700:
3699:
3698:
3676:
3675:
3674:
3673:
3655:Post's problem
3644:
3643:
3642:
3641:
3623:
3622:
3602:
3599:
3598:
3597:
3596:
3595:
3594:
3593:
3592:
3591:
3590:
3589:
3588:
3587:
3586:
3585:
3523:
3522:
3512:
3509:
3506:
3503:
3499:
3498:
3497:
3496:
3486:
3485:
3467:
3466:
3453:
3452:
3439:
3436:
3434:
3431:
3429:
3426:
3424:
3421:
3419:
3416:
3414:
3411:
3409:
3406:
3404:
3401:
3400:
3399:
3374:
3371:
3370:
3369:
3368:
3367:
3366:
3365:
3347:Well, no; see
3340:
3339:
3338:
3337:
3319:
3316:
3315:
3314:
3295:
3292:
3291:
3290:
3289:
3288:
3287:
3286:
3263:
3262:
3261:
3260:
3246:
3245:
3226:
3220:
3209:Message added
3207:
3194:
3192:
3189:
3178:Message added
3176:
3163:
3161:
3158:
3157:
3156:
3155:
3154:
3141:
3140:
3120:
3115:
3113:
3110:
3108:
3105:
3103:
3100:
3098:
3095:
3094:
3093:
3092:
3091:
3090:
3089:
3077:
3040:
3026:
3023:
3021:
3018:
3016:
3013:
3012:
3011:
3010:
3009:
3008:
3007:
3006:
3005:
3004:
3003:
3002:
3001:
3000:
2999:
2987:
2926:
2925:
2924:
2923:
2922:
2921:
2920:
2919:
2880:
2879:
2862:
2859:
2857:
2854:
2853:
2852:
2834:
2833:
2826:
2821:
2818:
2809:
2796:
2794:
2791:
2789:
2786:
2784:
2781:
2780:
2779:
2778:
2777:
2748:
2742:
2741:
2740:
2724:
2721:
2719:
2716:
2714:
2711:
2709:
2706:
2704:
2701:
2699:
2696:
2694:
2691:
2682:
2669:
2667:
2664:
2662:
2659:
2657:
2654:
2653:
2652:
2633:
2632:
2629:
2625:
2624:
2598:
2597:
2577:
2574:
2573:
2572:
2549:
2546:
2544:
2538:
2536:
2533:
2531:
2528:
2526:
2523:
2522:
2521:
2520:
2519:
2486:
2483:
2482:
2481:
2480:
2479:
2478:
2477:
2454:
2453:
2452:
2451:
2418:
2417:
2392:
2391:
2373:
2372:
2371:
2363:
2359:
2349:
2348:
2345:
2337:
2330:
2327:
2326:
2325:
2324:
2323:
2286:
2283:
2282:
2281:
2280:
2279:
2278:
2277:
2245:
2244:
2243:
2242:
2235:
2234:
2233:
2232:
2225:
2224:
2223:
2222:
2215:
2214:
2213:
2212:
2205:
2204:
2203:
2202:
2195:
2194:
2170:
2167:
2165:
2162:
2161:
2160:
2159:
2158:
2157:
2156:
2155:
2154:
2153:
2152:
2108:Turing machine
2055:
2054:
2053:
2024:Turing machine
1989:
1986:
1985:
1984:
1983:
1982:
1981:
1980:
1953:
1952:
1951:
1950:
1937:
1936:
1917:
1914:
1912:
1909:
1907:
1904:
1902:
1899:
1898:
1897:
1877:
1872:
1871:
1870:
1869:
1868:
1844:
1843:
1827:
1826:
1807:
1806:
1803:
1802:
1801:
1790:
1789:
1782:
1780:
1777:
1775:
1772:
1771:
1770:
1751:
1742:
1741:
1740:
1739:
1738:
1718:
1717:
1706:
1703:
1701:
1698:
1696:
1693:
1692:
1691:
1690:
1689:
1688:
1687:
1631:
1630:
1628:Search problem
1625:
1620:
1613:
1610:
1609:
1608:
1589:
1588:
1585:
1582:
1577:
1574:
1572:
1569:
1568:
1567:
1547:
1544:
1542:
1539:
1537:
1534:
1532:
1529:
1527:
1524:
1522:
1519:
1518:
1517:
1498:
1495:
1493:
1490:
1488:
1485:
1483:
1480:
1479:
1478:
1468:67.122.211.205
1460:
1435:
1432:
1430:
1427:
1426:
1425:
1407:
1406:
1405:
1390:
1389:
1380:
1379:
1350:
1347:
1346:
1345:
1325:
1320:
1319:
1318:
1296:
1293:
1291:
1288:
1286:
1283:
1281:
1278:
1276:
1273:
1271:
1266:
1265:
1264:
1245:
1242:
1240:
1237:
1236:
1235:
1218:
1217:
1216:
1212:
1209:
1206:
1203:
1200:
1197:
1189:
1184:
1183:
1182:
1181:
1180:
1147:
1144:
1142:
1137:
1136:
1135:
1116:
1113:
1112:
1111:
1110:
1109:
1067:
1066:thumb captions
1064:
1063:
1062:
1061:
1060:
1048:
1036:
1035:
1023:
1013:
1010:
1008:
1005:
1004:
1003:
1000:
997:
994:
991:
988:
985:
982:
979:
976:
973:
970:
966:
965:
947:
946:
942:
941:
935:
932:
930:
927:
926:
925:
906:
905:
889:
888:
883:
882:
879:
874:
873:
859:
858:
857:
856:
824:
823:
803:
800:
799:
798:
795:
792:
789:
786:
783:
780:
777:
774:
771:
768:
765:
761:
760:
742:
741:
737:
736:
730:
727:
725:
722:
721:
720:
704:
703:
698:
697:
694:
689:
688:
674:
673:
672:
671:
639:
638:
618:
615:
613:
610:
609:
608:
607:
606:
605:
604:
592:
550:
539:
536:
534:
531:
530:
529:
528:
527:
526:
525:
513:
499:
496:
494:
491:
489:
486:
484:
481:
479:
476:
474:
471:
469:
466:
464:
461:
459:
456:
454:
451:
449:
446:
445:
444:
443:
442:
441:
440:
439:
438:
437:
436:
435:
434:
408:
407:
406:
405:
404:
403:
402:
401:
400:
399:
372:
371:
370:
369:
368:
367:
366:
365:
344:
343:
342:
341:
340:
339:
317:
316:
315:
314:
296:Post's problem
285:
284:
283:
282:
264:
263:
243:
240:
239:
238:
237:
236:
212:
211:
199:
190:
189:
184:
179:
174:
169:
163:
162:
149:
146:
144:
141:
140:
139:
138:
137:
104:
101:
98:
97:
92:
87:
82:
75:
70:
65:
62:
52:
51:
34:
15:
9:
6:
4:
3:
2:
6164:
6143:
6138:
6134:
6127:
6126:
6123:PeerReviewBot
6118:
6113:
6109:
6103:
6099:
6098:
6093:
6092:
6087:
6086:
6074:
6069:
6065:
6058:
6057:
6056:
6055:
6054:
6053:
6044:
6043:
6042:
6041:
6040:
6039:
6034:
6030:
6026:
6022:
6021:
6020:
6019:
6016:
6011:
6007:
6001:
6000:
5997:
5992:
5988:
5982:
5981:
5973:
5968:
5964:
5958:
5957:
5953:
5949:
5948:
5935:
5931:
5927:
5923:
5922:
5917:
5916:
5911:
5910:
5904:
5903:
5902:
5901:
5895:
5894:
5893:
5892:
5885:
5881:
5880:
5879:
5878:
5870:Policy Report
5858:
5853:
5849:
5848:
5832:
5827:
5823:
5816:
5815:
5813:
5809:
5808:
5805:
5800:
5799:
5798:
5793:
5789:
5783:
5782:
5781:
5780:
5776:
5772:
5771:
5768:
5763:
5762:
5758:
5754:
5753:
5750:
5744:
5743:
5737:
5733:
5732:
5729:
5724:
5723:
5722:
5721:
5718:
5713:
5709:
5702:
5701:
5696:
5692:
5688:
5684:
5683:
5682:
5681:
5674:
5670:
5669:
5660:
5656:
5655:
5652:
5647:
5643:
5642:
5632:
5628:
5624:
5607:
5599:
5593:
5587:
5579:
5574:
5570:
5563:
5562:
5561:
5560:
5557:
5552:
5548:
5541:
5540:
5525:
5522:
5518:
5517:
5516:
5515:
5512:
5507:
5503:
5497:
5496:
5484:
5479:
5477:
5468:
5467:
5466:
5465:
5464:
5463:
5460:
5455:
5451:
5445:
5441:
5437:
5433:
5429:
5425:
5421:
5420:
5417:
5416:
5408:
5403:
5399:
5393:
5392:
5386:
5383:
5382:
5380:
5379:
5375:
5370:
5369:
5364:
5363:
5355:
5350:
5346:
5340:
5339:
5331:
5326:
5322:
5316:
5315:
5302:
5297:
5293:
5287:
5283:
5279:
5278:
5269:
5266:
5265:
5259:
5258:
5250:
5245:
5241:
5235:
5234:
5217:
5214:
5211:
5207:
5206:
5205:
5201:
5197:
5193:
5192:
5191:
5188:
5185:
5180:
5179:
5176:
5171:
5167:
5160:
5159:
5156:
5152:
5148:
5144:
5140:
5139:
5129:
5125:
5121:
5120:
5119:
5114:
5110:
5104:
5103:
5090:
5085:
5081:
5075:
5074:
5071:
5067:
5063:
5059:
5055:
5054:Euler diagram
5051:
5050:
5041:
5037:
5033:
5028:
5027:
5026:
5021:
5017:
5010:
5006:
5005:
5004:
5000:
4996:
4992:
4991:combinatorics
4988:
4985:
4981:
4977:
4976:
4975:
4974:
4967:
4962:
4949:
4944:
4940:
4933:
4932:
4919:x86 assembler
4849:
4845:
4841:
4837:
4833:
4832:
4829:
4824:
4820:
4814:
4813:
4810:
4805:
4801:
4795:
4791:
4786:
4781:
4777:
4773:
4768:
4763:
4759:
4755:
4751:
4732:
4726:
4723:
4712:
4711:
4707:
4700:
4696:
4690:holds of the
4689:
4685:
4681:
4676:
4664:
4661:
4657:
4646:
4643:
4642:
4640:
4636:
4632:
4631:semirecursive
4628:
4624:
4620:
4619:
4596:
4591:
4587:
4577:
4569:
4568:
4561:
4551:
4544:
4540:
4536:
4532:
4531:
4521:
4517:
4513:
4509:
4508:
4507:
4506:
4503:
4498:
4494:
4488:
4487:
4464:
4459:
4455:
4449:
4445:
4444:
4436:
4431:
4427:
4420:
4419:
4399:
4396:
4390:
4382:
4378:
4371:
4368:
4362:
4354:
4350:
4343:
4333:
4332:
4330:
4326:
4322:
4317:
4313:
4308:
4304:
4300:
4296:
4291:
4287:
4283:
4278:
4274:
4270:
4248:
4244:
4240:
4237:
4234:
4229:
4225:
4196:
4192:
4188:
4185:
4182:
4177:
4173:
4169:
4164:
4160:
4149:The sequence
4148:
4146:
4141:
4137:
4130:
4126:
4122:
4118:
4117:
4115:
4094:
4090:
4086:
4083:
4080:
4075:
4071:
4067:
4062:
4058:
4054:
4046:
4042:
4038:
4033:
4029:
4022:
4019:
4016:
4008:
4004:
4000:
3995:
3991:
3984:
3976:
3972:
3968:
3963:
3959:
3945:
3944:
3942:
3938:
3934:
3930:
3929:
3920:
3919:
3915:
3905:
3902:
3901:
3891:
3887:
3886:
3885:
3884:
3881:
3876:
3872:
3866:
3865:
3792:
3788:
3784:
3779:
3778:
3777:
3776:
3775:
3774:
3773:
3772:
3771:
3770:
3769:
3768:
3757:
3752:
3748:
3741:
3740:
3739:
3738:
3737:
3736:
3735:
3734:
3733:
3732:
3723:
3719:
3715:
3711:
3710:
3709:
3708:
3707:
3706:
3705:
3704:
3697:
3692:
3688:
3682:
3681:
3680:
3679:
3678:
3677:
3672:
3668:
3664:
3660:
3656:
3652:
3648:
3647:
3646:
3645:
3640:
3636:
3632:
3627:
3626:
3625:
3624:
3621:
3616:
3612:
3605:
3604:
3584:
3580:
3576:
3575:
3574:
3573:
3572:
3567:
3563:
3556:
3555:
3554:
3550:
3546:
3545:
3544:
3539:
3535:
3529:
3528:
3527:
3526:
3525:
3524:
3521:
3517:
3513:
3510:
3507:
3504:
3501:
3500:
3494:
3490:
3489:
3488:
3487:
3484:
3479:
3475:
3469:
3468:
3463:
3459:
3455:
3454:
3450:
3446:
3442:
3441:
3398:
3393:
3387:
3385:
3377:
3376:
3364:
3359:
3355:
3349:
3346:
3345:
3344:
3343:
3342:
3341:
3336:
3332:
3328:
3324:
3323:
3322:
3321:
3313:
3308:
3304:
3298:
3297:
3285:
3280:
3276:
3269:
3268:
3267:
3266:
3265:
3264:
3259:
3256:
3255:
3250:
3249:
3248:
3247:
3244:
3239:
3235:
3229:
3228:
3225:
3216:
3212:
3205:
3198:
3185:
3181:
3174:
3167:
3153:
3149:
3145:
3144:
3143:
3142:
3139:
3134:
3130:
3123:
3122:
3119:
3088:
3085:
3084:
3074:
3070:
3069:
3068:
3063:
3059:
3053:
3052:
3051:
3048:
3047:
3037:
3033:
3029:
3028:
2998:
2995:
2994:
2984:
2980:
2979:
2978:
2973:
2969:
2963:
2962:
2961:
2958:
2957:
2952:
2951:
2950:
2945:
2941:
2934:
2933:
2932:
2931:
2930:
2929:
2928:
2927:
2917:
2916:
2915:
2912:
2911:
2906:
2902:
2901:
2900:
2895:
2891:
2884:
2883:
2882:
2881:
2878:
2875:
2874:
2869:
2865:
2864:
2851:
2846:
2842:
2836:
2835:
2831:
2827:
2824:
2823:
2814:
2807:
2800:
2776:
2772:
2768:
2767:
2766:
2761:
2757:
2751:
2750:
2747:
2739:
2735:
2731:
2727:
2726:
2687:
2680:
2673:
2651:
2646:
2642:
2635:
2634:
2630:
2627:
2626:
2623:
2618:
2614:
2608:
2604:
2600:
2599:
2596:
2591:
2587:
2580:
2579:
2571:
2566:
2562:
2556:
2552:
2551:
2542:
2518:
2514:
2510:
2506:
2505:
2504:
2499:
2495:
2489:
2488:
2476:
2471:
2467:
2460:
2459:
2458:
2457:
2456:
2455:
2450:
2446:
2442:
2438:
2434:
2430:
2426:
2422:
2421:
2420:
2419:
2416:
2411:
2407:
2401:
2399:
2397:
2394:
2393:
2390:
2385:
2381:
2374:
2369:
2364:
2360:
2357:
2356:
2353:
2352:
2346:
2342:
2338:
2335:
2334:
2322:
2319:
2314:
2310:
2309:
2308:
2303:
2299:
2293:
2289:
2288:
2276:
2273:
2268:
2264:
2263:
2262:
2258:
2254:
2249:
2248:
2247:
2246:
2239:
2238:
2237:
2236:
2229:
2228:
2227:
2226:
2219:
2218:
2217:
2216:
2209:
2208:
2207:
2206:
2199:
2198:
2197:
2196:
2193:
2188:
2184:
2178:
2173:
2172:
2151:
2148:
2143:
2139:
2135:
2131:
2130:
2129:
2126:
2121:
2117:
2113:
2109:
2104:
2100:
2096:
2092:
2088:
2084:
2079:
2075:
2074:
2073:
2072:
2071:
2066:
2062:
2056:
2050:
2049:
2047:
2046:
2045:
2042:
2037:
2033:
2029:
2025:
2020:
2016:
2012:
2008:
2004:
2000:
1995:
1992:
1991:
1979:
1974:
1970:
1964:
1959:
1958:
1957:
1956:
1955:
1954:
1949:
1945:
1941:
1940:
1939:
1938:
1935:
1930:
1926:
1920:
1919:
1896:
1893:
1888:
1884:
1880:
1879:
1876:
1867:
1862:
1858:
1852:
1848:
1847:
1846:
1845:
1842:
1838:
1834:
1831:a nice day.--
1829:
1828:
1825:
1820:
1816:
1809:
1808:
1804:
1799:
1798:
1796:
1792:
1791:
1787:
1786:
1769:
1764:
1760:
1754:
1753:
1750:
1746:
1737:
1732:
1728:
1722:
1721:
1720:
1719:
1716:
1713:
1709:
1708:
1686:
1681:
1677:
1671:
1667:
1666:
1665:
1662:
1657:
1653:
1650:
1649:
1648:
1643:
1639:
1633:
1632:
1629:
1626:
1624:
1621:
1619:
1616:
1615:
1607:
1602:
1598:
1591:
1590:
1586:
1583:
1580:
1579:
1566:
1561:
1557:
1550:
1549:
1516:
1513:
1510:
1506:
1501:
1500:
1477:
1473:
1469:
1465:
1461:
1459:
1456:
1451:
1446:
1442:
1438:
1437:
1424:
1419:
1415:
1408:
1403:
1399:
1395:
1394:
1392:
1391:
1386:
1382:
1381:
1377:
1373:
1369:
1365:
1361:
1357:
1353:
1352:
1344:
1339:
1335:
1328:
1327:
1324:
1317:
1312:
1308:
1302:
1299:
1298:
1270:
1263:
1258:
1254:
1248:
1247:
1234:
1229:
1225:
1219:
1213:
1210:
1207:
1204:
1201:
1198:
1195:
1194:
1192:
1191:
1188:
1179:
1175:
1171:
1167:
1166:
1165:
1160:
1156:
1150:
1149:
1141:
1134:
1129:
1125:
1119:
1118:
1108:
1104:
1100:
1096:
1087:
1086:
1085:
1080:
1076:
1070:
1069:
1059:
1056:
1055:
1045:
1040:
1039:
1038:
1037:
1034:
1031:
1030:
1020:
1016:
1015:
1001:
998:
995:
992:
989:
986:
983:
980:
977:
974:
971:
968:
967:
964:
959:
955:
949:
948:
944:
943:
938:
937:
924:
920:
916:
912:
908:
907:
904:
900:
896:
891:
890:
885:
884:
880:
876:
875:
872:
869:
866:
861:
860:
855:
852:
849:
844:
843:
842:
837:
833:
826:
825:
822:
817:
813:
806:
805:
796:
793:
790:
787:
784:
781:
778:
775:
772:
769:
766:
763:
762:
759:
754:
750:
744:
743:
739:
738:
733:
732:
719:
715:
711:
706:
705:
700:
699:
695:
691:
690:
687:
684:
681:
676:
675:
670:
667:
664:
659:
658:
657:
652:
648:
641:
640:
637:
632:
628:
621:
620:
603:
600:
599:
589:
585:
581:
580:
579:
574:
570:
563:
562:
561:
558:
557:
547:
542:
541:
524:
521:
520:
510:
506:
505:
504:
503:
502:
501:
433:
429:
425:
420:
419:
418:
417:
416:
415:
414:
413:
412:
411:
410:
409:
398:
393:
389:
382:
381:
380:
379:
378:
377:
376:
375:
374:
373:
364:
360:
356:
352:
351:
350:
349:
348:
347:
346:
345:
338:
333:
329:
323:
322:
321:
320:
319:
318:
313:
309:
305:
301:
297:
293:
289:
288:
287:
286:
281:
277:
273:
268:
267:
266:
265:
262:
257:
253:
246:
245:
235:
230:
226:
220:
216:
215:
214:
213:
210:
207:
206:
196:
192:
191:
188:
185:
183:
180:
178:
175:
173:
170:
168:
165:
164:
160:
156:
152:
151:
136:
132:
128:
124:
123:
122:
117:
113:
107:
106:
96:
93:
91:
88:
86:
83:
80:
76:
74:
71:
69:
66:
63:
61:
58:
57:
49:
45:
41:
40:
35:
28:
27:
19:
18:User talk:CBM
5883:
5802:
5765:
5747:
5726:
5649:
5639:Prison Break
5568:
5475:
5435:
5431:
5427:
5423:
5267:
5262:
5196:Pollinosisss
5147:Pollinosisss
5124:push to talk
4990:
4958:
4793:
4789:
4784:
4779:
4775:
4771:
4766:
4761:
4757:
4756:such that φ(
4753:
4749:
4702:
4698:
4691:
4687:
4683:
4666:
4662:
4659:
4648:
4644:
4638:
4634:
4630:
4629:, or simply
4626:
4622:
4512:66.245.43.17
4328:
4324:
4320:
4315:
4311:
4306:
4302:
4298:
4294:
4289:
4285:
4281:
4276:
4272:
4144:
4139:
4135:
4128:
4124:
4120:
3940:
3936:
3932:
3892:
3650:
3579:push to talk
3549:push to talk
3516:push to talk
3383:
3254:Geometry guy
3252:
3148:push to talk
3075:
3038:
2985:
2956:Geometry guy
2954:
2910:Geometry guy
2908:
2873:Geometry guy
2871:
2771:push to talk
2606:
2436:
2428:
2424:
2340:
2329:Circularity?
2086:
1944:push to talk
1885:on him now.
1745:Gödel number
1504:
1401:
1397:
1375:
1371:
1367:
1363:
1359:
1356:substitution
1355:
1046:
1021:
590:
548:
511:
291:
197:
78:
43:
37:
4914:Abstraction
3025:PR bot idea
2231:SLOPPINESS.
2083:this review
934:Version 0.7
729:Version 0.7
103:Version 0.7
36:This is an
5807:Farmbrough
5770:Farmbrough
5752:Farmbrough
5731:Farmbrough
5654:Farmbrough
5571:. p. 375.
5430:such that
5360:Set theory
5336:WP 1.0 bot
4984:Tim Gowers
4686:such that
4671:, . . ., x
4450:. — Carl
4310:such that
3213:. You can
3182:. You can
2548:Stub types
2509:Darkfrog24
2132:Actually,
2103:subsequent
2017:I guess.)
1883:ANI thread
1875:User:Linas
1576:Bot module
1521:Tamil wiki
1115:Guess what
919:PMAnderson
887:promotion.
702:promotion.
95:Archive 15
90:Archive 14
85:Archive 13
79:Archive 12
73:Archive 11
68:Archive 10
6025:JRSpriggs
5687:Debresser
5586:cite book
5476:franklin
4119:For each
3896:<: -->
3890:Ruhrfisch
3862:Bot issue
3449:this tool
3445:this edit
3350:. — Carl
3118:WT:Update
3079:<: -->
3073:Ruhrfisch
3042:<: -->
3036:Ruhrfisch
2989:<: -->
2983:Ruhrfisch
2746:WT:Update
2730:ThaddeusB
2402:. — Carl
2019:This post
1963:this tool
1672:. — Carl
1396:On input
1360:recursion
1050:<: -->
1044:Ruhrfisch
1025:<: -->
1019:Ruhrfisch
1012:PR tweak?
594:<: -->
588:Ruhrfisch
552:<: -->
546:Ruhrfisch
515:<: -->
509:Ruhrfisch
221:. — Carl
201:<: -->
195:Ruhrfisch
60:Archive 5
5666:SmackBot
5623:Gro-Tsen
5312:SmackBot
5231:December
5062:Wvbailey
4653:, ..., x
4510:Thanks!
3657:and the
3653:page on
3465:instead?
3191:Talkback
3160:Talkback
2811:You can
2793:talkback
2684:You can
2441:Wvbailey
2311:Thanks,
2110:or even
2078:Rule 110
1103:contribs
298:and the
294:page on
127:Walkerma
5926:Si Trew
5818:— Carl
5673:WT:CITE
5141:Hello,
5060:. Bill
4889:Theorem
4658:) iff ∃
4116:where:
3933:express
3783:Likebox
3781:always.
3714:Likebox
3663:Likebox
3631:Likebox
3327:Likebox
3125:— Carl
2431:of the
2425:appears
1220:— Carl
950:— Carl
745:— Carl
424:Likebox
422:always.
355:Likebox
304:Likebox
272:Likebox
155:wp:pr/d
39:archive
6100:Also,
5884:little
5865:Thanks
5646:tripos
5286:TS-413
5282:TS-416
4576:policy
4560:policy
4550:policy
4528:Policy
3629:speak.
3224:WP:GAN
2138:thread
2099:enough
2095:appear
2032:WP:WPM
1999:admits
1833:WlaKom
1652:Indeed
1512:(talk)
1170:Hiding
911:WT:WPM
584:WP:FAS
270:speak.
6089:make.
5493:Help?
5213:Adler
5187:Adler
5032:Robin
4995:Robin
3895:: -->
3382:Gary
3294:Reply
3078:: -->
3041:: -->
2988:: -->
2601:The "
2341:model
1712:Rd232
1508:cobra
1505:Cyber
1049:: -->
1024:: -->
940:good.
868:Adler
851:Adler
735:good.
683:Adler
666:Adler
593:: -->
551:: -->
514:: -->
200:: -->
159:WP:PR
16:<
6137:talk
6112:talk
6068:talk
6029:talk
6010:talk
5991:talk
5967:talk
5930:talk
5826:talk
5804:Rich
5792:talk
5767:Rich
5749:Rich
5728:Rich
5712:talk
5691:talk
5651:Rich
5627:talk
5592:link
5573:ISBN
5551:talk
5506:talk
5454:talk
5402:talk
5349:talk
5325:talk
5296:talk
5244:talk
5210:Hans
5200:talk
5184:Hans
5170:talk
5151:talk
5113:talk
5084:talk
5066:talk
5036:talk
5020:talk
4999:talk
4943:talk
4844:talk
4823:talk
4804:talk
4752:for
4590:talk
4516:talk
4497:talk
4458:talk
4430:talk
3875:talk
3787:talk
3751:talk
3718:talk
3691:talk
3667:talk
3651:real
3635:talk
3615:talk
3566:talk
3538:talk
3478:talk
3391:talk
3384:King
3358:talk
3331:talk
3307:talk
3279:talk
3238:talk
3133:talk
3062:talk
2972:talk
2944:talk
2905:here
2894:talk
2845:talk
2760:talk
2734:talk
2645:talk
2617:talk
2590:talk
2565:talk
2513:talk
2498:talk
2470:talk
2445:talk
2410:talk
2384:talk
2317:ping
2313:Pcap
2302:talk
2271:ping
2267:Pcap
2257:talk
2187:talk
2146:ping
2142:Pcap
2124:ping
2120:Pcap
2091:FOCS
2087:weak
2065:talk
2040:ping
2036:Pcap
2026:and
1994:This
1973:talk
1929:talk
1891:ping
1887:Pcap
1861:talk
1837:talk
1819:talk
1763:talk
1731:talk
1680:talk
1660:ping
1656:Pcap
1642:talk
1601:talk
1560:talk
1472:talk
1454:ping
1450:Pcap
1418:talk
1338:talk
1311:talk
1257:talk
1228:talk
1159:talk
1128:talk
1099:talk
1079:talk
958:talk
899:talk
865:Hans
848:Hans
836:talk
816:talk
753:talk
714:talk
680:Hans
663:Hans
651:talk
631:talk
573:talk
428:talk
392:talk
359:talk
332:talk
308:talk
292:real
276:talk
256:talk
229:talk
131:talk
116:talk
6133:CBM
6108:CBM
6064:CBM
6006:CBM
5987:CBM
5963:CBM
5822:CBM
5788:CBM
5708:CBM
5676:-->
5547:CBM
5502:CBM
5450:CBM
5398:CBM
5345:CBM
5321:CBM
5292:CBM
5240:CBM
5166:CBM
5109:CBM
5080:CBM
5016:CBM
4939:CBM
4819:CBM
4800:CBM
4675:, y
4586:CBM
4493:CBM
4454:CBM
4426:CBM
3922:WKL
3871:CBM
3747:CBM
3687:CBM
3611:CBM
3562:CBM
3534:CBM
3474:CBM
3354:CBM
3303:CBM
3275:CBM
3234:CBM
3129:CBM
3058:CBM
3032:one
2968:CBM
2940:CBM
2890:CBM
2841:CBM
2756:CBM
2641:CBM
2613:CBM
2586:CBM
2561:CBM
2494:CBM
2466:CBM
2429:nut
2406:CBM
2380:CBM
2298:CBM
2183:CBM
2169:POV
2061:CBM
1969:CBM
1925:CBM
1857:CBM
1815:CBM
1759:CBM
1747:vs
1727:CBM
1676:CBM
1638:CBM
1597:CBM
1556:CBM
1464:pdf
1414:CBM
1334:CBM
1307:CBM
1253:CBM
1224:CBM
1155:CBM
1124:CBM
1075:CBM
954:CBM
895:Avi
832:CBM
812:CBM
749:CBM
710:Avi
647:CBM
627:CBM
612:Thx
569:CBM
388:CBM
328:CBM
252:CBM
225:CBM
112:CBM
6135:·
6110:·
6066:·
6031:)
6008:·
5989:·
5965:·
5932:)
5824:·
5814:.
5810:,
5790:·
5773:,
5755:,
5734:,
5710:·
5693:)
5657:,
5648:.
5629:)
5608:ω
5588:}}
5584:{{
5549:·
5504:·
5452:·
5434:=2
5400:·
5347:·
5323:·
5294:·
5242:·
5202:)
5168:·
5153:)
5126:)
5111:·
5082:·
5068:)
5038:)
5030:--
5018:·
5001:)
4941:·
4846:)
4821:·
4802:·
4727:ϕ
4721:∃
4682:A
4588:·
4579:}}
4573:{{
4563:}}
4557:{{
4553:}}
4547:{{
4518:)
4495:·
4456:·
4428:·
4375:→
4341:∀
4284:,
4238:…
4186:…
4127:,
4123:≤
4084:…
4020:…
3873:·
3789:)
3749:·
3720:)
3689:·
3669:)
3637:)
3613:·
3581:)
3564:·
3551:)
3536:·
3518:)
3476:·
3356:·
3333:)
3305:·
3277:·
3236:·
3150:)
3131:·
3060:·
2970:·
2942:·
2907:.
2892:·
2843:·
2773:)
2758:·
2736:)
2643:·
2615:·
2588:·
2563:·
2515:)
2496:·
2468:·
2447:)
2408:·
2382:·
2347:”
2336:“
2300:·
2259:)
2185:·
2140:.
2118:.
2063:·
1971:·
1946:)
1927:·
1859:·
1839:)
1817:·
1761:·
1729:·
1678:·
1654:.
1640:·
1599:·
1558:·
1474:)
1416:·
1336:·
1309:·
1255:·
1226:·
1157:·
1126:·
1105:)
1101:•
1095:DJ
1091:Th
1077:·
1007:TI
956:·
901:)
834:·
814:·
751:·
716:)
649:·
629:·
571:·
533:TI
430:)
390:·
361:)
330:·
310:)
278:)
254:·
227:·
133:)
114:·
64:←
6139:)
6131:(
6114:)
6106:(
6070:)
6062:(
6027:(
6012:)
6004:(
5993:)
5985:(
5969:)
5961:(
5928:(
5828:)
5820:(
5794:)
5786:(
5777:.
5759:.
5738:.
5714:)
5706:(
5689:(
5661:.
5625:(
5596:(
5594:)
5580:.
5553:)
5545:(
5508:)
5500:(
5456:)
5448:(
5436:m
5432:n
5428:m
5424:n
5404:)
5396:(
5351:)
5343:(
5327:)
5319:(
5298:)
5290:(
5270:.
5246:)
5238:(
5198:(
5172:)
5164:(
5149:(
5115:)
5107:(
5086:)
5078:(
5064:(
5034:(
5022:)
5014:(
4997:(
4964:⚠
4945:)
4937:(
4842:(
4825:)
4817:(
4806:)
4798:(
4794:T
4790:n
4788:(
4785:e
4780:T
4776:P
4772:n
4770:(
4767:e
4762:h
4758:t
4754:x
4750:t
4736:)
4733:x
4730:(
4724:x
4705:i
4703:x
4699:S
4694:i
4692:x
4688:R
4684:y
4677:)
4673:n
4669:1
4667:x
4665:(
4663:R
4660:y
4655:n
4651:1
4649:x
4647:(
4645:S
4639:R
4635:n
4623:s
4592:)
4584:(
4514:(
4499:)
4491:(
4460:)
4452:(
4432:)
4424:(
4403:)
4400:1
4397:≠
4394:)
4391:n
4388:(
4383:T
4379:G
4372:1
4369:=
4366:)
4363:n
4360:(
4355:T
4351:F
4347:(
4344:n
4329:T
4325:n
4321:n
4319:(
4316:T
4312:G
4307:T
4303:G
4299:n
4295:n
4293:(
4290:T
4286:F
4282:n
4277:T
4273:F
4266:.
4254:)
4249:k
4245:a
4241:,
4235:,
4230:0
4226:a
4222:(
4202:)
4197:m
4193:p
4189:,
4183:,
4178:1
4174:p
4170:,
4165:0
4161:p
4157:(
4145:e
4140:i
4136:a
4132:i
4129:t
4125:k
4121:i
4100:)
4095:m
4091:p
4087:,
4081:,
4076:1
4072:p
4068:,
4063:0
4059:p
4055:,
4052:)
4047:k
4043:t
4039:,
4034:k
4030:a
4026:(
4023:,
4017:,
4014:)
4009:1
4005:t
4001:,
3996:1
3992:a
3988:(
3985:,
3982:)
3977:0
3973:t
3969:,
3964:0
3960:a
3956:(
3953:(
3941:e
3937:T
3924:0
3916:?
3899:°
3877:)
3869:(
3785:(
3753:)
3745:(
3716:(
3693:)
3685:(
3665:(
3633:(
3617:)
3609:(
3568:)
3560:(
3540:)
3532:(
3480:)
3472:(
3451:.
3394:)
3388:(
3360:)
3352:(
3329:(
3309:)
3301:(
3281:)
3273:(
3240:)
3232:(
3206:.
3175:.
3135:)
3127:(
3082:°
3064:)
3056:(
3045:°
2992:°
2974:)
2966:(
2946:)
2938:(
2896:)
2888:(
2847:)
2839:(
2832:.
2808:.
2762:)
2754:(
2732:(
2681:.
2647:)
2639:(
2619:)
2611:(
2607:N
2592:)
2584:(
2567:)
2559:(
2511:(
2500:)
2492:(
2472:)
2464:(
2443:(
2412:)
2404:(
2386:)
2378:(
2304:)
2296:(
2255:(
2189:)
2181:(
2067:)
2059:(
1975:)
1967:(
1931:)
1923:(
1863:)
1855:(
1835:(
1821:)
1813:(
1765:)
1757:(
1733:)
1725:(
1682:)
1674:(
1644:)
1636:(
1603:)
1595:(
1562:)
1554:(
1470:(
1420:)
1412:(
1402:n
1398:n
1368:n
1364:n
1340:)
1332:(
1313:)
1305:(
1259:)
1251:(
1230:)
1222:(
1174:T
1161:)
1153:(
1130:)
1122:(
1097:(
1093:e
1089:—
1081:)
1073:(
1053:°
1028:°
960:)
952:(
897:(
838:)
830:(
818:)
810:(
755:)
747:(
712:(
653:)
645:(
633:)
625:(
597:°
575:)
567:(
555:°
518:°
426:(
394:)
386:(
357:(
334:)
326:(
306:(
274:(
258:)
250:(
231:)
223:(
204:°
129:(
118:)
110:(
50:.
Text is available under the Creative Commons Attribution-ShareAlike License. Additional terms may apply.