We study the theory of K-vector spaces with a predicate for the union X of an infinite family of independent subspaces. We show that if K is infinite then the theory is complete and admits quantifier elimination in the language of K-vector spaces with predicates for the n-fold sums of X with itself. If K is finite this is no longer true, but we still have that a natural completion is near-model-complete.

We show that the assertion that every vector space is a projective module implies the axiom of multiple choice and that the reverse implication does not hold in set theory weakened to permit the existence of atoms.

We show that the axiom of choice AC is equivalent to the Vector Space Kinna-Wagner Principle, i.e., the assertion: “For every family [MATHEMATICAL SCRIPT CAPITAL V]= {Vi : i ∈ k} of non trivial vector spaces there is a family ℱ = {Fi : i ∈ k} such that for each i ∈ k, Fiis a non empty independent subset of Vi”. We also show that the statement “every vector space over ℚ has a basis” implies (...) that every infinite well ordered set of pairs has an infinite subset with a choice set, a fact which is known not to be a consequence of the axiom of multiple choice MC. (shrink)

This paper introduces a compositional semantics of locativeprepositional phrases which is based on a vector space ontology.Model-theoretic properties of prepositions like monotonicity andconservativity are defined in this system in a straightforward way.These notions are shown to describe central inferences with spatialexpressions and to account for the grammaticality of prepositionmodification. Model-theoretic constraints on the set of possibleprepositions in natural language are specified, similar to the semanticuniversals of Generalized Quantifier Theory.

Vector spaces over unspecified fields can be axiomatized as one-sorted structures, namely, abelian groups with the relation of parallelism. Parallelism is binary linear dependence. When equipped with the n-ary relation of linear dependence for some positive integer n, a vector-space is existentially closed if and only if it is n-dimensional over an algebraically closed field. In the signature with an n-ary predicate for linear dependence for each positive integer n, the theory of infinite-dimensional vector spaces (...) over algebraically closed fields is the model-completion of the theory of vector spaces. (shrink)

Let M = 〈M, +, <, 0, {λ}λ∈D〉 be an ordered vector space over an ordered division ring D, and G = 〈G, ⊕, eG〉 an n-dimensional group definable in M. We show that if G is definably compact and definably connected with respect to the t-topology, then it is definably isomorphic to a 'definable quotient group' U/L, for some convex V-definable subgroup U of 〈Mⁿ, +〉 and a lattice L of rank n. As two consequences, we derive Pillay's (...) conjecture for a saturated M as above and we show that the o-minimal fundamental group of G is isomorphic to L. (shrink)

Quantum theory has the property of “local tomography”: the state of any composite system can be reconstructed from the statistics of measurements on the individual components. In this respect the holism of quantum theory is limited. We consider in this paper a class of theories more holistic than quantum theory in that they are constrained only by “bilocal tomography”: the state of any composite system is determined by the statistics of measurements on pairs of components. Under a few auxiliary assumptions, (...) we derive certain general features of such theories. In particular, we show how the number of state parameters can depend on the number of perfectly distinguishable states. We also show that real-vector-space quantum theory, while not locally tomographic, is bilocally tomographic. (shrink)

