Simple Saturated Sets for Disjunction and Second-Order Existential Quantification

DOI10.1007/978-3-540-73228-0_26zbMath1215.03068OpenAlexW1793317562MaRDI QIDQ3612644

Makoto Tatsuta

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

Mathematics Subject Classification ID

Cut-elimination and normal-form theorems (03F05)

Related Items (7)

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 ⋮ Unnamed Item ⋮ On the Values of Reducibility Candidates

This page was built for publication: Simple Saturated Sets for Disjunction and Second-Order Existential Quantification