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
Stabilization — an alternative to double-negation translation for classical natural deduction
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. 167 - 199Publisher: Cambridge University PressPrint publication year: 2006
References
[1] , A normalization-procedure for the first order classical natural deduction with full logical symbols, Tsukuba Journal of Mathematics, vol. 19 (1995), no. 1, pp. 153–162.Google Scholar
[2] , Church-Rosser property of a simple reduction for full first-order classical natural deduction, Annals of Pure and Applied Logic, vol. 119 (2003), pp. 225–237.Google Scholar
[3] , , and , A notion of classical pure type system (preliminary version),Proceedings of the thirteenth conference on the mathematical foundations of programming semantics ( and , editors), Electronic Notes in Theoretical Computer Science, vol. 6, Elsevier, 1997, 56 pp.
[4] and , Automatic synthesis of typed programs on term algebras, Theoretical Computer Science, vol. 39 (1985), pp. 135–154.Google Scholar
[5] , A CPS-translation of the calculus, Trees in algebra and programming - CAAP‘94, 19th international colloquium (Edinburgh) (, editor),Lecture Notes in Computer Science, vol. 787, Springer Verlag, 1994, pp. 85–99.
[6] , A simple calculus of exception handling Proceedings of the second international conference on typed lambda calculi and applications (TLCA '95), Edinburgh, United Kingdom, April 1995 ( and , editors), Lecture Notes in Computer Science, vol. 902, Springer Verlag, 1995, pp. 201–215.
[7] , Strong normalization of classical natural deduction with disjunction,Proceedings of TLCA 2001 (, editor), Lecture Notes in Computer Science, vol. 2044, Springer Verlag, 2001, pp. 182–196.
[8] , Domain-free calculus, RAIRO - Theoretical Informatics and Applications, vol. 34 (2000), pp. 433–466.Google Scholar
[9] , Inductive and coinductive types with iteration and recursion, Proceedings of the workshop on types for proofs and programs, Bastad, Sweden (Bengt Nordström, Kent Pettersson, and Gordon Plotkin, editors), 1992, only published via ftp://ftp.cs.chalmers.se/pub/cs-reports/baastad.92/proc.dvi.Z, pp. 193–217.
[10] , Interprétation fonctionnelle et élimination des coupures dans l'arithm étique d'ordre supérieur, Thse de Doctorat d‘Etat, Université de Paris VII, 1972.
[11] , An embedding of 2nd order classical logic into functional arithmetic FA2, Comptes Rendus de l'Académie des Sciences. Série I. Matheématique, vol. 325 (1997), pp. 1–4.Google Scholar
[12] , Extensions of system F by iteration and primitive recursion on monotone inductive types, Doktorarbeit (PhD thesis), University of Munich, 1998, available via the homepage http://www.tcs.informatik.uni-muenchen.de/matthes/.
[13] ,Monotone fixed-point types and strong normalization,Computer science logic, 12th international workshop, Brno, Czech republic, August 24–28, 1998, proceedings (, , and , editors), Lecture Notes in Computer Science, vol. 1584, Springer Verlag, 1999, pp. 298–312.
[14] , Parigot's second order calculus and inductive types,Proceedings of TLCA 2001 (, editor), Lecture Notes in Computer Science, vol. 2044, SpringerVerlag, 2001, pp. 329–343.
[15] , Non-strictly positive fixed-points for classical natural deduction, Annals of Pure and Applied Logic, vol. 133 (2005), pp. 205–230.Google Scholar
[16] , Recursive types and type constraints in second-order lambda calculus, Proceedings of the second annual IEEE symposium on logic in computer science, Ithaca, N.Y., IEEE Computer Society Press, 1987, pp. 30–36.
[17] and , Strong normalization proof with CPS-translation for second order classical natural deduction, The Journal of Symbolic Logic, vol. 68 (2003), no. 3, pp. 851–859, Corrigendum: vol. 68 (2003), no. 4, pp. 1415–1416.Google Scholar
[18] , calculus: an algorithmic interpretation of classical natural deduction,Logic programming and automated reasoning, international conference LPAR‘92, , Russia (, editor), Lecture Notes in Computer Science, vol. 624, Springer Verlag, 1992, pp. 190–201.
[19] , Strong normalization for second order classical natural deduction, Proceedings, eighth annual IEEE symposium on logic in computer science (Montreal,Canada), IEEE Computer Society Press, 1993, pp. 39–46.
[20] , Proofs of strong normalisation for second order classical natural deduction, The Journal of Symbolic Logic, vol. 62 (1997), no. 4, pp. 1461–1479.Google Scholar
[21] , Définitions inductives en théorie des types d'ordre supérieur, Habilitation adiriger les recherches, Universite Claude Bernard Lyon I, 1996.
[22] , Natural deduction. a proof-theoretical study., Almquist andWiksell, 1965.
[23] , Ideas and results in proof theory, Proceedings of the second Scandianvian logic symposium (, editor), North-Holland, Amsterdam, 1971, pp. 235–307.
[24] and , The calculus, Theoretical aspects of computer software, international conference TACS '94, Sendai, Japan, proceedings ( and , editors), Lecture Notes in Computer Science, vol. 789, Springer Verlag, 1994, pp. 516–542.
[25] and , Type Fixpoints: Iteration vs. Recursion,SIGPLAN Notices, vol. 34 (1999), no. 9, pp. 102–113, Proceedings of the 1999 International Conference on Functional Programming (ICFP), Paris, France.
[26] , A realizability interpretation of the theory of species,Logic colloquium Boston 1971/72 (, editor), Lecture Notes inMathematics, vol. 453, Springer Verlag, 1975, pp. 240–251.
[27] , Parallel reduction in calculus, Information and Computation, vol. 118 (1995), no. 1, pp. 120–127.Google Scholar
[28] and , A cube of proof systems for the intuitionistic predicate, v-logic,Selected papers of the 8th nordic workshop on programming theory (NWPT '96), Oslo, Norway, December 1996 ( and , editors), Research Reports, Department of Informatics, University of Oslo, vol. 248, May 1997, pp. 237–246.
[29] and , Least and greatest fixed points in intuitionistic natural deduction, Theoretical Computer Science, vol. 272 (2002), pp. 315–339.Google Scholar
- 1
- Cited by