Independence of the induction principle ad the axiom of choice in the pure calculus of constructions

Theoretical Computer Science

Volumn 103, Issue 2, 1992, Pages 395-408

  Streicher, Thomas ^a  

^a UNIVERSITY OF PASSAU   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY - FORMAL LANGUAGES; MATHEMATICAL MODELS;

AXIOM OF CHOICE; CALCULUS OF INSTRUCTIONS (COC); INDUCTION PRINCIPLE; PROOF BY CONTRADICTION;

AUTOMATA THEORY;

EID: 0026916283     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/0304-3975(92)90021-7     Document Type: Article

References (10)

1. Introduction to generalised type systems
2. The calculus of constructions
3. Une Sémantique catégorique des types dépendants. Application au calcul des constructions
4. Algebraic types in PER
5. Recursive realizability semantics for the calculus of constructions
6. Dependence and independence results for (impredicative) theories of dependent types
7. Semantics of Type Theory, Correctness, Completeness and Independence Results
8. Metamathematical Investigations of Intuitionistic Arithmetic and Analysis
9. Extensional Pers