Propositions represent the entities from which they are formed. This fact has puzzled philosophers and some have put forward radical proposals in order to explain it. paper develops a primitivist account of representational properties propositions that centers on operation application. As we will see, this theory wins out over its competitors grounds strength, systematicity unifying power.

The popularity of Machinima movies has increased greatly in the recent years. From a transmedia point of view, there was little development regarding tools to assist the production of Machinima. These are still mainly focused on the gaming community, and 3D animators. The developed tool aims to bring the typical workflow present on a normal movie set, into a machinima creation environment, expa...

وحدت وجود یکی از مهمترین باورهای عرفانی است که همواره چالشهای فراوانی را هم در عرصه دینداری و هم در عرصه تفکر فلسفی موجب شده است و ملاصدرا هم به عنوان مبدع یک نظام فلسفی به نام حکمت متعالیه، مدعی است که توانسته است این نظریه عرفانی را تبیین فلسفی نماید. اما بعدها در شرح مراد ملاصدرا اختلافاتی پدید آمد؛ برخی از پیروان این نظام فلسفی نظریه وحدت تشکیکی وجود را تنها تبیین معقول از نظریه وحدت وجود ع...

1. Preliminaries 1 2. Multiplicity free actions 8 3. Linear multiplicity free actions 15 4. Examples of multiplicity free decompositions 21 5. A recursive criterion for multiplicity free actions 33 6. The classification of linear multiplicity free actions 37 7. Invariant polynomials and differential operators 43 8. Generalized binomial coefficients 52 9. Eigenvalues for operators in PD(V ) 61 R...

While logic was once developed to serve philosophers and mathematicians, it is increasingly serving the varied needs of computer scientists. In fact, recent decades have witnessed the creation of the new discipline of Computational Logic. While Computation Logic can claim involvement in diverse areas of computing, little has been done to systematize the foundations of this new discipline. Here,...

We give deterministic polynomial-time algorithms that, given an order, compute the primitive idempotents and determine a set of generators for the group of roots of unity in the order. Also, we show that the discrete logarithm problem in the group of roots of unity can be solved in polynomial time. As an auxiliary result, we solve the discrete logarithm problem for certain unit groups in finite...