Induction is not derivable in second order dependent type theory

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2044 LNCS, Issue , 2001, Pages 166-181

  Geuvers, Herman ^a  

^a RADBOUD UNIVERSITY NIJMEGEN   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

BIOMINERALIZATION; ENCODING (SYMBOLS); PATHOLOGY; SIGNAL ENCODING; TREES (MATHEMATICS);

AXIOM OF CHOICE; CHURCH NUMERALS; COMBINATORY ALGEBRAS; COUNTER-MODELS; DEPENDENT TYPE THEORY; INDUCTION PRINCIPLES; MODEL CONSTRUCTION; NATURAL NUMBER;

FORMAL LANGUAGES;

EID: 84888881158     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45413-6_16     Document Type: Conference Paper

References (12)

1. H.P. Barendregt, Combinatory Logic and the Axiom of Choice, in Indagationes Mathematicae, vol. 35, nr. 3, pp. 203-221.
2. H.P. Barendregt, Typed lambda calculi. In Handbook of Logic in Computer Science, eds. Abramski et al., Oxford Univ. Press.
3. S. Berardi, Encoding of data types in Pure Construction Calculus: a semantic justification, in Logical Environments, eds. G. Huet and G. Plotkin, Cambridge University Press, pp 30-60.
4. Th. Coquand, Metamathematical investigations of a calculus of constructions. In Logic and Computer Science, ed. P.G. Odifreddi, APIC series, vol. 31, Academic Press, pp 91-122.
5. Th. Coquand and G. Huet, The calculus of constructions, Information and Computation, 76, pp 95-120.
6. J.H. Geuvers, Logics and Type systems, Ph.D. Thesis, University of Nijmegen, Netherlands.
7. J.H. Geuvers, Extending models of second order logic to models of second order dependent type theory, Computer Science Logic, Utrecht, eds. D. van Dalen and M. Bezem, LNCS 1258, 1997, pp 167-181.
8. J.M.E. Hyland and C.-H. L. Ong, Modified realizability toposes and strong normalization proofs. In Typed Lambda Calculi and Applications, Proceedings, eds. M. Bezem and J.F. Groote, LNCS 664, pp. 179-194, Springer-Verlag, 1993.
9. J.-Y. Girard, Y. Lafont and P. Taylor, Proofs and types, Camb. Tracts in Theoretical Computer Science 7, Cambridge University Press.
10. G. Longo and E. Moggi, Constructive Natural Deduction and its "Modest" Interpretation. Report CMU-CS-88-131.
11. M. Stefanova and J.H. Geuvers, A Simple Model Construction for the Calculus of Constructions, in Types for Proofs and Programs, Int. Workshop, Torino, eds. S. Berardi and M. Coppo, LNCS 1158, 1996, pp. 249-264.
12. T. Streicher, Independence of the induction principle and the axiom of choice in the pure calculus of constructions, TCS 103(2), pp 395-409.