Pregroups were introduced in (Lambek, 1999), and provide a foundation for a particularly simple syntactic calculus. Buszkowski (2001) showed that free pregroup grammars generate exactly the -free context-free languages. Here we characterize the class of languages generable by all pregroups, which will be shown to be the entire class of recursively enumerable languages. To show this result, we r...

one of the most widely used rules of jurisprudence is ‘impediment removal’ often expressed by the phrase ‘when impediment is removed, the forbidden is regained.’ the application of this rule in jurisprudential matters produces important outcomes since impediment in those matters can prevent the penetration (validity) of the primary ruling, and as a result, the secondary ruling would be issued a...

‎Our aim in this very short note is to show that the proof of the‎ ‎following well-known fundamental lemma of Zariski follows from an‎ ‎argument similar to the proof of the fact that the rational field‎ ‎$mathbb{Q}$ is not a finitely generated $mathbb{Z}$-algebra.