(In)consistency of Extensions of Higher Order Logic and Type Theory
From MaRDI portal
Publication:3612441
DOI10.1007/978-3-540-74464-1_10zbMath1178.03018OpenAlexW2125446785MaRDI QIDQ3612441
Publication date: 10 March 2009
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-74464-1_10
Related Items
Syntactic analysis of \(\eta\)-expansions in pure type systems., On explicit substitutions and names (extended abstract), Proving strong normalization of CC by modifying realizability semantics, Checking algorithms for Pure Type Systems, A short and flexible proof of strong normalization for the calculus of constructions, Is Impredicativity Implicitly Implicit, Tactics and Parameters, Computer theorem proving in mathematics, Strong Normalization with Singleton Types