Simple Saturated Sets for Disjunction and Second-Order Existential Quantification
From MaRDI portal
Publication:3612644
DOI10.1007/978-3-540-73228-0_26zbMath1215.03068MaRDI QIDQ3612644
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-73228-0_26
03F05: Cut-elimination and normal-form theorems
Related Items
Unnamed Item, The existential fragment of second-order propositional intuitionistic logic is undecidable, Strong normalization results by translation, Inhabitation of polymorphic and existential types, Undecidability of Type-Checking in Domain-Free Typed Lambda-Calculi with Existence, Type-Based Termination with Sized Products, On the Values of Reducibility Candidates