The Distributional Compositional Categorical model is a mathematical framework that provides compositional semantics for meanings of natural language sentences. It consists of a computational procedure for constructing meanings of sentences, given their grammatical structure in terms of compositional type-logic, and given the empirically derived meanings of their words. For the particular case that the meaning of words is modelled within a distributional vector space model, its experimental predictions, derived from real large scale data, have outperformed other empirically validated methods (...) that could build vectors for a full sentence. This success can be attributed to a conceptually motivated mathematical underpinning, something which the other methods lack, by integrating qualitative compositional type-logic and quantitative modelling of meaning within a category-theoretic mathematical framework. The type-logic used in the DisCoCat model is Lambekʼs pregroup grammar. Pregroup types form a posetal compact closed category, which can be passed, in a functorial manner, on to the compact closed structure of vector spaces, linear maps and tensor product. The diagrammatic versions of the equational reasoning in compact closed categories can be interpreted as the flow of word meanings within sentences. Pregroups simplify Lambekʼs previous type-logic, the Lambek calculus. The latter and its extensions have been extensively used to formalise and reason about various linguistic phenomena. Hence, the apparent reliance of the DisCoCat on pregroups has been seen as a shortcoming. This paper addresses this concern, by pointing out that one may as well realise a functorial passage from the original type-logic of Lambek, a monoidal bi-closed category, to vector spaces, or to any other model of meaning organised within a monoidal bi-closed category. The corresponding string diagram calculus, due to Baez and Stay, now depicts the flow of word meanings, and also reflects the structure of the parse trees of the Lambek calculus. (shrink)

Let $V_\propto$ be a fixed, fully effective, infinite dimensional vector space. Let $\mathscr{L}(V_\propto)$ be the lattice consisting of the recursively enumerable (r.e.) subspaces of $V_\propto$ , under the operations of intersection and weak sum (see § 1 for precise definitions). In this article we examine the algebraic properties of $\mathscr{L}(V_\propto)$ . Early research on recursively enumerable algebraic structures was done by Rabin [14], Frolich and Shepherdson [5], Dekker [3], Hamilton [7], and Guhl [6]. Our results are based upon the (...) more recent work concerning vector spaces of Metakides and Nerode [12], Crossley and Nerode [2], Remmel [15], [16], and Kalantari [8]. In the main theorem below, we extend a result of Lachlan from the lattice E of r.e. sets to $\mathscr{L}(V_\propto)$ . We define hyperhypersimple vector spaces, discuss some of their properties and show if $A, B \in \mathscr{L}(V_\propto)$ , and A is a hyperhypersimple subspace of B then there is a recursive space C such that A + C = B. It will be proven that if $V \in \mathscr{L}(V_\propto)$ and the lattice of superspaces of V is a complemented modular lattice then V is hyperhypersimple. The final section contains a summary of related results concerning maximality and simplicity. (shrink)

The limitation on the sharing of entanglement is a basic feature of quantum theory. For example, if two qubits are completely entangled with each other, neither of them can be at all entangled with any other object. In this paper we show, at least for a certain standard definition of entanglement, that this feature is lost when one replaces the usual complex vector space of quantum states with a real vector space. Moreover, the difference between the two theories (...) is extreme: in the real-vector-space theory, there exist states of arbitrarily many binary objects, “rebits,” in which every rebit in the system is maximally entangled with each of the other rebits. (shrink)

Vector spaces over fields are pseudofinite, and this remains true for vector spaces over division rings that are finite-dimensional over their center. We also construct a division ring such that the nontrivial vector spaces over it are not pseudofinite, using Richard Thompson's group F. The idea behind the construction comes from a first-order axiomatization of the class of division rings all whose nontrivial vector spaces are pseudofinite.

We provide a simple and transparent construction of Hrushovski's strongly minimal fusions in the case where the fused strongly minimal sets are vector spaces. We strengthen Hrushovski's result by showing that the strongly minimal fusions are model complete.

Vector spaces over fields are pseudofinite, and this remains true for vector spaces over division rings that are finite-dimensional over their center. We also construct a division ring such that the nontrivial vector spaces over it are not pseudofinite, using Richard Thompson's group F. The idea behind the construction comes from a first-order axiomatization of the class of division rings all whose nontrivial vector spaces are pseudofinite.

Let T1 and T2 be two countable strongly minimal theories with the DMP whose common theory is the theory of vector spaces over a fixed finite field. We show that T1 ∪ T2 has a strongly minimal completion.

