Subverting a once widely held Quinean paradigm, there is growing consensus among philosophers of logic that higher-order quantifiers (which bind variables in the syntactic position predicates and sentences) are perfectly legitimate useful instrument logico-philosophical toolbox, while neither being reducible to nor fully explicable terms first-order singular term position). This article discuss...

The introduction of sorts to rst-order automated deduction has brought greater conciseness of representation and a considerable gain in eeciency by reducing the search space. It is therefore promising to treat sorts in higher order theorem proving as well. In this paper we present a generalization of Huet's Constrained Resolution to an order-sorted type theory T with term declarations. This sys...

In aspect-oriented programming languages, advice evaluation is usually considered as part of the base program evaluation. This is also the case for certain pointcuts, such as if pointcuts in AspectJ, or simply all pointcuts in higher-order aspect languages like AspectScheme. While viewing pointcuts and advice as base level computation clearly distinguishes AOP from reflection, it also comes at ...

Abstract We design a novel experiment to study how subjects update their beliefs about the of others. Three players receive sequential signals an unknown state world. Player 1 reports her state; 2 simultaneously 1; 3 2. say that exhibit higher-order learning if k $$k-1$$ k - 1...