It became clear by the 1930s that steps of formal computation are also steps of formal deduction as defined by recursion equations and other principles of arithmetic. This development began with attempts at giving a foundation to the laws of commutativity and associativity of sum: Followers of Kant's doctrine of the synthetic a priori in arithmetic, a certain Johann Schultz as foremost, missed ...

Let R be a ring with center Z, Jacobson radical J , and set N of all nilpotent elements. Call R semiperiodic if for each x ∈ R\ (J ∪Z), there exist positive integers m, n of opposite parity such that x − x ∈ N . We investigate commutativity of semiperiodic rings, and we provide noncommutative examples. Mathematics Subject Classification (2000). 16U80.

The notion of quantum weakest precondition was introduced by D’Hondt and P. Panangaden (Mathematical Structures in Computer Science 16(2006)429-451), and they presented a representation of weakest precondition of a quantum program in the operatorsum form. In this letter, we give an intrinsic characterization of the weakest precondition of a quantum program given in a systemenvironment model. Fu...

In this paper we study the Schur algebra of the induced representation of the Weil representation of a certain subgroup of GL 2 (C) and prove that it is commutative. It thus implies that the representation is multiplicity free.