It is argued that Ginsberg's Possible Worlds Approach to counterfactual implication suffers from a number of defects which are the result of confusing proof theory and model ...
Proofs and empirical evidence are presented which show that a subset of algorithms can have identical performance over a subset of functions, even when the subset of functions is ...
We show that the number of anti-lecture hall compositions of n with the first entry not exceeding k − 2 equals the number of overpartitions of n with non-overlined parts not con...
William Y. C. Chen, Doris D. M. Sang, Diane Y. H. ...
We prove several decidability and undecidability results for -PN, an extension of P/T nets with pure name creation and name management. We give a simple proof of undecidability of...
We describe XTreeNet, a distributed query dissemination engine which facilitates democratization of publishing and efficient data search among members of online communities with p...