In this paper, we study the lattice of r.e. subspaces of a recursively presented vector space V ∞ with regard to the various complexity-theoretic speed-up properties such as speedable, effectively speedable, levelable, and effectively levelable introduced by Blum and Marques. In particular, we study the interplay between an r.e. basis A for a subspace V of V ∞ and V with regard to these properties. We show for example that if A or V is speedable , then V is (...) levelable . We also show that if A is an r.e. subset of a recursive basis for V ∞ , then A is levelable iff V is speedable while it is not the case that A is levelable iff V is speedable. We also provide several contrasts between the lattice of r.e. subspaces and the lattice of r.e. sets with respect to these speed-up properties. For example, every maximal set is levelable but we show that there exist supermaximal spaces which are nonspeedable in all possible r.e. degrees as well as supermaximal spaces which are levelable in all r.e. degrees which contain levelable sets. (shrink)

Most, if not all, philosophers agree that computers cannot learn what words refers to from raw text alone. While many attacked Searle’s Chinese Room thought experiment, no one seemed to question this most basic assumption. For how can computers learn something that is not in the data? Emily Bender and Alexander Koller ( 2020 ) recently presented a related thought experiment—the so-called Octopus thought experiment, which replaces the rule-based interlocutor of Searle’s thought experiment with a neural language model. The Octopus (...) thought experiment was awarded a best paper prize and was widely debated in the AI community. Again, however, even its fiercest opponents accepted the premise that what a word refers to cannot be induced in the absence of direct supervision. I will argue that what a word refers to _is_ probably learnable from raw text alone. Here’s why: higher-order concept co-occurrence statistics are stable across languages and across modalities, because language use (universally) reflects the world we live in (which is relatively stable). Such statistics are sufficient to establish what words refer to. My conjecture is supported by a literature survey, a thought experiment, and an actual experiment. (shrink)

We consider maximal almost disjoint families of block subspaces of countable vector spaces, focusing on questions of their size and definability. We prove that the minimum infinite cardinality of such a family cannot be decided in ZFC and that the “spectrum” of cardinalities of mad families of subspaces can be made arbitrarily large, in analogy to results for mad families on ω. We apply the author’s local Ramsey theory for vector spaces [32] to give partial results (...) concerning their definability. (shrink)

Downey and Remmel have completely characterized the degrees of c.e. bases for c.e. vector spaces (and c.e. fields) in terms of weak truth table degrees. In this paper we obtain a structural result concerning the interaction between the c.e. Turing degrees and the c.e. weak truth table degrees, which by Downey and Remmel's classification, establishes the existence of c.e. vector spaces (and fields) with the strong antibasis property (a question which they raised). Namely, we construct c.e. (...) sets $B<_{\rm T}A$ such that the c.e. W-degrees below that of A are disjoint from the nonzero c.e. T-degrees below that of A and comparable to that of B. (shrink)

In this book authors for the first time introduce the notion of supermatrices of refined labels. Authors prove super row matrix of refined labels form a group under addition. However super row matrix of refined labels do not form a group under product; it only forms a semigroup under multiplication. In this book super column matrix of refined labels and m × n matrix of refined labels are introduced and studied.

The aim of this paper is to describe an analogue of the theory of nontrivial torsion-free divisible abelian groups for metabelian groups. We obtain illustrations for “old-fashioned” model theoretic algebra and “new” examples in the theory of stable groups. We begin this paper with general considerations about model theory. In the second section we present our results and we give the structure of the rest of the paper. Most parts of this paper use only basic concepts from model theory and (...) group theory. However, in Section 5, we need some somewhat elaborate notions from stability theory. One can find the beginnings of this theory in [14], and we refer the reader to [16] or [21] for stability theory and to [22] for stable groups.§1. Some model theoretic considerations. Denote by the theory of torsion-free abelian groups in the language of groups ℒgp. A finitely generated group G satisfies iff G is isomorphic to a finite direct power of ℤ. It follows that axiomatizes the universal theory of free abelian groups and that the theory of nontrivial torsion-free abelian groups is complete for the universal sentences. Denote by the theory of nontrivial divisible torsion-free abelian groups. (shrink)

