Incentive-Based Instruments for Water Management

This report provides a synthesis review of a set of incentive-based instruments that have been employed to varying degrees around the world. It is part of an effort by The Rockefeller Foundation to improve understanding of both the potential of these instruments and their limitations. The report is divided into five sections. Section 1 provides an introduction to the synthesis review. Section 2 describes the research methodology. Section 3 provides background on policy instruments and detail on three incentive-based instruments -- water trading, payment for ecosystem services, and water quality trading -- describing the application of each, including their environmental, economic, and social performances, and the conditions needed for their implementation. Section 4 highlights the role of the private sector in implementing these instruments, and Section 5 provides a summary and conclusions

Adjoint exactness

Plato's ideas and Aristotle's real types from the classical age, Nominalism and Realism of the mediaeval period and Whitehead's modern view of the world as pro- cess all come together in the formal representation by category theory of exactness in adjointness (a). Concepts of exactness and co-exactness arise naturally from ad- jointness and are needed in current global problems of science. If a right co-exact valued left-adjoint functor ( ) in a cartesian closed category has a right-adjoint left- exact functor ( ), then physical stability is satis ed if itself is also a right co-exact left-adjoint functor for the right-adjoint left exact functor ( ): a a . These concepts are discussed here with examples in nuclear fusion, in database interroga- tion and in the cosmological ne structure constant by the Frederick construction

Don't confuse left and right exactness! A note correcting the distinction in the Proceedings of ANPA 27

A note correcting and enlarging on the distinction between the parities of exactness and adjointness in our paper Process as a World Transaction in the proceedings of ANPA 27

Anticipation as prediction in the predication of data types

Every object in existence has its type. Every subject in language has its predicate. Every intension in logic has its extension. Each therefore has two levels but with the fundamental problem of the relationship between the two. The formalism of set theory cannot guarantee the two are co-extensive. That has to be imposed by the axiom of extensibility, which is inadequate for types as shown by Bertrand Russell's rami ed type theory, for language as by Henri Poincar e's impredication and for intension unless satisfying Port Royal's de nitive concept. An anticipatory system is usually de ned to contain its own future state. What is its type? What is its predicate? What is its extension? Set theory can well represent formally the weak anticipatory system, that is in a model of itself. However we have previously shown that the metaphysics of process category theory is needed to represent strong anticipation. Time belongs to extension not intension. The apparent prediction of strong anticipation is really in the structure of its predication. The typing of anticipation arises from a combination of and | respectively (co) multiplication of the (co)monad induced by adjointness of the system's own process. As a property of cartesian closed categories this predication has signi cance for all typing in general systems theory including even in the de nition of time itself

Conditions for interoperability

Interoperability for information systems remains a challenge both at the semantic and organisational levels. The original three-level architecture for local databases needs to be replaced by a categorical four-level one based on concepts, constructions, schema types and data together with the mappings between them. Such an architecture provides natural closure as further levels are superfluous even in a global environment. The architecture is traversed by means of the Godement calculus: arrows may be composed at any level as well as across levles. The necessary and sufficient conditions for interoperability are satisfied by composable (formal) diagrams both for intension and extension in categories that are cartesian closed and locally cartesian closed. Methods like partial categories and sketches in schema design can benefit from Freyd’s punctured diagrams to identify precisely type-forcing natural transformations. Closure is better achieved in standard full categories. Global interoperability of extension can be achieved through semantic annotation but only if applied at run time

Female Labor Supply Differences by Sexual Orientation: A Semi-Parametric Decomposition Approach

Using 2000 U.S. Census data we illustrate the importance of accounting for household specialization in lesbian couples when examining the sexual orientation gap in female labor supply. Specifically, we find the labor supply gap is substantially larger between married women and partnered lesbian women who specialize in market production (primary earners) than between married women and partnered lesbian women who specialize in household production (secondary earners). Using a semi-parametric decomposition approach, we further show that the role of children in explaining the mean labor supply gap by sexual orientation is greatly understated if the household division of labor between household and market production is not taken into account. Finally, we illustrate that controlling for children significantly reduces differences between married women and secondary lesbian earners both in terms of the decision to remain attached to the labor market (the extensive margin), as well as in terms of annual hours of work conditional on working (the intensive margin). Further, the effect of controlling for children is not uniform across the distribution of conditional annual hours; instead it primarily reduces the percentage of secondary lesbian earners working extremely high annual hours.household specialization, female labor supply, sexual orientation

Process as a world transaction

Transaction is process closure: for a transaction is the limiting process of process itself. In the process world view the universe is the ultimate (intensional) transaction of all its extensional limiting processes that we call reality. ANPA’s PROGRAM UNIVERSE is a computational model which can be explored empirically in commercial database transactions where there has been a wealth of activity over the real world for the last 40 years. Process category theory demonstrates formally the fundamental distinctions between the classical model of a transaction as in PROGRAM UNIVERSE and physical reality. The paper concludes with a short technical summary for those who do not wish to read all the detail

Process categories: the metaphysics, methodology & mathematics, philosophy of nature and process philosophy

To apply the metaphysical methodology of mathematics to the logic and form of process in natural philosophy requires a metaphysics above modelling, a methodology more than method and a mathematics beyond the set based topics of arithmetic, algebra, geometry and topology. At the start of the twentieth century Alfred North Whitehead together with his former student Bertrand Russell was able to expound the form and logic of the mathematics of his day by the extensive treatment of axioms and theorems. The technical quality of this work found world acclaim and became the foundation for the advancement of science by the application of models still with us today