We consider the problem of higher-order matching restricted to the set of linear λ-terms (i.e., λ-terms where each abstraction λx.M is such that there is exactly one free occurrence of x in M). We prove that this problem is decidable by showing that it belongs to NP. Then we prove that this problem is in fact NP-complete. Finally, we discuss some heuristics for a practical algorithm.

In this note, we provide an affirmative answer to the title question by giving two examples of cardinals satisfying conditions implying they are non-Rowbottom which can be turned into Rowbottom cardinals via forcing. In our second example, our cardinal is also non-Jonsson. A well-known phenomenon is that under certain circumstances, it is possible to force over a given model V of ZFC containing...

Different theorem provers tend to produce proof objects in different formats and this is especially the case for modal logics, where several deductive formalisms (and provers based on them) have been presented. This work falls within the general project of establishing a common specification language in order to certify proofs given in a wide range of deductive formalisms. In particular, by usi...

Three recent demands on quantifier scoping algorithms have been that they should be explicitly stated, they should be sound and complete with respect to the input sentence [Hobbs and Shieber 1987] and they should not employ a 'Free Variable Constraint' [Pereira 1989]. The first demand is for good academic practice. The second is to ask for an algorithm that generates all and only the possible s...