Count of parentheses 「The eorem Every well-formed proposition has the same number of left as right parentheses O Consider the symbols without parentheses first O And then prove it by induction with more complicated propositions according to the Definition
Count of Parentheses . Theorem . . Every well-formed proposition has the same number of left as right parentheses. . Proof. . . 1. Consider the symbols without parentheses first. 2. And then prove it by induction with more complicated propositions according to the Definition. Yi Li (Fudan University) Discrete Mathematics(II) March 26, 2013 6 / 20
Prefix 「The eorem Any proper initial segement of a well-defined proposition contains an excess of left parenthesis. Thus no proper initial segement of a well defined propositon can itself be a well defined propositions Prove it by induction from simple to complicated propositions
Prefix . Theorem . . Any proper initial segement of a well-defined proposition contains an excess of left parenthesiss. Thus no proper initial segement of a well defined propositon can itself be a well defined propositions. . Proof. . . Prove it by induction from simple to complicated propositions. Yi Li (Fudan University) Discrete Mathematics(II) March 26, 2013 7 / 20