Classical Modal Display Logic in the Calculus of Structures and Minimal Cut-free Deep Inference Calculi for S5

We begin by showing how to faithfully encode the Classical ModalDisplay Logic (CMDL) of Wansing into the Calculus of Structures(CoS) of Guglielmi. Since every CMDL calculus enjoys cut-elimination,we obtain a cut-elimination theorem for all corresponding CoScalculi. We then show how our result leads to a minimal cut-freeCoS calculus for modal logic S5. No other existing CoS calculifor S5 enjoy both these properties simultaneously.     

Constructive Membership Predicates as Index Types

In the constructive setting, membership predicates over recursive types are inhabited by terms indexing the elements that satisfy the criteria for membership. In this paper, we motivate and explore this idea in the concrete setting of lists and trees. We show that the inhabitants of membership predicates are precisely the inhabitants of a generic shape type. We show that membership of x (of type T) in structure S, (x_TS) can not, in general, index all parts of a structure S and we generalize to a form ρS where ρ is a predicate over S. Under this scheme, (λx.True)S is the set of all indexes into S, but we show that not all subsets of indexes are expressible by strictly local predicates. Accordingly, we extend our membership predicates to predicates that retain state “from above” as well as allow “looking below”. Predicates of this form are complete in the sense that they can express every subset of indexes in S. These ideas are motivated by experience programming in Nuprl's constructive type theory and examining the constructive content of mechanically checked formal proofs involving membership predicates.     

Dynamics of Flexible Multibody Systems Using Virtual Work and Linear Graph Theory

By combining linear graph theory with the principle of virtualwork, a dynamic formulation is obtained that extends graph-theoreticmodelling methods to the analysis of flexible multibody systems. Thesystem is represented by a linear graph, in which nodes representreference frames on rigid and flexible bodies, and edges representcomponents that connect these frames. By selecting a spanning tree forthe graph, the analyst can choose the set of coordinates appearing inthe final system of equations. This set can include absolute, joint, orelastic coordinates, or some combination thereof. If desired, allnon-working constraint forces and torques can be automaticallyeliminated from the dynamic equations by exploiting the properties ofvirtual work. The formulation has been implemented in a computerprogram, DynaFlex, that generates the equations of motion in symbolicform. Three examples are presented to demonstrate the application of theformulation, and to validate the symbolic computer implementation.     

On the probability theory on MV algebras

 The paper contains a review of some results concerning probability theory on MV algebras (laws of large numbers, central limit theorem, martingale convergence theorem). Also some algebraic and methodical aspects are discussed.     

On the rate of heterogeneous catalytic reactions with ionic intermediates

A facile way to compute the rate law of a catalytic reaction with ionic intermediates is proposed, based on the theory of complex reactions. When the ionic nature of intermediates is taken into account it is necessary to add balance equations which correspond to the electroneutrality of the catalyst. Several mechanisms of the olefin hydrogenation were considered as examples.     

樟村坪磷矿房柱采矿法采场稳定性研究

用有限元法、块体理论及刚度法对樟村坪磷矿采场伪稳定性进行了研究,其结果与现场实际基本相符。     

Denotation and connotation in the human – computer interface: The ‘Save as …’ command

This paper presents a semiotic technique as a means of exploring meaning and understanding in interface design and use. This is examined through a study of the interaction between the ‘file’ metaphor and ‘save as’ command metaphor. The behaviour of these (from a functional or computational basis) do not exactly match, or map onto, the meaning of the metaphor. We examine both the denotation of a term to the user, i.e. its literal meaning to that person, and the term's connotations, i.e. any other meanings associated with the term. We suggest that the technique applied is useful in predicting future problems with understanding the use of metaphor at the interface and with designing appropriate signification for human-computer interaction. Variation in connotation was expected but a more fundamental difference in denotation was also uncovered. Moreover, the results clearly demonstrate that consistency in the denotation of a term is critical in achieving a good user understanding of the command.