The aim of this paper is to describe an analogue of the theory of nontrivial torsion-free divisible abelian groups for metabelian groups. We obtain illustrations for “old-fashioned” model theoretic algebra and “new” examples in the theory of stable groups. We begin this paper with general considerations about model theory. In the second section we present our results and we give the structure of the rest of the paper. Most parts of this paper use only basic concepts from model theory and (...) group theory. However, in Section 5, we need some somewhat elaborate notions from stability theory. One can find the beginnings of this theory in [14], and we refer the reader to [16] or [21] for stability theory and to [22] for stable groups.§1. Some model theoretic considerations. Denote by the theory of torsion-free abelian groups in the language of groups ℒgp. A finitely generated group G satisfies iff G is isomorphic to a finite direct power of ℤ. It follows that axiomatizes the universal theory of free abelian groups and that the theory of nontrivial torsion-free abelian groups is complete for the universal sentences. Denote by the theory of nontrivial divisible torsion-free abelian groups. (shrink)

We present our method for tackling a legal case retrieval task by introducing our method of encoding documents by summarizing them into continuous vector space via our phrase scoring framework utilizing deep neural networks. On the other hand, we explore the benefits from combining lexical features and latent features generated with neural networks. Our experiments show that lexical features and latent features generated with neural networks complement each other to improve the retrieval system performance. Furthermore, our experimental results suggest (...) the importance of case summarization in different aspects: using provided summaries and performing encoded summarization. Our approach achieved F1 of 65.6% and 57.6% on the experimental datasets of legal case retrieval tasks. (shrink)

We find the complete Euler characteristics for the categories of definable sets and functions in strongly minimal groups. Their images, which represent the Grothendieck semirings of those categories, are all isomorphic to the semiring of polynomials over the integers with nonnegative leading coefficient. As a consequence, injective definable endofunctions in those groups are surjective. For infinite vector spaces over arbitrary division rings, the same results hold, and more: We also establish the Fubini property for all Euler characteristics, and (...) extend the complete one to the eq-expansion of those spaces while preserving the Fubini property but not completeness. Then, surjective interpretable endofunctions in those spaces are injective, and conversely. Our presentation is made in the general setting of multi-sorted structures. (shrink)

The rise of big digital data is changing the framework within which linguists, sociologists, anthropologists, and other researchers are working. Semiotics is not spared by this paradigm shift. A data-driven computational semiotics is the study with an intensive use of computational methods of patterns in human-created contents related to semiotic phenomena. One of the most promising frameworks in this research program is the Semantic Vector Space (SVS) models and their methods. The objective of this article is to contribute to (...) the exploration of the SVS for a computational semiotics by showing what types of semiotic analysis can be accomplished within this framework. The study is applied to a unique body of digitized artworks. We conducted three short experiments in which we explore three types of semiotic analysis: paradigmatic analysis, componential analysis, and topic modelling analysis. The results reported show that the SVS constitutes a powerful framework within which various types of semiotic analysis can be carried out. (shrink)

The purpose of this paper is to show that the mathematics of quantum mechanics is the mathematics of set partitions linearized to vector spaces, particularly in Hilbert spaces. That is, the math of QM is the Hilbert space version of the math to describe objective indefiniteness that at the set level is the math of partitions. The key analytical concepts are definiteness versus indefiniteness, distinctions versus indistinctions, and distinguishability versus indistinguishability. The key machinery to go from indefinite (...) to more definite states is the partition join operation at the set level that prefigures at the quantum level projective measurement as well as the formation of maximally-definite state descriptions by Dirac’s Complete Sets of Commuting Operators. This development is measured quantitatively by logical entropy at the set level and by quantum logical entropy at the quantum level. This follow-the-math approach supports the Literal Interpretation of QM—as advocated by Abner Shimony among others which sees a reality of objective indefiniteness that is quite different from the common sense and classical view of reality as being “definite all the way down”. (shrink)

