This paper expands on, and provides a qualified defence of, Arthur Fine’s selective interactions solution to the measurement problem. Fine’s approach must be understood against the background of the insolubility proof of the quantum measurement. I first defend the proof as an appropriate formal representation of the quantum measurement problem. The nature of selective interactions, and more gen...

A tournament is a binary dominance relation on a set of alternatives. Tournaments arise in many contexts that are relevant to AI, most notably in voting (as a method to aggregate the preferences of agents). There are many works that deal with choice rules that select a desirable alternative from a tournament, but very few of them deal directly with incentive issues, despite the fact that gameth...

Voltage-dependent K channels like Shaker use an intracellular gate to control ion flow through the pore. When the membrane voltage becomes more positive, these channels traverse a series of closed conformations before the final opening transition. Does the intracellular gate undergo conformational changes before channel opening? To answer this question we introduced cysteines into the intracell...

Characterizations of paracompact finite C-spaces via continuous selections avoiding Zσ-sets are given. We apply these results to obtain some properties of finite C-spaces. Factorization theorems and a completion theorem for finite C-spaces are also proved.

In this paper, a primal-dual interior-point method equipped with various selections of the displacement step are derived for solving second-order cone programming problems. We first establish the existence and uniqueness of the optimal solution of the corresponding perturbed problem and then demonstrate its convergence to the optimal solution of the original problem. Next, we present four diffe...

In this paper we investigate minimal pairs of continuous selections of four linear functions in R3. Our purpose is to find minimal pairs of compact convex sets (polytops) which represent all 166 (see [2]) continuous selections in CS(y1, y2, y3,− ∑3 i=1 yi) in R 3. We find that these 166 selections are represented by 16 essentialy different minimal pairs which were studied in [5], [9]. Three out...

We introduce Lipschitz continuity of set-valued maps with respect to a given set difference. The existence of Lipschitz selections that pass through any point of the graph of the map and inherit its Lipschitz constant is studied. We show that the Lipschitz property of the set-valued map with respect to the Demyanov difference with a given constant is characterized by the same property of its ge...

We provide a general framework for declarative selection operations for complex object databases based on the safe calculus for complex objects Within this framework we consider a class of single pass evaluable selection operations We show how such selection operations can be succinctly expressed by programs that use only very simple positive existential selections Also a syntactic criterion is...

Growth, yield, and quality of 10 sweet potato selections and reproduction of the reniform nematode, Rotylenchulus reniformis, were studied in fumigated and nonfumigated plots in a naturally infested field. Nematode reproduction on the different selections in the field was similar to that reported in the greenhouse but was not related to the effect of the nematode on yield of the different selec...