User talk:Luqui

Nonchord tone
Quick explination:
 * The principle aspect of a nonchord tone is that it is not a part of a chord. Thus, in a seventh chord, a seventh is not a nonchord tone, it is a chord tone. Given a (seventh) chord with the four notes C-E-G-Bb, the Bb is a chord tone and not a nonchord tone.
 * How does one determine if a tone is a part of a chord if one does not already know? It depends, obviously, on context. A Bb played during a C major chord (CEG) does not necessarily turn that major chord into a seventh chord. A nonchord tone always resolves, while a chord tone does not (see nonchord tone).
 * Hopefully this explains somewhat. I have to go, but I will write more later. Please ask questions, and tell me to talk up or down if need be, on my talk page. Hyacinth 18:30, 9 Oct 2004 (UTC)

I am unable to determine what the chord you describe is. I would guess that C-Eb-Gb-B, despite the spelling, is not classified as a seventh chord, and maybe considered enharmonic spelling of another chord. Alternately, you could consider it a diminished chord with an added tone (the major seventh), see added tone chord. It may simply be a "nonharmonic" chord, which means not that its inharmonic, but that it is not analyzable using tonal theory. Hyacinth 22:16, 15 Oct 2004 (UTC)


 * My best guess right now is a major chord with an added (minor) ninth, B-D#-F#-C. Hyacinth 00:02, 6 Nov 2004 (UTC)

The chord C-Eb-Gb-B can be called a Cmi(ma7b5) chord in popular music. In common practice period theory it would be theoretically described as a "diminished-major chord," but because it uses thirds other than the M3 and m3, the chord is not found in the standard repertoire. --TobyRush 17:08, 10 Dec 2004 (UTC)

transitive closures
Is there an algorithm, that, given a transitive relation T, will return the smallest relation R such that the transitive closure of R is T? Is there such a smallest relation? I'm looking for such an algorithm, and this seems the most logical place to find a link to it. Luqui 10:55, July 19, 2005 (UTC)
 * Yes, and it's called transitive reduction, a concept that Wikipedia is not yet familiar with. Luqui 10:56, July 19, 2005 (UTC)

There is indeed a smallest one. To see that, consider that (1) the relation whereby every pair of members of the domain is related, is a transitive relation that is weaker than (i.e. that includes) T, and (2) the set of all such relations is closed under intersection, so the intersection of all such relations is another such relation; that intersection is therefore the smallest one. Michael Hardy 22:44, 19 July 2005 (UTC)

Wieman image
Hi, do you happen to know when Image:WiemanandCornell.jpg was taken? Thanks, AxelBoldt 16:52, 8 April 2006 (UTC)

Image copyright problem with Image:Farmers_hz.jpg
Thanks for uploading Image:Farmers_hz.jpg. The image has been identified as not specifying the copyright status of the image, which is required by Wikipedia's policy on images. If you don't indicate the copyright status of the image on the image's description page, using an appropriate copyright tag, it may be deleted some time in the next seven days. If you have uploaded other images, please verify that you have provided copyright information for them as well.

For more information on using images, see the following pages:
 * Image use policy
 * Image copyright tags

This is an automated notice by OrphanBot. For assistance on the image use policy, see Media copyright questions. 05:29, 18 June 2006 (UTC)

Articles for Deletion - Lenga (game)
An editor has nominated the article Lenga (game) for deletion, under the Articles for deletion process. We appreciate your contributions, but the nominator doesn't believe it satisfies Wikipedia's criteria for inclusion, and has explained why in the nomination (also see What Wikipedia is not and Deletion policy). Your opinions on why the topic of the article meets inclusion criteria and what should be done with the article are welcome: participate in the discussion by editing Articles for deletion/Lenga (game). Add four tildes like this &tilde;&tilde;&tilde;&tilde; to sign your comments. You can also edit the article Lenga (game) during the discussion, but do not remove the "Articles for Deletion" template (the box at the top of the article), this will not end the deletion debate. --WikiSlasher 13:57, 2 October 2006 (UTC)

Unreferenced BLPs
Hello Luqui! Thank you for your contributions. I am a bot alerting you that 1 of the articles that you created  is tagged as an Unreferenced Biography of a Living Person. The biographies of living persons policy requires that all personal or potentially controversial information be sourced. In addition, to insure verifiability, all biographies should be based on reliable sources. if you were to bring this article up to standards, it would greatly help us with the current Category:All_unreferenced_BLPs article backlog. Once the article is adequately referenced, please remove the unreferencedBLP tag. Here is the article:

Thanks!--DASHBot (talk) 22:02, 8 January 2010 (UTC)
 * 1) Jonathan Caouette -

Proposed deletion of Jonathan Caouette


The article Jonathan Caouette has been proposed for deletion&#32; because of the following concern:
 * BLP with no reliable sourcing, tagged for several months.

While all contributions to Wikipedia are appreciated, content or articles may be deleted for any of several reasons.

You may prevent the proposed deletion by removing the  notice, but please explain why in your edit summary or on the article's talk page.

Please consider improving the article to address the issues raised. Removing  will stop the proposed deletion process, but other deletion processes exist. The speedy deletion process can result in deletion without discussion, and articles for deletion allows discussion to reach consensus for deletion. Doniago (talk) 16:05, 12 October 2010 (UTC)

non-standard models of arithmetic
A while ago you added a comment on Goodstein's theorem at non-standard model of arithmetic. I find the comment confusing. Could you perhaps clarify it? Tkuvho (talk) 08:53, 24 October 2010 (UTC)

ArbCom elections are now open!
MediaWiki message delivery (talk) 12:48, 23 November 2015 (UTC)