We consider the descriptive complexity of some subsets of the infinite permutation group S∞ which arise naturally from the classical series rearrangement theorems of Riemann, Levy, and Steinitz. In particular, given some fixed conditionally convergent series of vectors in Euclidean space Rd, we study the set of permutations which make the series diverge, as well as the set of permutations which...

There is a growing need for abstractions in logic specification languages such as FO(·) and ASP. One technique to achieve these abstractions are templates (sometimes called macros). While the semantics of templates are virtually always described through a syntactical rewriting scheme, we present an alternative view on templates as second order definitions. To extend the existing definition cons...

Objective To evaluate undergraduate anesthesia curriculum in Pakistan Methods A mail survey was performed and results are presented as descriptive statistics.

The fact that natural language proper names are rigid designators is an empirical discovery about natural language. However, unlike other empirical discoveries about language made in the past few decades, it is one which has been taken to have great philosophical significance. One reason for this is that it helped simplify the formal semantical representation of ordinary modal discourse. But th...

We construct a minimal rK-degree, continuum many, in fact. We also show that every minimal sequence, that is, a sequence with minimal rK-degree, must have very low descriptional complexity, that every minimal sequence is rK-reducible to a random sequence, and that there is a random sequence with no minimal sequence rK-reducible to it.