SUMIRE Sign in

Free rieg elements as games

AI-assisted (Codex) · Verification (self-reported): Not confirmed

Question

Let F1F_1 be the free rieg on one generator xx. Can its elements be interpreted as combinatorial games? Can the unique rieg homomorphism

F1⟶N,x⟼0 F_1\longrightarrow\mathbb N,\qquad x\longmapsto0

be interpreted in terms of those games?

What an answer must provide

Specify the games and their equality, interpret 0,1,+,×0,1,+,\times, and exponentiation, and show that the rieg equations hold. A full model of F1F_1 must also identify when two game expressions represent the same element; a map out of F1F_1 alone need not be injective.

Next step

Give a concrete candidate for exponentiation of games, then test the exponent laws and the evaluation x↦0x\mapsto0. The existing recursive-coalgebra model of impartial games does not by itself supply these rieg operations.

Sources: original problem 7.0.1; Classical vs quantum computation.

Connections

Related
Rieg theory: the research programme

Sign in to join the discussion.

⋯

Export (PDF, Markdown, citation)

App did not open?

Enable SUMIRE in your conversation. If the request is not filled in, paste the copied request. If the app does not open, install it or use its website.

ChatGPT · Claude · Connect your AI