In set theory without the Axiom of Choice ( $\mathsf {AC}$ ), we investigate the open problem of the deductive strength of statements which concern the existence of almost disjoint and maximal almost disjoint (MAD) families of infinite-dimensional subspaces of a given infinite-dimensional vector space, as well as the extension of almost disjoint families in infinite-dimensional vector spaces to MAD families.

We construct a computable vector space with the trivial computable automorphism group, but with the dependence relations as complicated as possible, measured by their Turing degrees. As a corollary, we answer a question asked by A.S. Morozov in [Rigid constructive modules, Algebra and Logic, 28 570–583 ; 379–387 ].

Over the history of research on sign languages, much scholarship has highlighted the pervasive presence of signs whose forms relate to their meaning in a non-arbitrary way. The presence of these forms suggests that sign language vocabularies are shaped, at least in part, by a pressure toward maintaining a link between form and meaning in wordforms. We use a vector space approach to test the ways this pressure might shape sign language vocabularies, examining how non-arbitrary forms are distributed within (...) the lexicons of two unrelated sign languages. Vector space models situate the representations of words in a multi-dimensional space where the distance between words indexes their relatedness in meaning. Using phonological information from the vocabularies of American Sign Language and British Sign Language, we tested whether increased similarity between the semantic representations of signs corresponds to increased phonological similarity. The results of the computational analysis showed a significant positive relationship between phonological form and semantic meaning for both sign languages, which was strongest when the sign language lexicons were organized into clusters of semantically related signs. The analysis also revealed variation in the strength of patterns across the form-meaning relationships seen between phonological parameters within each sign language, as well as between the two languages. This shows that while the connection between form and meaning is not entirely language specific, there are cross-linguistic differences in how these mappings are realized for signs in each language, suggesting that arbitrariness as well as cognitive or cultural influences may play a role in how these patterns are realized. The results of this analysis not only contribute to our understanding of the distribution of non-arbitrariness in sign language lexicons, but also demonstrate a new way that computational modeling can be harnessed in lexicon-wide investigations of sign languages. (shrink)

Extending a construction of Andreka, Givant, and Nemeti (2019), we construct some finite vector spaces and use them to build finite non-representable relation algebras. They are simple, measurable, and persistently finite, and they validate arbitrary finite sets of equations that are valid in the variety RRA of representable relation algebras. It follows that there is no finitely axiomatisable class of relation algebras that contains RRA and validates every equation that is both valid in RRA and preserved by completions (...) of relation algebras. Consequently, the variety generated by the completions of representable relation algebras is not finitely axiomatisable. This answers a question of Maddux (2018). (shrink)

We consider two-sorted theories of vector spaces and prove a criterion for the assertion that such a theory allows elimination of quantifiers over vector variables.

Elementary particles are considered as local oscillators under the influence of zeropoint fields. Such oscillatory behavior of the particles leads to the deviations in their path of motion. The oscillations of the particle in general may be considered as complex rotations in complex vector space. The local particle harmonic oscillator is analyzed in the complex vector formalism considering the algebra of complex vectors. The particle spin is viewed as zeropoint angular momentum represented by a bivector. It has been (...) shown that the particle spin plays an important role in the kinematical intrinsic or local motion of the particle. From the complex vector formalism of harmonic oscillator, for the first time, a relation between mass $m$ and bivector spin $S$ has been derived in the form $\varvec{\sigma }_3 mc^2{\mathcal {J}}_{\pm } =\lambda \Omega _{\mathbf{s}} \cdot \mathrm{{S}} {\mathcal {J}}_{\pm }$ . Where, $\Omega _{s}$ is the angular velocity bivector of complex rotations, $c$ is the velocity of light. The unit vector $\varvec{\sigma }_3$ acts as an operator on the idempotents ${\mathcal {J}}_{+}$ and ${\mathcal {J}}_{-}$ to give the eigen values $\lambda =\pm 1.$ The constant $\lambda $ represents two fold nature of the equation corresponding to particle and antiparticle states. Further the above relation shows that the mass of the particle may be interpreted as a local spatial complex rotation in the rest frame. This gives an insight into the nature of fundamental particles. When a particle is observed from an arbitrary frame of reference, it has been shown that the spatial complex rotation dictates the relativistic particle motion. The mathematical structure of complex vectors in space and spacetime is developed. (shrink)

