User talk:C7XWiki

Welcome!

Hello, C7XWiki, and welcome to Wikipedia! Thank you for your contributions, especially your edits to Large countable ordinal. I hope you like the place and decide to stay. Here are a few links to pages you might find helpful:

• Introduction and Getting started
• Contributing to Wikipedia
• The five pillars of Wikipedia
• How to edit a page and How to develop articles
• How to create your first article
• Simplified Manual of Style

You may also want to complete the Wikipedia Adventure, an interactive tour that will help you learn the basics of editing Wikipedia. You can visit the Teahouse to ask questions or seek help. Need some ideas about what kind of things need doing? Try the Task Center.

Please remember to sign your messages on talk pages by typing four tildes (~~~~); this will automatically insert your username and the date. If you need help, check out Wikipedia:Questions, ask me on my talk page, or , and a volunteer should respond shortly. Again, welcome! Coldtrack (talk) 21:25, 6 May 2021 (UTC)

Hi C7X

I'm on the googology wikia now under the same username.

Binary198 has given you a Mac n' Cheetos (🧀🐆)! Mac n' Cheetos promotes WikiLove (📖💞) and hopefully this one has made your day cheesier. It is dangerously cheesy! Mac n' Cheetos is the combination of both macaroni and cheese and the Frito-Lay snack Cheetos. Spread the WikiLove by giving someone else a Mac n' Cheetos, whether it be someone you have had disagreements with in the past or a good friend.

'Cheese is tasty'

Spread the goodness of Mac n' Cheetos by adding {{subst:Mac n' Cheetos}} to someone's talk page with a friendly message!

Hi! C7XWiki (talk) 20:13, 23 September 2021 (UTC)

Disambiguation link notification for September 28

Hi. Thank you for your recent edits. An automated process has detected that when you recently edited Model theory, you added a link pointing to the disambiguation page Formal theory. Such links are usually incorrect, since a disambiguation page is merely a list of unrelated topics with similar titles. (Read the FAQ • Join us at the DPL WikiProject.)

It's OK to remove this message. Also, to stop receiving these messages, follow these opt-out instructions. Thanks, DPL bot (talk) 05:58, 28 September 2021 (UTC)

OCFs

Would you want to collaborate on an ordinal collapsing function? I was thinking of creating thinning hierarchies consisting of iterated shrewdness diagonalized of degrees of unfoldability, which are in turn diagonalized by ethereal cardinals. If so, how would we collaborate? Should we use Google Docs? Binary198 (talk) 17:30, 21 February 2022 (UTC)

Sorry for not seeing this message for a while, I'd be happy to help! I can use Google Docs, although I'm sorry to say I know very little about unfoldable cardinals and elementary embeddings in general C7XWiki (talk) 10:21, 26 February 2022 (UTC)

Great! I don't 100% understand elementary embeddings myself (I have a vague idea). https://docs.google.com/document/d/1J2ThLBQ4PZe9L4MrOpeGhaFEGzovj_icluipIT49GeE/edit?usp=sharing Binary198 (talk) 16:13, 1 March 2022 (UTC)

ArbCom 2022 Elections voter message

Hello! Voting in the 2022 Arbitration Committee elections is now open until 23:59 (UTC) on Monday, 12 December 2022. All eligible users are allowed to vote. Users with alternate accounts may only vote once.

The Arbitration Committee is the panel of editors responsible for conducting the Wikipedia arbitration process. It has the authority to impose binding solutions to disputes between editors, primarily for serious conduct disputes the community has been unable to resolve. This includes the authority to impose site bans, topic bans, editing restrictions, and other measures needed to maintain our editing environment. The arbitration policy describes the Committee's roles and responsibilities in greater detail.

If you wish to participate in the 2022 election, please review the candidates and submit your choices on the voting page. If you no longer wish to receive these messages, you may add {{NoACEMM}} to your user talk page. MediaWiki message delivery (talk) 01:49, 29 November 2022 (UTC)

ArbCom 2023 Elections voter message

Hello! Voting in the 2023 Arbitration Committee elections is now open until 23:59 (UTC) on Monday, 11 December 2023. All eligible users are allowed to vote. Users with alternate accounts may only vote once.

The Arbitration Committee is the panel of editors responsible for conducting the Wikipedia arbitration process. It has the authority to impose binding solutions to disputes between editors, primarily for serious conduct disputes the community has been unable to resolve. This includes the authority to impose site bans, topic bans, editing restrictions, and other measures needed to maintain our editing environment. The arbitration policy describes the Committee's roles and responsibilities in greater detail.

If you wish to participate in the 2023 election, please review the candidates and submit your choices on the voting page. If you no longer wish to receive these messages, you may add {{NoACEMM}} to your user talk page. MediaWiki message delivery (talk) 00:55, 28 November 2023 (UTC)

Well-ordering theorem

A while back you added a proof to the article Well-ordering theorem that the axiom of choice implies the well-ordering theorem. Near the end of the proof there's a notation using angle brackets. Is that a standard notation for ordered set? It might be good to add a brief explanation or a link explaining that. Will Orrick (talk) 18:30, 25 January 2024 (UTC)

I think I no longer have a copy of the book in the citation, but the notation seems to mean the well-ordering whose length is the supremum of the $\alpha$ where $a_{\alpha }$ is defined, and where the set placed at height $\alpha$ in the ordering is $a_{\alpha }$. The well-ordering itself as a set would be $\{(a_{\alpha },a_{\beta })\mid a_{\alpha },a_{\beta }\;{\textrm {are}}\;{\textrm {defined}}\land \alpha <\beta \}$, although as this is an implementation detail I am not sure if this should be added to the article, in which case I am not sure what could be used to notate the ordering. Thanks for pointing this out! C7XWiki (talk) 22:06, 25 January 2024 (UTC)

Thanks for the reply. That clears it up for me. My feeling is that it would be better to conclude the proof without introducing an unfamiliar notation. I don't know if the following is a too long-winded replacement for the final sentence: "Then the order $<$ on $A$ defined by $a_{\alpha }<a_{\beta }$ if and only if $\alpha <\beta$ (in the usual well-order of the ordinals) is a well-order of order type $\sup\{\alpha \mid a_{\alpha }{\text{ is defined}}\}$." Will Orrick (talk) 17:16, 26 January 2024 (UTC)

That form sounds fine, I will add it into the article. Thanks! C7XWiki (talk) 06:33, 28 January 2024 (UTC)