Purchase Solution

Ordinal Subtraction Defined by Recursion

Not what you're looking for?

Ask Custom Question

Please see the attached problem. I have attached some notes in case these are needed.

-----------------------------------------------------------------------------

Proposition 2.7.9: For any pair of ordinals alpha and beta such that alpha <= beta, there is a unique ordinal gamma such that alpha + gamma = beta, so we can write (unambiguously) gamma = beta - alpha when beta >= alpha.

-----------------------------------------------------------------------------

The given ordinal subtraction operation (defined by recursion):

alpha - alpha = 0

(beta^+) - alpha = (beta - alpha)^+

gamma - alpha = sup{beta - alpha: beta < gamma} when gamma is a limit ordinal.

Attachments
Purchase this Solution
Solution Summary

A complete, detailed proof that the given ordinal subtraction operation (defined by recursion) coincides with the definition of ordinal subtraction given in Proposition 2.7.9 is provided.

Solution Preview

Please see the attached file for a solution to the problem.

===========================================================================

Update: As you will see in the .pdf file that contains your Notes, the process of taking proofs that break down into the "0 case", the "successor case", and the "limit ordinal case" is known as ...

Solution provided by:
Georgia Martin, PhD
Education
  • AB, Hood College
  • PhD, The Catholic University of America
  • PhD, The University of Maryland at College Park
Recent Feedback
  • "Thanks for your assistance. "
  • "Thank you. I understand now."
  • "Super - Thank You"
  • "Very clear. I appreciate your help. Thank you."
  • "Great. thank you so much!"
Purchase this Solution
Free BrainMass Quizzes
Exponential Expressions

In this quiz, you will have a chance to practice basic terminology of exponential expressions and how to evaluate them.

Probability Quiz

Some questions on probability

Multiplying Complex Numbers

This is a short quiz to check your understanding of multiplication of complex numbers in rectangular form.

Geometry - Real Life Application Problems

Understanding of how geometry applies to in real-world contexts

Know Your Linear Equations

Each question is a choice-summary multiple choice question that will present you with a linear equation and then make 4 statements about that equation. You must determine which of the 4 statements are true (if any) in regards to the equation.

View More Free Quizzes
Related BrainMass Solutions

  • Recursion

    353218 Recursion Functions 4. Find f(2), f(3), f(4), and f(5) if f is defined recursively by f(0) = f(1) = 1 and for n = 1,2, ... a) f(n + 1) = f(n) - f(n - 1). b) f(n + 1) = f(n)f(n - I). c) f(n + 1) = f(n)^2 + f(n - 1)^3.

  • Probability Plot, Sample Size, ANOVA, & Regression

    On this scale, zero temperature (0oC) is arbitrarily defined as the freezing point of water, and the unit (oC) is then defined as 1/100th of the distance on the scale to the boiling point of water (100oC).

  • recursion formula

    46893 Recursion formula What would the recursion formula be for that problem. Please see attachment. see attachment. Solution.

  • Writing recursion formula

    This is the recursion formula. This shows how to write the recursion formula for a given series.

  • Discrete Math:Recursion

    By the end of the 8 hours day, I should have 16 plates done plus 96 X 16 = 1536 wells. Side Note: Here is the reason we discuss recursion for an IT degree.

  • Examples of recursion in C++

    208293 C++ Recursion A. What is direct recursion? b. What is tail recursion? c. Suppose hat intArray is an array of integers, and length specifies the number of elements in intArray.

  • Recursion Formula and Series

    again, An+1 = 1/(1/An + 2)= 1/[(1 + 2An)/An]= An/(1 + 2An) which is the recursion formula for the series This shows how to write a recursion formula for a series.

  • Visualizing Recursion - Java

    This job specifies how to visualize recursion.

  • Recursion

    Hence the function is not properly defined. Recursion is demonstrated for proposed functions.

View More Related Solutions