On Reduction Systems Equivalent to The Lambek Calculus with the Empty String

The paper continues a series of results on cut-rule axiomatizability of the Lambek calculus. It provides a complete solution of a problem which was solved partially in one of the author's earlier papers. It is proved that the product-free Lambek Calculus with the empty string (L ₀) is not finitely axiomatizable if the only rule of inference admitted is Lambek's cut rule. The proof makes use of the (infinitely) cut-rule axiomatized calculus C designed by the author exactly for this purpose.     

Comparison of Return-on-Effort and Conventional Expectancy Theory Predictions of Work Effort and Job Performance: Results from Three Field Studies

It was predicted that a return-on-effort version of expectancy theory, an approach that examines the incremental benefits associated with increased effort, would yield superior predictions of work effort and job performance, in comparison with the conventional approach. Data were collected from the following three work settings: a manufacturing concern, a supermarket, and a bank. Unlike prior research that has uniformly found superior predictions using the return-on-effort model (and that has uniformly examined student samples), the present research found only modest support. Three possible boundary conditions were discussed—format effects, reward system responsiveness, and ability differences. The latter two, examined empirically via supplementary analyses, provided increased support for the return-on-effort model.     

后腹腔镜肾盂输尿管切开取石术34例临床体会

探讨后腹腔镜下肾孟、输尿管切开取石的技术要点和临床应用价值。回顾性分析34例后腹腔镜肾盂、输尿管切开取石术的临床质料。男22例,女12例,肾盂结石10例,输尿管结石24例。结果34例成功完成腹腔镜取石术,手术时间40min～90min,平均58min,术中出血10ml～30ml,术后1例漏尿3d,术后3d～5d拔除后腹...     

Program Extraction from Normalization Proofs

This paper describes formalizations of Tait's normalization proof for the simply typed λ-calculus in the proof assistants Minlog, Coq and Isabelle/HOL. From the formal proofs programs are machine-extracted that implement variants of the well-known normalization-by-evaluation algorithm. The case study is used to test and compare the program extraction machineries of the three proof assistants in a non-trivial setting.     

A Predicate Logical Extension of a Subintuitionistic Propositional Logic

We develop a predicate logical extension of a subintuitionistic propositional logic. Therefore a Hilbert type calculus and a Kripke type model are given. The propositional logic is formulated to axiomatize the idea of strategic weakening of Kripke's semantic for intuitionistic logic: dropping the semantical condition of heredity or persistence leads to a nonmonotonic model. On the syntactic side this leads to a certain restriction imposed on the deduction theorem. By means of a Henkin argument strong completeness is proved making use of predicate logical principles, which are only classically acceptable.     

An Exactification of the Monoid of Primitive Recursive Functions

We study the monoid of primitive recursive functions and investigate a onestep construction of a kind of exact completion, which resembles that of the familiar category of modest sets, except that the partial equivalence relations which serve as objects are recursively enumerable. As usual, these constructions involve the splitting of symmetric idempotents.     

A CRITIQUE OF BOROWITZ'S POSTMODERN JEWISH THEOLOGY

Abstract. Borowitz's book is primarily a systematic response by a liberal Jewish theologian to his perceived challenges from rationalism on one hand and postmodernism on the other. It is within this context that Borowitz discusses issues of the relationship between modern science and Judaism. The first part of this essay is a summary of Borowitz's book. Here I locate Borowitz's place in the general discipline of Jewish philosophy and theology. The second part of the paper is a critique of Borowitz's discussion of postmodernism and liberalism. It is in this concluding section that the issues raised by contemporary science for Jewish religious thought are discussed.