The problem of formalising continuous change within reasoning about action systems such as the situation calculus has recently been receiving increasing attention ((Rei96], MS96]). In this paper we show that a long-existing systems theoretic reasoning methodology, that of Zeigler's DEVS (discrete event system speciication), not only subsumes the standard situation calculus but is able to elegan...

In the seminal work [12] Retoré introduced Pomset logic, an extension of linear logic with a self-dual noncommutative connective. Pomset logic is defined by means of proof-nets, later a deep inference system BV [8] was designed for this extension, but equivalence of system has not been proven up to now. As for a sequent calculus formulation, it has not been known for either of these logics, and...

In this section we introduce an exponential homomorphism for the Milnor K -groups for a complete discrete valuation field of mixed characteristics. In general, to work with the additive group is easier than with the multiplicative group, and the exponential map can be used to understand the structure of the multiplicative group by using that of the additive group. We would like to study the str...

Using Serre’s adelic interpretation of the cohomology, we develop “differential and integral calculus” on an algebraic curve X over an algebraically closed constant field k of characteristic zero, define an algebraic analogs of additive and multiplicative multi-valued functions on X, and prove corresponding generalized residue theorem and A. Weil reciprocity law. Using the representation theory...

Lambeks Syntactic Calculus, commonly referred to as the Lambek calculus, was innovative in many ways, notably as a precursor of linear logic. But it also showed that we could treat our grammatical framework as a logic (as opposed to a logical theory). However, though it was successful in giving at least a basic treatment of many linguistic phenomena, it was also clear that a slightly more expre...

Full Intuitionistic Linear Logic (FILL) is multiplicative intuitionistic linear logic extended with par. Its proof theory has been notoriously difficult to get right, and existing sequent calculi all involve inference rules with complex annotations to guarantee soundness and cut-elimination. We give a simple and annotation-free display calculus for FILL which satisfies Belnap’s generic cutelimi...

Full Intuitionistic Linear Logic (FILL) is multiplicative intuitionistic linear logic extended with par. Its proof theory has been notoriously difficult to get right, and existing sequent calculi all involve inference rules with complex annotations to guarantee soundness and cut-elimination. We give a simple and annotation-free display calculus for FILL which satisfies Belnap’s generic cut-elim...

1. Overview: 4/1/13 1 2. Curves: 4/3/13 3 3. Discrete Curves: 4/8/13 5 4. The Definition of a Surface: 4/10/13 8 5. Surface Geometry: 4/15/13 9 6. Discrete Surfaces: 4/17/13 11 7. Extrinsic Curvature: 4/22/13 13 8. Computing Curvature: 4/24/13 14 9. Intrinsic Geometry: The Induced Metric and Geodesics : 4/29/13 17 10. 5/1/13 19 11. Covariant Differentiation: 5/6/13 19 12. Discrete Laplacians: 5...