We present a survey of the recent applications of continuous domains for providing simple computational models for classical spaces in mathematics including the real line, countably based locally compact spaces, complete separable metric spaces, separable Banach spaces and spaces of probability distributions. It is shown how these models have a logical and effective presentation and how they are used to give a computational framework in several areas in mathematics and physics. These include fractal geometry, where new results on existence and uniqueness of attractors and invariant distributions have been obtained, measure and integration theory, where a generalization of the Riemann theory of integration has been developed, and real arithmetic, where a feasible setting for exact computer arithmetic has been formulated. We give a number of algorithms for computation in the theory of iterated function systems with applications in statistical physics and in period doubling route to chao...

In this paper we describe an environment for reasoning about the reals which combines the rigour of a theorem prover with the power of a computer algebra system. 1 Introduction Computer theorem provers are a topic of research interest in their own right. However much of their popularity stems from their application in computeraided verification, i.e. proving that designs of electronic or computer systems, programs, protocols and crypto-systems satisfy certain properties. Such proofs, as compared with the proofs one finds in mathematics books, usually involve less sophisticated central ideas, but contain far more technical Supported by the Science and Engineering Research Council, UK. y Supported by SERC grant GR/G 33837 and a grant from DSTO Australia. details and therefore tend to be much more difficult for humans to write or check without making mistakes. Hence it is appealing to let computers help. Some fundamental mathematical theories, such as arithmetic, are usually requi...

. Computer algebra systems are extremely powerful and flexible, but often give results which require careful interpretation or are downright incorrect. By contrast, theorem provers are very reliable but lack the powerful specialized decision procedures and heuristics of computer algebra systems. In this paper we try to get the best of both worlds by careful exploitation of a link between a theorem prover and a computer algebra system. 1 Motivation In the HOL theorem prover[5], a theory of real numbers has been developed, using a rigorous definition in terms of Dedekind cuts [8]. It is therefore possible to apply HOL to areas traditionally within the purview of Computer Algebra Systems (CASs). This offers two main benefits. Firstly, theorem provers are designed to manipulate proofs and theorems in a coherent and structured way, with all concepts clearly defined. By contrast, most CASs have no concept of `logic' as such -- they usually take an algebraic expression and return another pur...

In this paper, we provide a representation theory for the Feynman operator calculus. This allows us to solve the general initial-value problem and construct the Dyson series.

Abstract — This paper deals with necessary and sufficient conditions to transform a class of switched systems to a particular form dedicated to observer design with and without zeno phenomena. Meanwhile, sufficient observability conditions for switched system with or without zeno phenomena are given. In the last section, some observer structures are proposed upon two academical examples. Index Terms — Zeno phenomena, switched system, observability. I.

This paper deals with the observability of a class of switched systems with Zeno phenomenon or high switching frequency. Particularly, three observability forms are proposed and the observability for each form with knowledge of filtered switching signal is analyzed. Meanwhile, sufficient and necessary conditions for the existence of a diffeomorphism to transform a class of switched systems into one of such forms are presented. Examples and simulations are given at the end to highlight the theoretical results.

Abstract not found

Executive summary: Well-written set of extended exercises that take the