Book contents
- Frontmatter
- Contents
- Introduction
- Colloquium Program
- TUTORIAL
- RESEARCH ARTICLES
- Indestructibility and strong compactness
- Some applications of regularmarkers
- Has the continuumhypothesis been settled?
- Geometry of interaction IV: the feedback equation
- On local modularity in homogeneous structures
- Descriptive set theory and uncountable model theory
- Decidable properties of logical calculi and of varieties of algebras
- Stabilization — an alternative to double-negation translation for classical natural deduction
- Definability and reducibility in higher types over the reals
- Predicativity problems in point-free topology
- Rank inequalities in the theory of differentially closed fields
- Consistency and games— in search of new combinatorial principles
- Realizability for constructive Zermelo-Fraenkel set theory
- On long EF-equivalence in non-isomorphic models
- The theory of is undecidable
- Cocovering and set forcing
- References
Geometry of interaction IV: the feedback equation
from RESEARCH ARTICLES
Published online by Cambridge University Press: 30 March 2017
Book contents
- Frontmatter
- Contents
- Introduction
- Colloquium Program
- TUTORIAL
- RESEARCH ARTICLES
- Indestructibility and strong compactness
- Some applications of regularmarkers
- Has the continuumhypothesis been settled?
- Geometry of interaction IV: the feedback equation
- On local modularity in homogeneous structures
- Descriptive set theory and uncountable model theory
- Decidable properties of logical calculi and of varieties of algebras
- Stabilization — an alternative to double-negation translation for classical natural deduction
- Definability and reducibility in higher types over the reals
- Predicativity problems in point-free topology
- Rank inequalities in the theory of differentially closed fields
- Consistency and games— in search of new combinatorial principles
- Realizability for constructive Zermelo-Fraenkel set theory
- On long EF-equivalence in non-isomorphic models
- The theory of is undecidable
- Cocovering and set forcing
- References
- Type
- Chapter
- Information
- Logic Colloquium '03 , pp. 76 - 117Publisher: Cambridge University PressPrint publication year: 2006
References
[1] and , Non-commutative logic I : the multiplicative fragment, Annals of Pure and Applied Logic, vol. 101 (2000), pp. 29–64.Google Scholar
[2] and , Domains and lambda-calculi, Cambridge Tracts in Theoretical Computer Science, vol. 46, Cambridge University Press, 1998.
[3] , Stable models of typed lambda-calculi, Proceedings of the 5th international colloquium on automata, languages and programming, Lecture Notes in Computer Science, vol. 62, Springer Verlag, 1978.
[4] , Non-commutative geometry, Academic Press, San Diego, CA, 1994.
[5] and , The structure ofmultiplicatives, Archive forMathematical Logic, vol. 28 (1989), pp. 181–203.Google Scholar
[6] and , Proof-nets and theHilbert space,Advances in linear logic (, and Regnier, editors), LondonMathematical Society Lecture Note Series, vol. 222, Cambridge University Press, 1995.
[7] , Hypercoherences : a strongly stable model of linear logic, Advances in linear logic (, and Regnier, editors), Cambridge University Press, Cambridge, 1995, pp. 83–108.
[8] , Towards a geometry of interaction,Categories in computer science and logic, Proceedings of Symposia in Pure Mathematics, no. 92, American Mathematical Society, Providence, 1988, pp. 69–108.
[9] , Geometry of interaction I : interpretation of system F, Logic colloquium '88 (Ferro, Bonotto, Valentini, and Zanardo, editors), North-Holland, Amsterdam, 1989, pp. 221–260.
[10] , Geometry of interaction II : deadlock-free algorithms,Proceedings of COLOG 88 (Martin-Löf and Mints, editors), Lecture Notes in Computer Science, vol. 417, Springer-Verlag, Heidelberg, 1990, pp. 76–93.
[11] , Geometry of interaction III : accommodating the additives, Advances in linear logic (, and Regnier, editors), Cambridge University Press, Cambridge, 1995, pp. 329–389.
[12] , Coherent Banach spaces : a continuous denotational semantics, Theoretical Computer Science, vol. 227 (1999), pp. 275–297.Google Scholar
[13] , Locus Solum, Mathematical Structures in Computer Science, vol. 11 (2001), pp. 301–506.Google Scholar
[14] , Between logic and quantic : a tract, Technical report, Institut de Mathématiques de Luminy, October 2003.
[15] ,, and , Proofs and types, Cambridge tracts in theoretical computer science, vol. 7, Cambridge University Press, Cambridge, 1990.
[16] , , and , The geometry of optimal lambda-reduction, POPL‘92 (ACM Press, editor), Birkhäuser, Boston, 1992.
[17] and , Fundamentals of the theory of operator algebras, vol. I, Pure andAppliedMathematics,Academic Press, 1983, (vol. III contains the solutions of exercises of vol. I).
[18] and , Fundamentals of the theory of operator algebras, vol. II, Pure and AppliedMathematics, Academic Press, 1986.
[19] , Mathematical logic, Lectures in modern mathematics, vol. III (, editor),Wiley & Sons, New York, 1965, pp. 99–105.
[20] , Towards a quantum computing language, Mathematical Structures in Computer Science, vol. 14 (2004), pp. 527–586.Google Scholar
- 1
- Cited by