that California implemented in 1988. We demonstrate that, following Proposition 99, tobacco consumption fell markedly in California relative to a comparable synthetic control region. We estimate that by the year 2000 annual per-capita cigarette sales in California were about 26 packs lower than what they would

true, they would have the same meaning and Cathy would bear the relation of regret to one of them precisely if she would bear that relation to the other. Thus the theory predicts that (2) follows from (1). This is absurd of course, and we may conclude that meanings are not simply truth values. Note

of solutions to the Dirichlet problem when Ω is an ellipsoid and the data f possess nice algebraic properties. Thus, we first present the following proposition.

sort from those generally accepted. This paper reports the results of a series of experiments designed to discredit the psychologists' works as applied to economics. The phenomenon is characterized by the following stylized example. Individuals under suitable laboratory conditions are asked

We present a basis for the admissible rules of intuitionistic propositional logic. Thereby a conjecture by de Jongh and Visser is proved. We also present a proof system for the admissible rules, and give semantic criteria for admissibility. 1 Introduction The admissible rules of a theory

In this paper it is shown that addition of certain reductions to the standard cut removing reductions of deductions in propositional logic makes propositional logic non-normalizable. From this follows that some provable propositions in propositional logic has no direct proof. Key words: Direct

this paper we reconsider the foundations of modal logic, following MartinL of's methodology of distinguishing judgments from propositions [ML85]. We give constructive meaning explanations for necessity (2) and possibility (3). This exercise yields a simple and uniform system of natural

Following a suggestion of Pratt, we consider propositional dynamic logic in which programs are nondeterministic finite automata o~¢er atomic programs and tests (i.e., flowcharts), rather than regular expressions. While the resulting version of PDL, call it APDL, is clearly equivalent in expressive

We first consider the case in which all signals are mutually independent. We use the following orders and inventory formulations: ot =µ + i t =m + l=0 õt,l, õt,l = ĩ t,l, ĩ t,l = i=−∞ l=0 i=0 (wi,l − wi+1,l)ɛt+L+i,l, wi+1,lɛt+i+1,l + (w−i,l − 1)ɛt−i,l. Accordingly, the firm’s objective is: min w i

and Kaplan. The resolution substantiates Frege’s suggestion that the cognitive significance of unambiguous, coreferential names may be distinct, yet it preserves the following views of Kaplan: (a) that names are directly referential, in the sense that no intermediate entities, such as senses, are required