This paper proposes a linguistic analysis of the semantic behavior of relative quantifiers in English, those for which an absolute value cannot be determined, with attention to the differences in properties and meaning between individual quantifiers and the semantic subclasses created by these quantifiers. Represented formally within Ontological Semantic Technology (OST), the semantic nature of...

The myth of concussion definition There is no universal agreement on the standard definition of concussion. The most widely accepted definition in sports medicine is that originally proposed by the Congress of Neurological Surgeons. It states that “concussion is a clinical syndrome characterised by the immediate and transient post-traumatic impairment of neural function...”. The key elements of...

We modify the definition of l-homology and argue why our definition is more adequate than the classical one. While we cannot reconstruct the classical l-homology from the new definition for various reasons, we can reconstruct its Hausdorffification so that no information concerning semi-norms is lost. We obtain an axiomatic characterization of our l-homology as a universal δ-functor and prove t...

is said to be universal in X with respect to rearrangements, if for any f ∈ X the members of (1.1) can be rearranged so that the obtained series ∑∞ k=1 fσ(k) converges to f by norm of X . Definition 1.2. The series (1.1) is said to be universal (in X) in the usual sense, if for any f ∈ X there exists a growing sequence of natural numbers nk such that the sequence of partial sums with numbers nk...

We solve the problem of finding the smallest possible universal spiking neural P system with extended rules. We give a universal spiking neural P system with extended rules and only 4 neurons. This is the smallest possible universal system of its kind. We prove this by showing that the set of problems solved by spiking neural P systems with 3 neurons is bounded above by NL, and so there exists ...

The syntax of abstract meaning representations (AMRs) can be defined recursively, and a systematic translation to first-order logic (FOL) can be specified, including a proper treatment of negation. AMRs without recurrent variables are in the decidable two-variable fragment of FOL. The current definition of AMRs has limited expressive power for universal quantification (up to one universal quant...

We investigate the question of whether one can characterize complexity classes in terms of efficient reducibility to the set of Kolmogorov-random strings RK. We show that this question is dependent on the choice of universal machine in the definition of Kolmogorov complexity. We show for a broad class of reductions that the sets reducible to RK have very low computational complexity. Further, w...

We clarify the role of Hofmann’s Axiom in the old-style definition of a semiabelian category. By removing this axiom we obtain the categorical counterpart of the notion of an ideal-determined variety of universal algebras – which we therefore call an ideal-determined category. Using known counter-examples from universal algebra we conclude that there are idealdetermined categories which fail to...

0. Introduction 1. Lie Atoms 1.1 Basic notions 1.2 Representations 1.3 Universal enveloping atom 2. Atomic deformation theory 3. Universal deformations 4. The Hitchin symbol 4.1 The definition 4.2 Cohomological formulae 5. Moduli modules revisited 6. Tangent algbera 7. Differential operators 8. Connection algebra 9. Relative deformations over a global base 10.The Atiyah class of a deformation 1...