Equation form expr-002bf3eb1573e012
Read as: k plus one
Means: k plus one
Methods
Read as: k plus one
Means: k plus one
Read as: capital P of k
Means: capital P of k
Read as: s
Means: s
Read as: a sub n
Means: a sub n
Read as: is less than l sub two divided by two
Means: is less than l sub two divided by two
Read as: t is a subterm of t
Means: t is a subterm of t
Read as: l sub two is less than k
Means: l sub two is less than k
Read as: the prefix consisting of an opening square bracket, s sub one, then a circle
Means: the prefix consisting of an opening square bracket, s sub one, then a circle
Read as: the prefix consisting of an opening square bracket, b, then a circle
Means: the prefix consisting of an opening square bracket, b, then a circle
Read as: l of t
Means: l of t
Read as: s sub k plus one equals the product of k plus one and k plus two, divided by two
Means: s sub k plus one equals the product of k plus one and k plus two, divided by two
Read as: m sub one is less than l sub one divided by two
Means: m sub one is less than l sub one divided by two
Read as: the letter a is a subterm of the letter a
Means: the letter a is a subterm of the letter a
Read as: l sub one
Means: l sub one
Read as: is less than n divided by two
Means: is less than n divided by two
Read as: n
Means: n
Read as: s sub two is not equal to r sub two
Means: s sub two is not equal to r sub two
Read as: s sub one circle s sub two
Means: s sub one circle s sub two
Read as: n plus one
Means: n plus one
Read as: t sub one is a subterm of s sub one
Means: t sub one is a subterm of s sub one
Read as: s sub zero equals zero; and s sub n plus one equals s sub n plus the quantity n plus one
Means: s sub zero equals zero; and s sub n plus one equals s sub n plus the quantity n plus one
Read as: the letter a is a subterm of the bracketed term b circle a
Means: the letter a is a subterm of the bracketed term b circle a
Read as: capital P of n
Means: capital P of n
Read as: the letter a circle the letter b
Means: the letter a circle the letter b
Read as: an opening square bracket
Means: an opening square bracket
Read as: f
Means: f
Read as: the prefix consisting of an opening square bracket followed by s sub one
Means: the prefix consisting of an opening square bracket followed by s sub one
Read as: is less than l divided by two
Means: is less than l divided by two
Read as: the bracketed term s
Means: the bracketed term s
Read as: the letters a, b, c, and d
Means: the letters a, b, c, and d
Read as: x
Means: x
Read as: the letter d
Means: the letter d
Read as: first decomposition: s sub one equals the letter a, and s sub two equals the string b circle c circle d; or, as r sub one circle r sub two, r sub one equals a circle b, and r sub two equals c circle d
Means: first decomposition: s sub one equals the letter a, and s sub two equals the string b circle c circle d; or, as r sub one circle r sub two, r sub one equals a circle b, and r sub two equals c circle d
Read as: k equals zero
Means: k equals zero
Read as: l sub one is less than k
Means: l sub one is less than k
Read as: the letter a is a subterm of the letter b
Means: the letter a is a subterm of the letter b
Read as: l is less than k
Means: l is less than k
Read as: f of the bracketed term a circle b equals the maximum of f of a and f of b, plus one, which equals the maximum of zero and zero plus one, which equals one; and f of the bracketed term whose left component is the bracketed term a circle b and whose right component is c equals the maximum of f of the bracketed term a circle b and f of c, plus one, which equals the maximum of one and zero plus one, which equals two
Means: f of the bracketed term a circle b equals the maximum of f of a and f of b, plus one, which equals the maximum of zero and zero plus one, which equals one; and f of the bracketed term whose left component is the bracketed term a circle b and whose right component is c equals the maximum of f of the bracketed term a circle b and f of c, plus one, which equals the maximum of one and zero plus one, which equals two
Read as: r
Means: r
Read as: five n plus one
Means: five n plus one
Read as: t sub one equals t sub two
Means: t sub one equals t sub two
Read as: the letter c
Means: the letter c
Read as: capital P of one
Means: capital P of one
Read as: is less than or equal to n divided by two, plus one
Means: is less than or equal to n divided by two, plus one
Read as: three
Means: three
Read as: eighteen
Means: eighteen
Read as: m sub two is less than l sub two divided by two
Means: m sub two is less than l sub two divided by two
Read as: eleven
Means: eleven
Read as: the malformed string opening bracket, opening bracket, c circle d, closing bracket, opening bracket
Means: the malformed string opening bracket, opening bracket, c circle d, closing bracket, opening bracket
Read as: s sub two
Means: s sub two
Read as: m sub one
Means: m sub one
Read as: capital A
Means: capital A
Read as: k equals one
Means: k equals one
Read as: o of s sub one and s sub two equals the bracketed term s sub one circle s sub two
Means: o of s sub one and s sub two equals the bracketed term s sub one circle s sub two
Read as: the bracketed term a circle a
Means: the bracketed term a circle a
Read as: g of t is defined by cases: zero if t is a letter; and the maximum of g of s sub one and g of s sub two, plus one, if t equals s sub one circle s sub two; end cases
Means: g of t is defined by cases: zero if t is a letter; and the maximum of g of s sub one and g of s sub two, plus one, if t equals s sub one circle s sub two; end cases
Read as: n is a natural number
Means: n is a natural number
Read as: the letter a equals the bracketed term b circle a
Means: the letter a equals the bracketed term b circle a
Read as: capital P
Means: capital P
Read as: t sub two
Means: t sub two
Read as: under the first decomposition, g of s sub one circle s sub two equals the maximum of g of a and g of b circle c circle d, plus one, which equals the maximum of zero and two plus one, which equals three; while under the other decomposition, g of r sub one circle r sub two equals the maximum of g of a circle b and g of c circle d, plus one, which equals the maximum of one and one plus one, which equals two
Means: under the first decomposition, g of s sub one circle s sub two equals the maximum of g of a and g of b circle c circle d, plus one, which equals the maximum of zero and two plus one, which equals three; while under the other decomposition, g of r sub one circle r sub two equals the maximum of g of a circle b and g of c circle d, plus one, which equals the maximum of one and one plus one, which equals two
Read as: the string b circle a circle b
Means: the string b circle a circle b
Read as: l is less than k
Means: l is less than k
Read as: zero
Means: zero
Read as: s sub k plus one equals s sub k plus the quantity k plus one
Means: s sub k plus one equals s sub k plus the quantity k plus one
Read as: s sub k equals the product of k and k plus one, divided by two
Means: s sub k equals the product of k and k plus one, divided by two
Read as: the letter b
Means: the letter b
Read as: l is less than zero
Means: l is less than zero
Read as: m sub two
Means: m sub two
Read as: o
Means: o
Read as: capital P of zero plus one
Means: capital P of zero plus one
Read as: s sub one is not equal to r sub one
Means: s sub one is not equal to r sub one
Read as: six k plus two
Means: six k plus two
Read as: twelve
Means: twelve
Read as: one
Means: one
Read as: the prefix consisting of an opening square bracket followed by r sub one
Means: the prefix consisting of an opening square bracket followed by r sub one
Read as: the letter a equals the letter b
Means: the letter a equals the letter b
Read as: r sub two
Means: r sub two
Read as: f of t
Means: f of t
Read as: the quantity k plus one
Means: the quantity k plus one
Read as: the bracketed term s sub one circle s sub two
Means: the bracketed term s sub one circle s sub two
Read as: the bracketed string a circle b
Means: the bracketed string a circle b
Read as: the bracketed terms a circle a, a circle b, b circle a, and so on through d circle d
Means: the bracketed terms a circle a, a circle b, b circle a, and so on through d circle d
Read as: s sub zero equals zero; s sub one equals s sub zero plus one, which equals one; s sub two equals s sub one plus two, which equals one plus two, which equals three; s sub three equals s sub two plus three, which equals one plus two plus three, which equals six; and so on
Means: s sub zero equals zero; s sub one equals s sub zero plus one, which equals one; s sub two equals s sub one plus two, which equals one plus two, which equals three; s sub three equals s sub two plus three, which equals one plus two plus three, which equals six; and so on
Read as: s sub k plus one equals k times k plus one over two, plus k plus one; this equals k times k plus one over two, plus two times k plus one over two; this equals the sum of k times k plus one and two times k plus one, all over two; this equals the product of k plus two and k plus one, divided by two
Means: s sub k plus one equals k times k plus one over two, plus k plus one; this equals k times k plus one over two, plus two times k plus one over two; this equals the sum of k times k plus one and two times k plus one, all over two; this equals the product of k plus two and k plus one, divided by two
Read as: m sub one plus m sub two plus one
Means: m sub one plus m sub two plus one
Read as: s sub one
Means: s sub one
Read as: the natural numbers
Means: the natural numbers
Read as: k minus one
Means: k minus one
Read as: r sub one
Means: r sub one
Read as: equals the bracketed term r sub one circle r sub two
Means: equals the bracketed term r sub one circle r sub two
Read as: an opening square bracket, an ellipsis, and a closing square bracket
Means: an opening square bracket, an ellipsis, and a closing square bracket
Read as: o of s sub one and s sub two
Means: o of s sub one and s sub two
Read as: capital A of x
Means: capital A of x
Read as: s sub n equals the product of n and n plus one, divided by two
Means: s sub n equals the product of n and n plus one, divided by two
Read as: k
Means: k
Read as: the letter a equals the letter a
Means: the letter a equals the letter a
Read as: l is less than two
Means: l is less than two
Read as: six n
Means: six n
Read as: t sub one is a subterm of t sub two
Means: t sub one is a subterm of t sub two
Read as: the quantity n plus one
Means: the quantity n plus one
Read as: s sub k plus one
Means: s sub k plus one
Read as: is less than k divided by two
Means: is less than k divided by two
Read as: for every l, if l is less than k, then capital P of l
Means: for every l, if l is less than k, then capital P of l
Read as: s sub n
Means: s sub n
Read as: m sub one plus m sub two plus one is less than l sub one divided by two, plus l sub two divided by two, plus one, which equals l sub one plus l sub two plus two, all divided by two, which is less than l sub one plus l sub two plus three, all divided by two, which equals k divided by two
Means: m sub one plus m sub two plus one is less than l sub one divided by two, plus l sub two divided by two, plus one, which equals l sub one plus l sub two plus two, all divided by two, which is less than l sub one plus l sub two plus three, all divided by two, which equals k divided by two
Read as: six k
Means: six k
Read as: capital P of two
Means: capital P of two
Read as: l sub one plus l sub two plus three
Means: l sub one plus l sub two plus three
Read as: for every x, if capital A of x, then capital B of x
Means: for every x, if capital A of x, then capital B of x
Read as: the string a circle b circle c circle d
Means: the string a circle b circle c circle d
Read as: capital P of k plus one
Means: capital P of k plus one
Read as: k equals one
Means: k equals one
Read as: the letter a
Means: the letter a
Read as: capital P of l
Means: capital P of l
Read as: n equals one
Means: n equals one
Read as: the bracketed term whose left component is the bracketed term a circle b and whose right component is d
Means: the bracketed term whose left component is the bracketed term a circle b and whose right component is d
Read as: f of t is less than l of t
Means: f of t is less than l of t
Read as: the bracketed term t circle s
Means: the bracketed term t circle s
Read as: t equals the bracketed term r sub one circle r sub two
Means: t equals the bracketed term r sub one circle r sub two
Read as: x plus one
Means: x plus one
Read as: l
Means: l
Read as: the prefix consisting of an opening square bracket, s sub one, circle, and r sub two
Means: the prefix consisting of an opening square bracket, s sub one, circle, and r sub two
Read as: first decomposition: s sub one equals the letter b, and s sub two equals a circle b; it is also of the form r sub one circle r sub two, where r sub one equals b circle a and r sub two equals b
Means: first decomposition: s sub one equals the letter b, and s sub two equals a circle b; it is also of the form r sub one circle r sub two, where r sub one equals b circle a and r sub two equals b
Read as: s sub one equals r sub one
Means: s sub one equals r sub one
Read as: the malformed string opening bracket, a, opening bracket, closing bracket, circle, closing bracket
Means: the malformed string opening bracket, a, opening bracket, closing bracket, circle, closing bracket
Read as: sixteen
Means: sixteen
Read as: six k plus six
Means: six k plus six
Read as: capital P of zero
Means: capital P of zero
Read as: t sub one is a subterm of s sub two
Means: t sub one is a subterm of s sub two
Read as: the bracketed term b circle a
Means: the bracketed term b circle a
Read as: six times the quantity k plus one
Means: six times the quantity k plus one
Read as: t sub one
Means: t sub one
Read as: six k plus one
Means: six k plus one
Read as: zero is less than one half
Means: zero is less than one half
Read as: the bracketed term b circle c
Means: the bracketed term b circle c
Read as: o of s sub one and s sub two
Means: o of s sub one and s sub two
Read as: g
Means: g
Read as: l sub two
Means: l sub two
Read as: a closing square bracket
Means: a closing square bracket
Read as: the bracketed term r sub one circle r sub two
Means: the bracketed term r sub one circle r sub two
Read as: the bracketed term d circle b
Means: the bracketed term d circle b
Read as: two
Means: two
Read as: the prefix consisting of an opening square bracket, a, then a circle
Means: the prefix consisting of an opening square bracket, a, then a circle
Read as: t sub two equals s sub one circle s sub two
Means: t sub two equals s sub one circle s sub two
Read as: capital B
Means: capital B
Read as: t
Means: t
Read as: capital P of k minus one
Means: capital P of k minus one
Read as: the letter a is a subterm of b
Means: the letter a is a subterm of b
Read as: six
Means: six
Read as: s sub two equals r sub two
Means: s sub two equals r sub two
Read as: f of t is defined by cases: zero if t is a letter; and the maximum of f of s sub one and f of s sub two, plus one, if t is the bracketed term s sub one circle s sub two; end cases
Means: f of t is defined by cases: zero if t is a letter; and the maximum of f of s sub one and f of s sub two, plus one, if t is the bracketed term s sub one circle s sub two; end cases
Read as: s sub zero equals zero times zero plus one, divided by two
Means: s sub zero equals zero times zero plus one, divided by two
Read as: the prefix consisting of an opening square bracket, s sub one, circle, and s sub two
Means: the prefix consisting of an opening square bracket, s sub one, circle, and s sub two
Read as: the bracketed term whose left component is the bracketed term b circle c and whose right component is the bracketed term d circle b
Means: the bracketed term whose left component is the bracketed term b circle c and whose right component is the bracketed term d circle b
Read as: is less than l sub one divided by two
Means: is less than l sub one divided by two
Read as: t equals the bracketed term s sub one circle s sub two
Means: t equals the bracketed term s sub one circle s sub two
Read as: the string b circle d
Means: the string b circle d
Read as: the bracketed term whose left component is a and whose right component is the bracketed term a circle a
Means: the bracketed term whose left component is a and whose right component is the bracketed term a circle a
Read as: the circle operator
Means: the circle operator
The theorem states that with n dice one can throw every one of the five n plus one integer values from n through six n. The source proof uses induction beginning with one die.
Two equations define the sequence. The base equation sets s sub zero to zero. The recursion equation sets s sub n plus one to s sub n plus the quantity n plus one.
The aligned calculation gives s sub zero as zero, s sub one as one, s sub two as one plus two, which is three, and s sub three as one plus two plus three, which is six, followed by and so on.
The proposition states that s sub n equals the product of n and n plus one, divided by two.
Starting from s sub k plus one, the calculation substitutes the inductive hypothesis, expresses k plus one with denominator two, combines the numerators, and factors the result as the product of k plus two and k plus one, divided by two.
The definition declares each of the letters a through d to be a nice term. If s sub one and s sub two are nice terms, their bracketed composition with the circle operator is a nice term. Nothing else is a nice term.
The proposition states that, for every n, the number of opening square brackets in a nice term of length n is less than n divided by two. Its source proof uses strong induction and retains the strict bound throughout.
The exercise inductively defines supernice terms from four letters, unary bracketing, binary circle composition inside brackets, and an exclusion clause. It asks for a proof that a supernice term of length n has at most n divided by two plus one opening brackets. The exercise remains unsolved.
The display defines o of s sub one and s sub two as the bracketed term s sub one circle s sub two.
The proposition states that the number of opening square brackets equals the number of closing square brackets in every nice term t. The source proves it by structural induction over letters and the binary constructor.
The exercise asks for a structural-induction proof that no nice term begins with a closing square bracket. It remains unsolved.
The proposition states that every proper initial segment of a nice term has more opening than closing square brackets. The source proof uses structural induction and enumerates all prefix positions in a binary composite.
The definition proceeds by the structure of t sub two. For a letter, t sub one is a subterm exactly when the terms are equal. For a bracketed binary composite, t sub one is a subterm exactly when it equals the whole term or is a subterm of either immediate component.
Every letter is a bracketless term. The circle composition of any two bracketless terms is a bracketless term, and nothing else is. The following source uses this definition to demonstrate ambiguous decomposition.
The display decomposes b circle a circle b first as b followed by a circle b, then as b circle a followed by b. These are two different binary readings of the same unbracketed string.
The proposition states that a nice term is either a letter or has uniquely determined nice terms s sub one and s sub two whose bracketed circle composition is the term. The proof cites the earlier proper-initial-segment proposition.
The depth f of a nice term t is zero when t is a letter. When t is the bracketed composition of s sub one and s sub two, its depth is the maximum of their depths plus one.
The first calculation gives depth one to the bracketed term a circle b. The second gives depth two to a term that composes that bracketed term with c.
The display reads a circle b circle c circle d first as a followed by b circle c circle d, and then as a circle b followed by c circle d. The source prints the b in the second left component without the roman-letter formatting used elsewhere; its mathematical letter remains b.
Under the first decomposition, the proposed depth function g returns three. Under the second decomposition, it returns two. The display demonstrates why this recursive clause does not define a function on ambiguously parsed bracketless terms.
The exercise asks for an inductive definition of l of t, the number of symbols in the nice term t. It remains unsolved.
The exercise asks for a structural-induction proof that the depth f of a nice term t is less than its length l of t, using the referenced definition of depth. It remains unsolved.