Artifact 33cc36d331afbdfc962cc6bdb19c3da7cd703f45eb685ead06d16df1fa0b4ea0:

• Executable file r37/lisp/csl/html/r37_0285.html — part of check-in [f2fda60abd] at 2011-09-02 18:13:33 on branch master — Some historical releases purely for archival purposes

  git-svn-id: https://svn.code.sf.net/p/reduce-algebra/code/trunk/historical@1375 2bfe0521-f11c-4a00-b80e-6202646ff360 (user: arthurcnorman@users.sourceforge.net, size: 1118) [annotate] [blame] [check-ins using] [more...]

<A NAME=EXPANDLOGS>

<TITLE>EXPANDLOGS</TITLE></A>
<b><a href=r37_idx.html>INDEX</a></b><p><p>



<B>EXPANDLOGS</B> _ _ _  _ _ _  _ _ _  _ _ _ <B>switch</B><P>
<P>
 
 <P>
<P>
In many cases it is desirable to expand product arguments of logarithms, 
or collect a sum of logarithms into a single logarithm. Since these are 
inverse operations, it is not possible to provide rules for doing both at 
the same time and preserve the REDUCE concept of idempotent evaluation. 
As an alternative, REDUCE provides two switches <em>expandlogs</em> and 

<A HREF=r37_0272.html>combinelogs</A> to carry out these operations. Both are of
f by default. 
 <P> <H3> 
examples: </H3>
<P><PRE><TT>
on expandlogs; 

log(x*y); 

  LOG(X) + LOG(Y) 


on combinelogs; 

ws; 

  LOG(X*Y)

</TT></PRE><P><P>
<P>
At the present time, it is possible to have both switches on at once, 
which could lead to infinite recursion. However, an expression is 
switched from one form to the other in this case. Users should not rely 
on this behavior, since it may change in the next release. 
<P>
<P>
<P>