We consider a representation of the state reduction which depends neither on its reality nor on the details of when and how it emerges. Then by means of the representation we find necessary conditions, even if not the sufficient ones, for a decomposition of the state vector space to be a solution to the basis problem. The conditions are that the decomposition should be Lorentz invariant and orthogonal and that the associated projections should be continuous. They are shown to (...) be able to determine a decomposition in each of a few examples considered if the other circumstances are taken into account together. (shrink)

§1. Introduction.The motivation of this work comes from two different directions: infinite abelian groups, and ordered algebraic structures. A challenging problem in both cases is that of classification. In the first case, it is known for example (cf. [KA]) that the classification of abelian torsion groups amounts to that of reducedp-groups by numerical invariants called theUlm invariants(given by Ulm in [U]). Ulm's theorem was later generalized by P. Hill to the class of totally projective groups. As to the second case, (...) let us consider for instance the class of divisible ordered abelian groups. These may be viewed as ordered ℚ-vector spaces. Their theory being unstable, we cannot hope to classify them by numerical invariants. On the other hand, being o-minimal, the theory enjoys several good model theoretic properties (cf. [P-S]), so the search for some reasonable invariants is well motivated. The common denominator of the two cases, as well as of many others, is valuation theory. Indeed given an ordered vector space, one can consider it as a valued vector space, endowed with the natural valuation. Also, the socleG[p] of a reduced abelianp-groupG, endowed with the height functionhG, is a valued vector space over(the prime field of characteristicp) with values in the ordinals (cf. [F]). (shrink)

A generalized Schrödinger equation containing correction terms to classical kinetic energy, has been derived in the complex vector space by considering an extended particle structure in stochastic electrodynamics with spin. The correction terms are obtained by considering the internal complex structure of the particle which is a consequence of stochastic average of particle oscillations in the zeropoint field. Hence, the generalised Schrödinger equation may be called stochastic Schrödinger equation. It is found that the second order correction terms are similar (...) to corresponding relativistic corrections. When higher order correction terms are neglected, the stochastic Schrödinger equation reduces to normal Schrödinger equation. It is found that the Schrödinger equation contains an internal structure in disguise and that can be revealed in the form of internal kinetic energy. The internal kinetic energy is found to be equal to the quantum potential obtained in the Madelung fluid theory or Bohm statistical theory. In the rest frame of the particle, the stochastic Schrödinger equation reduces to a Dirac type equation and its Lorentz boost gives the Dirac equation. Finally, the relativistic Klein–Gordon equation is derived by squaring the stochastic Schrödinger equation. The theory elucidates a logical understanding of classical approach to quantum mechanical foundations. (shrink)

In this paper, we study the lower semilattice of NP-subspaces of both the standard polynomial time representation and the tally polynomial time representation of a countably infinite dimensional vector space V∞ over a finite field F. We show that for both the standard and tally representation of V∞, there exists polynomial time subspaces U and W such that U + V is not recursive. We also study the NP analogues of simple and maximal subspaces. We show that the existence (...) of P-simple and NP-maximal subspaces is oracle dependent in both the tally and standard representations of V∞. This contrasts with the case of sets, where the existence of NP-simple sets is oracle dependent but NP-maximal sets do not exist. We also extend many results of Nerode and Remmel concerning the relationship of P bases and NP-subspaces in the tally representation of V∞ to the standard representation of V∞. (shrink)