论文信息 - The fixed point property in synthetic domain theory

The fixed point property in synthetic domain theory

An elementary axiomatization of synthetic domain theory is presented, and it is shown that it is sufficient to deduce the fixed point property and solve domain equations. The aim is to show that an important theorem can be derived from an abstract axiomatization, rather than from a particular model. Also, by providing a common framework in which both PER and classical models can be expressed, this work builds a bridge between the two.<<ETX>>

Paul Taylor | P. Taylor

[1] M. Makkai,et al. First order categorical logic , 1977 .

[2] Wesley Phoa,et al. Effective domains and intrinsic structure , 1990, [1990] Proceedings. Fifth Annual IEEE Symposium on Logic in Computer Science.

[3] J. Lambek,et al. Introduction to higher order categorical logic , 1986 .

[4] Dana S. Scott,et al. Data Types as Lattices , 1976, SIAM J. Comput..

[5] Giuseppe Rosolini,et al. Categories and Effective Computations , 1987, Category Theory and Computer Science.

[6] A. Kock. Synthetic Differential Geometry , 1981 .

[7] Paul Taylor. Homomorphisms, Bilimits and Saturated Domains (Some Very Basic Domain Theory) , 1987 .

[8] J. Hyland. The Effective Topos , 1982 .

[9] P. T. Johnstone. TOPOSES AND LOCAL SET THEORIES: AN INTRODUCTION (Oxford Logic Guides 14) , 1990 .

[10] A. Pitts. INTRODUCTION TO HIGHER ORDER CATEGORICAL LOGIC (Cambridge Studies in Advanced Mathematics 7) , 1987 .

[11] M. Fourman. The Logic of Topoi , 1977 .