Professional Documents
Culture Documents
Perspectives of New Music
Perspectives of New Music
Your use of the JSTOR archive indicates your acceptance of the Terms & Conditions of Use, available at .
http://www.jstor.org/page/info/about/policies/terms.jsp
.
JSTOR is a not-for-profit service that helps scholars, researchers, and students discover, use, and build upon a wide range of
content in a trusted digital archive. We use information technology and tools to increase productivity and facilitate new forms
of scholarship. For more information about JSTOR, please contact support@jstor.org.
Perspectives of New Music is collaborating with JSTOR to digitize, preserve and extend access to Perspectives
of New Music.
http://www.jstor.org
3. With content-identity
determinacy,any two sets representingjust
two distinctpitch elementsrelated by the interval1, each of the ele-
ments of which may be mapped into an element of the other by the
identityoperation,are equivalent.Where the lattermapping is notby
the identityoperation but by the addition of or subtractionfrom a
given integer, such two sets are transpositionallyor inversionally
equivalent,respectively.Thus, in the firstcase (A-A-Bb-A)= (Bb-Bb-
A-Bb-Bb-A-A); and in the second (or the third) case (A-A-Bb-A)=
(C-B-B-C-B). (3a.) Where token-dimensiondeterminacyis added to
content-identity determinacy(A-A-Bb-A)= (Bb-A-A-A).
4. At the order-of-content-determinate level, any two sets of any
token-dimensionsin which the firsttokens are tokens of the same
pitch element,and the next distinctpitch elements representedare
the same in both sets,etc.,are equivalent.Thus (A-A-Bb-A)= (A-Bb-
Bb-A-A). (4a.) Withtoken-dimensiondeterminacyadded to order-of-
content determinacy(A-A-Bb-A) = (A-A-Bb-A). Transpositionally
and inversionallyrelated sets are equivalent under this condition,
also.
Thus we may speak of content-determinate pitch systems(or con-
tent-referential, or content-generative,systems),and order-deter-
minatepitchsystems,notingthatwhereorder is syntactically determi-
nate this involves a more complicated referentialbasis than where
contentalone is, since "order" is not independent, but a referential
orderingof the contentof a pitch set.
But what do we mean by "syntacticalsystem"or "syntacticalfunc-
tion"?And how are "content"and "order" inferredas "bases" of musi-
cal structures?Briefly,this is what is meant: if a particular "slice"
made of auditory experience consists of an ordered array of pitch
events,a "musicalstructure"may be inferredas theglobal interpreta-
tion of thisarrayby means of a series of more local partitionsof the
array into proper subsetsof pitches(or even intojust a singlesubset
equivalent to the whole, but that is in one respecta trivialand in an-
other respect a nonstandard instance). These partitioningsare not
necessarilylimitedby temporaladjacency; and all partitioningsof the
actual pitchdata are conceived in termsof some inferredpartitioning
of the pitch or the pitch-classdomain which functionsas a unitary
referent(in dimensionand content,or dimension,content,and order)
foreverypartitioningsubsetof the presentedarray.Referenceto this
referentis enabled throughinferenceof a delimitedset of mapping
functions(e.g., "transposition")bymeans of whichthe "isomorphism"
of the array-partitioningsets to the referentialset and to one another
can be asserted. The sequences in whichsuch mapping functionsare
applied, and the rationale through which their successive applica-
* 27 -
2
I.e., dimension of B = dimension of C; thus,while the "referenceset" definesjust
the referential-aspect dimension of compared subsetsof "primarydegree," here that
referential-aspectdimension (i.e., distinctelement-typedimension) is, in fact,identical
with the token-dimensions of the membersof this particulararray of "primary-degree"
subsets.
29
B-C ={w}
C-B ={t}
B+C ={w, t}
and, of course, $ (B) and $(C) will have the same dimension and:
(B) = {{ } {w}, {x}, {
, {},},, }w,z} {w, , {w } w z, , { }, x, z},
, { , x, wy
{y, z} , { , x, z} , {w, , z}, {w,, x,
y, , y,, z}}
$(C) = {{ }, {x}, {y}, {z}, {t}, {x, y}, {x, z}, {x, t}, {y, z}, {y, t},
{z, t, {x, y,{x,
z},
z {x, t}, x , {, y, z, t}, {x, y, z, t}}
, t}
x, y,
and:
83(B) n (C) = {{ } , {y},{z, {x, y}, {x, z}, {y, z}, {x, y, z}}
{y},
$(B) - (C) = {{w}, {, , {, , ,, {w, z},z, {w,w, x, y},x,{w,
w, x, z},
{w, y, z}, {w, x, y, z}}
$(C) - $(B)= {{t}, {x, t}, {y, t}z,{z, t}, {x, y, t}, {x, z, t}, {y, z, t},
{x, y, z, t}}
3(B) + (C) = {{t}, {w}, {w, x}, {w, y}, {w, z}, {x, t}, {y, t}, {z, t},
{w, x, y}, {w, x, z}, {w, y, z}, {x, y, t}, {x, z, t}, {y, z, t}, {w, x, y, z},
{x, y, z, t}}.
Similar observationscould be made regardingthe number and con-
tent of all possible subsetsof S of the given reference-aspectdimen-
sion (since the reference dimension is regarded as definingthe refer-
ence-aspect dimension of a maximum relevantsubset of S; all larger
subsetsare "described"as multiplerepresentationsof such a subsetor
"compositions"of several such subsets,as: {w, x, y,z, t} maybe "un-
derstood" as B U C, etc.,but notas a potentiallyprimary"syntactical"
subset in itself),withinthe total set S (the totalpitcharray). S itselfis
thus alwaysdescribableas one instanceof a successionof instancesof
the referenceset (i.e.,of definedtransformations of the referenceset);
each such description occupies a "structurallevel," and a conse-
quentially ordered succession (or "nest") of such descriptionscon-
stitutes"the structure"of the S in question.
If the element typesare quantizationallyinterpretedas, e.g., pitch
classes, then the referenceset may specifynot only token-and con-
tent-dimensionbut also content-relation; and operations may be de-
fined,forany two subsetsof a givensyntactically relevantsubset-type,
to determinetheircontent-relationalisomorphism.3'4
3These operations, like every theoreticalterm defined on a set of primitivesin a
system,serve to reduce the number of distinctvocabularyelementsby assertingfunc-
tional correlationsfor classes of such elements. Thus every sound-tokenin an array
must be taken as a distinctpitch element before the assertionof the propertyof pitch
whichreduces the numberof distinctelementtypesbyitsapplication.Similarly,
identity,
before intervalidentityis asserted,everydistinctpitchpair is a "different
interval"(since
intervalis just "the relationdeterminedby two pitches").Again, reductionin vocabu-
lary(distinctintervaltypes)and increasein functionality (multiplepossible [distinguish-
* 30 -
Thus, in our present example, we can describe not only the degree
(amount) of pitchintersection, but the identity(pitchcontent)thereof,
though not its relational nature (intervalcontent):
if B - C = {w}
and C-B = {t}
and D = {v,w,x,y}
so that B - D = {z}
and D- B = {v}
and C - D = {z,t}
and D - C = {v,w}
then we can assert a hierarchyof "degrees of closeness" and one of
"kindsof closeness"among B, C, and D. If A is the referenceset,and
A is {u,v,w,x},then we can also assert"closeness to A," definedas the
inverseof "differencefromA." So, if E is a presented subsetin S, and
E = {u,v,x,y, then
A-E={ }
and A - E.
In this case, we can "map" E into A by an identity operation. But we
have no way of mapping B, C, or D into A or into each other; forour
specificationtellsus only of the identity-nature
of the intersection,not
for {u,v,w,x,y,z,t}
its relation-nature; could be anypitches.
Thus,
if u = 0, v = 3, w= 4, x = 6, y = 8, z = 9, t = 1,
then A = {0,3,4,6}
B= {4,6,8,9}
C= {6,8,9,1}
D= {3,4,6,8}
E = {0,3,4,6}
all the relations described above stillhold, even though there is no
transpositionthatwillmap any twononidenticalsetsintoone another.
When complementationis added, B = TO I (D),5 but no similarrela-
tion exists among any other pair, even though they can clearlybe
ranked in "degree"-of-intersection
hierarchywithrespecttoA:
A= 0,3,4,6}
1. E = {0,3,4,6} ("0 different")
2. D = {3,4,6,8} ("1 different")
3. B = {4,6,8,9} ("2 different")
4. C = {6,8,9,1} ("3 different")
And each could be a "referenceset" fora similararrangementof the
others; also the "identities could order an arrayeven
of the differences"
where more than one set had an equivalentamountof differencefrom
the reference:
if F ={ 11,0,3,4} ("1 different")
G = {10,11,0,3} ("2 different")
H= {7,10,11,0} ("3 different")
then the "arraywithrespect to A" would look as follows:
H G F E D B C6
A
for F-- D = {11,O}
and F- = 6,8} ("2 elementsdifferent")
while D-C= (3,4)
and C - D = {9,1} ("2 elementsdifferent")
5 TOI
(D) = "The transposition-zeroset of the mod-n complementset of D."
6 Here the "identitiesof differencefromA" are associated withrelativeamounts of
intersectionamong the sets being compared to A; hence the "linearity"of the array.
If, for example, there were a set I whose contentswere {2,0,3,4}, it would create a
new "path," which mightor mightnot 'join" one of the other paths at some point:
FF <-- E--,
E D
(A)
32
* 34
* 35 -
9
Althoughthe relationsalso maintainto withinvarioussegmental
determinations
under the "M"-operations
so called and describedin Winham[41], and variously
namedin Howe [16],and Forte[15].
36
SyntacticalOperations:
If A is a set, and (x, y) is any member of A, then
1. [(((foq(x)), y)= (z, t)) - (z, t) E PqA]
2. - (z,
[(((flq(x)), y) = (z, t)) t) E RqA]
3. [(((x, (foq(y)))= (z, t)) - (z, t) E TqA]
4. [((x, (flq(y)))= (z, t)) (z, t) E IqA]
where foi(x)= (x + i) (mod (s + 1))
and fli(x)= (i - x) (mod (s + 1))
and foi(y)= (y + i) (mod (w + 1))
and fli(y)= (i- y) (mod (w + 1))
and where s is the dimensionof A, and w is the dimensionof the domain over
which,for all members (p, q) of A, q ranges.
Comment: Note thattheserules incorporatethe principlethatwe "compare,"
as "referentialsets"or "macrosets"or "subsets"-i.e., at any given "structural
level"-only sets of equal dimension (as presentedor "canonically"reduced).
Syntactic operations are restrictedto uniformoperationson the entirecontents
of sets of the relevantdimensional degree.
Definitions:
Let A be an ordered pitchsetand (x, y) be an ordernumber pitchnumber couple.
Then,
1. If B is an ordered pitchset,A and B are ordercomparable if,forall y such
that(x, y) is a memberof A, thereis a z such thatfor some q (fnq(x))= z,
where n = 0 or n = 1, and (z, t) is a memberof B, and t is equivalentto y.
2. If B is an ordered pitchset,A and B are orderdifferentiable if A and B are
ordercomparable and thereexistsan (x, y) such that(x, y) is a memberof A
and there is no (z, t) such that (z, t) is a member of B and x = z and t is
equivalent to y.
3. If B is an ordered pitchset, A and B are content differentiableifthereexists
a y such that forsome x such that(x, y) is a memberof A theredoes not
exist a q such thatfor some p (p, q) is a memberof B and y is equivalent
to q.
Comment: All ordered pitch sets of equal token-dimensionor of equal con-
tent-dimensionare content comparable.10
4. Cq is the q-levelsyntacticcontentarrayofA if
A
Cq = {(TqA), (IqA)}
A
5. Cq + 1 is the q + 1-levels.c.a. ofA if
A
CqA + 1= {(Tq +lA), (Iq + 1A)}
6. AA is the maximalsyntactic
content
arrayofA if
AA = {{Cq}, {Cq + 1}, ,Cq + n}} where n = w (see above)
A A
* 37 -
orderarrayofA if
7. Oq is the q-levelsyntactic
A
8. Oq is the (q + 1)-levelsyntactic
orderarrayofA if
A
=
Oq + 1 {(Pq + IA), (Rq+lA)}
A
9. HA is the maximalsyntacticorderarrayofA if
HA = {{Oq}, {Oq +41}, ... ,{Oq + n}} where n = s (see above, p. 37)
A A A
10. Xp, q is the p, q-levelsyntactic
arrayofA if
A
Xp,
A
q = {{Cq},J
{Cq}}
K
where, for all D and all
r, Cr is the r-levelsyntacticcontentarray of D, and
D
whereJ = (PpA) and K = (RpA)
11. FA is the maximalsyntactic
arrayofA if
rA = {{Xp, q}, {Xp,q + ...XP A q +, n}
n}, 1{X + , q},
A A A
... ,{Xp + m, q + n}} where m = s and n= w (see above, p. 37)
A
12. If FQis a maximalsyntacticarray,then: FQis primary iffor
content-generated
all ordered pitch sets A such thatA is a memberof the syntacticarrayX
and X is a memberof rQ,thereexistsa B such thatB is a memberof S and
S is a member of FQ and A and B are contentdifferentiable.
13. FQ isprimary order-generated if forall ordered pitchsets A and all ordered
pitchsets B, if A is a memberof a syntacticarrayX and X is a memberof
FQ,then,if B is a memberof a syntacticarrayY and Y is a memberof FQ,
then A and B are order comparable and there exists an ordered pitch
set C such thatthere existsa syntacticarrayZ such thatZ is a memberof
FQ and C is a member of Z, and A and C are order differentiable.
14. FQ is uniquelyprimary order-generatedif FQ is primaryorder-generatedand,
forall ordered pitchsets A such thatthereexistsa syntacticarrayX such
thatX is a memberof rQand A is a memberof X, ifthereexistsan (order
number) x and thereexistsa (pitchclass) y such that(x, y) is a memberof
A, then,forall (order numbers)z and all (pitchclasses) t ift is equivalent
to y then (z, t) is not a memberof A, or there is a (are) syntacticalrule(s)
whose application resultsin a set B for which the stipulatedconditions
hold.
From the foregoingit followsthat:
A. FQis primarycontent-generatediffforall ordered pitchsets S such thatS
is a memberof a syntacticarrayX and X is a memberof FQ,and n is the num-
ber of distinctpitch-classelements contained in S, then if m is the total
number of distinctpitch-classelementscontained in the union of all ordered
pitchsets thatare membersof syntacticarrayscontained in FQ,m is equal toor
greaterthann + 1.
Comment: In other words, in order for a syntaxto be pitch-classcontent
determinateat the primary level, the referentialpitch-classcollectionmustbe
a proper subsetof (fail to containat leastone elementcontainedin) the refer-
* 38
then the dimensionof S' is equal to or less than n -1 and m =(q r) where
q is the number of membersof nA contained as proper segmentsin the
array {S + S} and r is the differencebetween(s- 1) 2 and the dimension
of HA' where s is the dimension of S'.
Comment: All syntacticarraysare either primarycontent-orprimaryorder-
generated, but none is both. An array may be partiallycontent-or partially
order-generatedat given array-levelswhetherit is primaryorder-or primary
content-generated,but never both partiallycontent- and partiallyorder-
generated at the same levels (i.e., with respect to the same internalarrays).
Here followtwo models thatsatisfythe above conditionsfora domain of four
elements,one primarycontent-generatedand one primaryorder-generated.
Domain: {0, 1, 2, 3}
Let A be an ordered pitch set whose membersare (0, 0), (1, 2), (2, 1), repre-
sented below as (0 2 1). Then
AA is:
(TA = (O 2 1)) C0 (IA = (O 2 3))
A
(T1A= (1 3 2)) C1 (I1A= (1 3 0))
A
(T2A= (2 0 3)) C2 (12A= (2 0 1))
A
(T3A = (3 1 0)) C3 (I3A = (3 1 2))
A
and HA is:
(P0A =(O 2 1)) 00 (ROA = (0 1 2))
A
(P1A = (1 0 2)) 01 (R1A= (2 0 1))
A
(P2A = (2 1 0)) 02 (R2A = (1 2 0))
A
and FA is:
(XO, = ((0 2 1), (0 2 3)), ((0 1 2), (0 3 2)))
A
(X0, 1 = ((1 3 2), (1 3 0)), ((1 2 3), (1 0 3)))
A
(X0, 2 = ((2 0 3), (2 0 1)), ((2 3 0), (2 1 0)))
A
(X0,A3 = ((3 1 0), (3 1 2)), ((3 0 1), (3 2 1)))
(Xl,A 0 = ((1 0 2), (3 0 2)), ((2 0 1), (2 0 3)))
(X1,A 1 = ((2 1 3), (0 1 3)), ((3 1 2), (3 1 0)))
(XI,A 2 = ((3 2 0), (1 2 0)), ((0 2 3), (O 2 1)))
(X, 3 = ((0 3 1), (2 3 1)), ((1 3 0), (1 3 2)))
A
(X2,A 0 = ((2 1 0), (0 3 2)), ((1 2 0), (3 2 0)))
(X2,A 1 = ((3 2 1), (1 0 3)), ((2 3 1), (O 3 1)))
(X2, 2 = ((0 3 2), (2 1 0)), ((3 0 2), (1 0 2)))
(X2, 3 = ((1 0 3), (3 2 1)), ((0 1 3), (2 1 3)))
A
* 40 ?
Let B be an ordered pitch set whose membersare (0, 0), (1, 2), (2, 1), (3, 3),
representedbelow as (0 2 1 3). Then AB is:
(TOB = (0 2 1 3)) C0
B
(IOB = (0 2 3 1))
(T1B= (1 3 2 0)) C1
B
(I1B = (1 3 0 2))
(T2B = (2 0 3 1)) C2
B
(I2B = (2 0 1 3))
(T3B = (3 1 0 2)) C3
B
(I3B = (3 1 2 0))
and nB is:
(POB = (0 2 1 3)) 00B (RB = (0 3 1 2))
(P1B = (3 0 2 1)) 01
B
(R1B = (2 0 3 1))
(P2B = (1 3 0 2)) 02
B
(R2B =(1 2 0 3))
(P3B = (2 1 3 0)) 03 (R3B = (3 1 2 0))
B
and FB is:
(X0,B 0 = ((0 2 1 3), (02 3 1)), ((0 3 1 2), (0 1 3 2)))
(X0, 1 = ((1 3 2 0), (1 3 0 2)), ((1 0 2 3), (1 2 0 3)))
B
(X0,2 = ((2 03 1), (20 1 3)), ((2 1 30),(2 3 1 0)))
B
(X0, 3 = ((3 1 0 2), (3 1 2 0)), ((3 20 1), (3 0 2 1)))
B
(X1, 0= ((3 0 2 1), (1 0 2 3)), ((2 0 3 1), (2 0 1 3)))
B
(XI,B 1= ((0 1 3 2), (2 1 3 0)), ((3 1 0 2), (3 1 2 0)))
(X1,B 2 = ((1 2 0 3), (320 1)), ((0 2 1 3), (0 2 3 1)))
(X1, 3 = ((2 3 1 0), (0 3 1 2)), ((1 3 2 0), (1 3 0 2)))
(X2, 0 = ((1 3 0 2), (3 1 0 2)), ((1 2 0 3), (3 2 0 1)))
B
(X2,1 = ((2 0 1 3), (0 2 1 3)), ((2 3 1 0), (0 3 1 2)))
(X2, 2 = ((3 1 2 0), (1 3 2 0)), ((3 0 2 1), (1 0 2 3)))
B
(X2, 3 = ((0 2 3 1), (2 0 3 1)), ((0 1 3 2), (2 1 3 0)))
(X3, 0 = ((2 1 3 0), (2 3 1 0)), ((3 1 2 0), (1 3 2 0)))
B
. 41 ?
REFERENCES
[15] Forte, Allen: "A Theory of Set Complexes." JournalofMusic Theory,
Winter,1964.
[16] Howe, Jr., Hubert S.: "Some Combinational Properties of Pitch
Structures." PERSPECTIVES OF NEW MUSIC, Spring, 1963.
[41] Winham, Godfrey: "Henry Weinberg: Three Songs." PERSPECTIVES
OF NEW MUSIC, Spring-Summer, 1964.
* 42 ?