Research on collective provision of private goods has focused on distributional considerations. This paper studies a class of problems of decision under uncertainty in which an efficiency argument for collective choice emerges from the mathematics of aggregating individual payoffs. Consider decision making when each member of a population has the same objective function, which depends on an unk...

To tackle the problem with inexact, uncertainty and vague knowl- edge, constructive method is utilized to formulate lower and upper approx- imation sets. Rough set model over dual-universes in fuzzy approximation space is constructed. In this paper, we introduce the concept of rough set over dual-universes in fuzzy approximation space by means of cut set. Then, we discuss properties of rough se...

In a formal theory of induction, inductive inferences are licensed by universal schemas. In a material theory of induction, inductive inferences are licensed by facts. With this change in the conception of the nature of induction, I argue that the celebrated “problem of induction” can no longer be set up and is thereby dissolved. Attempts to recreate the problem in the material theory of induct...

We study the complexity of computable and Σ1 inductive definitions of sets of natural numbers. For we example, we show how to assign natural indices to monotone Σ1-definitions and we use these to calculate the complexity of the set of all indices of monotone Σ1-definitions which are computable. We also examine the complexity of a new type of inductive definition which we call weakly finitary mo...

Ineffective strategies of communicating about organizational change (e.g., corporate restructuring, mergers, downsizing) are earmarked by the presence of pervasive rumors that flourish in a climate of uncertainty. Using 15 structured field interviews with management and public relations personnel from multinational corporations, this article posits that successful programs of change communicati...

TIP is a toolbox for users and developers of inductive provers. It consists of a large number of tools which can, for example, simplify an inductive problem, monomorphise it or find counterexamples to it. We are using TIP to help maintain a set of benchmarks for inductive theorem provers, where its main job is to encode aspects of the problem that are not natively supported by the respective pr...

Let E be a finite alphabet and let W be the set of words on Z. A subset A of W is said to be generable if it is the closure of a computable inductive operator F over W; if F is monotone, then A is monotone generable. (The basic facts about inductive operators and about RE sets needed in this paper will be given in section one.) Now any generable set is RE and any RE set is I-i reducible to a (m...

There is considerable value in exploring whether and how a limited set of common health metrics, such as the ones presented in this supplement, can produce valid and reliable estimates of impact for global health and family planning. Through a shared vocabulary of transparent data elements drawn from routine service statistics, population-level measures, and measures of proven effect from rigor...

In this paper we present a comparison of several inductive programming (IP) systems. IP addresses the problem of learning (recursive) programs from incomplete specifications, such as input/output examples. First, we introduce conditional higher-order term rewriting as a common framework for inductive logic and inductive functional program synthesis. Then we characterise the several ILP systems ...

We consider one problem that was largely left open by Rudolf Carnap in his work on inductive logic, the problem of analogical inference. After discussing some previous attempts to solve this problem, we propose a new solution that is based on the ideas of Bruno de Finetti on probabilistic symmetries. We explain how our new inductive logic can be developed within the Carnapian paradigm of induct...