The Complexity of Inhabitation with Explicit Intersection

DOI10.1007/978-3-642-29485-3_16zbMath1354.68101OpenAlexW49615274MaRDI QIDQ2897957

Paweł Urzyczyn, Jakob Rehof

Publication date: 16 July 2012

Published in: Logic and Program Semantics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-29485-3_16

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Combinatory logic and lambda calculus (03B40)

Related Items (2)

Unnamed Item ⋮ On the Mints Hierarchy in First-Order Intuitionistic Logic

Uses Software

• Automath

This page was built for publication: The Complexity of Inhabitation with Explicit Intersection