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)

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.

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 study theorems from Functional Analysis with regard to their relationship with various weak choice principles and prove several results about them: “Every infinite‐dimensional Banach space has a well‐orderable Hamel basis” is equivalent to ; “ can be well‐ordered” implies “no infinite‐dimensional Banach space has a Hamel basis of cardinality ”, thus the latter statement is true in every Fraenkel‐Mostowski model of ; “No infinite‐dimensional Banach space has a Hamel basis of cardinality ” is (...) not provable in ; “No infinite‐dimensional Banach space has a well‐orderable Hamel basis of cardinality ” is provable in ; (the Axiom of Choice for denumerable families of non‐empty finite sets) is equivalent to “no infinite‐dimensional Banach space has a Hamel basis which can be written as a denumerable union of finite sets”; Mazur's Lemma (“If X is an infinite‐dimensional Banach space, Y is a finite‐dimensional vector subspace of X, and, then there is a unit vector such that for all and all scalars α”) is provable in ; “A real normed vector space X is finite‐dimensional if and only if its closed unit ball is compact” is provable in ; (Principle of Dependent Choices) + “ can be well‐ordered” does not imply the Hahn‐Banach Theorem () in ; and “no infinite‐dimensional Banach space has a Hamel basis of cardinality ” are independent from each other in ; “No infinite‐dimensional Banach space can be written as a denumerable union of finite‐dimensional subspaces” lies in strength between (the Axiom of Countable Choice) and ; implies “No infinite‐dimensional Banach space can be written as a denumerable union of closed proper subspaces” which in turn implies ; “Every infinite‐dimensional Banach space has a denumerable linearly independent subset” is a theorem of, but not a theorem of ; and “Every infinite‐dimensional Banach space has a linearly independent subset of cardinality ” implies “every Dedekind‐finite set is finite”. (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.

It is an old idea, lately out of fashion but now experiencing a revival, that quantum mechanics may best be understood, not as a physical theory with a problematic probabilistic interpretation, but as something closer to a probability calculus per se. However, from this angle, the rather special C *-algebraic apparatus of quantum probability theory stands in need of further motivation. One would like to find additional principles, having clear physical and/or probabilistic content, on the basis of which this apparatus (...) can be reconstructed. In this paper, I explore one route to such a derivation of finite-dimensional quantum mechanics, by means of a set of strong, but probabilistically intelligible, axioms. Stated very informally, these require that systems appear completely classical as restricted to a single measurement, that different measurements, and likewise different pure states, be equivalent (up to the action of a compact group of symmetries), and that every state be the marginal of a bipartite non-signaling state perfectly correlating two measurements. This much yields a mathematical representation of (basic, discrete) measurements as orthonormal subsets of, and states, by vectors in, an ordered real Hilbert space – in the quantum case, the space of Hermitian operators, with its usual tracial inner product. One final postulate (a simple minimization principle, still in need of a clear interpretation) forces the positive cone of this space to be homogeneous and self-dual and hence, to be the state space of a formally real Jordan algebra. From here, the route to the standard framework of finite-dimensional quantum mechanics is quite short. (shrink)

In this paper, we use the differential forms of three-dimensional Euclidean space to realize a Clifford algebra which is isomorphic to the algebra of the Pauli matrices or the complex quaternions. This is an associative vector-antisymmetric tensor algebra with division: We provide the algebraic inverse of an eight-component spinor field which is the sum of a scalar + vector + pseudovector + pseudoscalar. A surface of singularities is defined naturally by the inverse of an eight-component spinor (...) and corresponds to a generalized Minkowski “double” light cone in the parameter space. A general description of finite spatial rotations, which utilizes the Baker-Campbell-Hausdorff formula, generalizes the usual infinitesimal treatments of the rotation group. We derive an explicit expression for the angle corresponding to two successive finite rotations in any direction. We also discuss Lorentz transformations and duality rotations of the electromagnetic field and exhibit a relationship between the algebraic inverse and a duality rotated field. Using a combined transformation, one can always transform an arbitrary electromagnetic field (E≠0) into a pure electric field, but never into a pure magnetic field. (shrink)

Using a result of Gurevich and Lewis on the word problem for finite semigroups, we give short proofs that the following theories are hereditarily undecidable: (1) finite graphs of vertex-degree at most 3; (2) finite nonvoid sets with two distinguished permutations; (3) finite-dimensional vector spaces over a finite field with two distinguished endomorphisms.

The grounding of semiotics in the finiteness of cognition is extended into constructs and methods for analysis by incorporating the assumption that cognition can be similar within and between agents. After examining and formalizing cognitive similarity as an ontological commitment, the recurrence of cognitive states is examined in terms of a “cognitive set.” In the individual, the cognitive set is seen as evolving under the bidirectional, cyclical determination of thought by the historical environment. At the population level, the distributed “global” (...) cognitive set is argued to be constrained to a manifold in which the cognition of individuals is determined only when their cognitive sets meet certain conditions in the world: a result seen as consistent with Lotman’s semiosphere. With these foundations in place, dimensional modelling of the semiosic field is inaugurated. Firstly, measures of cognitive similarity are formalized as cognitive “distance” and on this basis the concept of a semiotic vector is defined. Secondly, semiotic vectors are seen to shape a general pattern of oscillation in semiosis, and thus to imply zero points in semiosic potential. Thirdly, semiosic oscillation in individual agents is shown to be consistent with a novel diachronic or longitudinal interpretation of Greimas’ semiotic square expanded into a “semiotic pipe” in which cognition traverses an n-dimensional space structured by axes of oscillation. Finally, the expanded theory of finite semiotics is advanced as a useful basis for two new complementary disciplines: a computational, mathematical science of “natural semiotic processing” to trace and model semiotic vectors and oscillation; and an ethical, rhetorical art of “technological influencing” to guide its inputs and applications. (shrink)

I propose a version of quantum mechanics featuring a discrete and finite number of states that is plausibly a model of the real world. The model is based on standard unitary quantum theory of a closed system with a finite-dimensional Hilbert space. Given certain simple conditions on the spectrum of the Hamiltonian, Schrödinger evolution is periodic, and it is straightforward to replace continuous time with a discrete version, with the result that the system only visits a (...) discrete and finite set of state vectors. The biggest challenges to the viability of such a model come from cosmological considerations. The theory may have implications for questions of mathematical realism and finitism. (shrink)

In this paper, we shall discuss some recent contributions to the project [15, 14, 2, 18, 22, 23] of explaining why no satisfactory system of complete invariants has yet been found for the torsion-free abelian groups of finite rank n ≥ 2. Recall that, up to isomorphism, the torsion-free abelian groups of rank n are exactly the additive subgroups of the n-dimensional vector space ℚn which contain n linearly independent elements. Thus the collection of torsion-free abelian (...) groups of rank at most n can be naturally identified with the set S of all nontrivial additive subgroups of ℚn. In 1937, Baer [4] solved the classification problem for the class Sof rank 1 groups as follows.Let ℙ be the set of primes. If G is a torsion-free abelian group and 0 ≠ x ϵ G, then the p-height of x is defined to behx = sup{n ϵ ℕ ∣ There exists y ϵ G such that pny = x} ϵ ℕ ∪{∞}; and the characteristic χ of x is defined to be the function. (shrink)

Since the pioneering work of Birkhoff and von Neumann, quantum logic has been interpreted as the logic of (closed) subspaces of a Hilbert space. There is a progression from the usual Boolean logic of subsets to the "quantum logic" of subspaces of a general vector space--which is then specialized to the closed subspaces of a Hilbert space. But there is a "dual" progression. The notion of a partition (or quotient set or equivalence relation) is dual (in (...) a category-theoretic sense) to the notion of a subset. Hence the Boolean logic of subsets has a dual logic of partitions. Then the dual progression is from that logic of partitions to the quantum logic of direct-sum decompositions (i.e., the vector space version of a set partition) of a general vector space--which can then be specialized to the direct-sum decompositions of a Hilbert space. This allows the logic to express measurement by any self-adjoint operators rather than just the projection operators associated with subspaces. In this introductory paper, the focus is on the quantum logic of direct-sum decompositions of a finite-dimensional vector space (including such a Hilbert space). The primary special case examined is finite vector spaces over ℤ₂ where the pedagogical model of quantum mechanics over sets (QM/Sets) is formulated. In the Appendix, the combinatorics of direct-sum decompositions of finite vector spaces over GF(q) is analyzed with computations for the case of QM/Sets where q=2. (shrink)

Pregroup grammars were developed in 1999 and stayed Lambek’s preferred algebraic model of grammar. The set-theoretic semantics of pregroups, however, faces an ambiguity problem. In his latest book, Lambek suggests that this problem might be overcome using finite dimensional vector spaces rather than sets. What is the right notion of composition in this setting, direct sum or tensor product of spaces?

We define a Lie differential field as a field of characteristic 0 with an action, as derivations on , of some given Lie algebra . We assume that is a finite-dimensional vector space over some sub-field given in advance. As an example take the field of rational functions on a smooth algebraic variety, with .For every simple extension of Lie differential fields we find a finite system of differential equations that characterizes it. We then define, (...) using first-order conditions, a collection of allowed systems of differential equations s.t. the above characteristic systems are allowed. We prove that for every allowed system there exists a generic solution in some extension, and this solution is unique .We construct the model completion of the theory of Lie differential fields by adding axioms stating that every allowed system has almost generic solutions. The construction is a generalization of Blum's axioms for DCF0. We also show that this model completion is ω-stable. (shrink)

This addendum to [2] shows that the set of tautological quantum logical propositional formulas for a finite dimensional vector space Cⁿ is different for every n, affirmatively answering a question posed therein.

The interpretation of propositions in Lukasiewicz's infinite-valued calculus as answers in Ulam's game with lies--the Boolean case corresponding to the traditional Twenty Questions game--gives added interest to the completeness theorem. The literature contains several different proofs, but they invariably require technical prerequisites from such areas as model-theory, algebraic geometry, or the theory of ordered groups. The aim of this paper is to provide a self-contained proof, only requiring the rudiments of algebra and convexity in finite-dimensional vector spaces.

We define qualia space Q to be the space of all possible conscious experience. For simplicity we restrict ourselves to perceptual experience only, though other kinds of experience could also be considered. Qualia space is a highly idealized concept that unifies the perceptual experience of all possible brains. We argue that Q is a closed pointed cone in an infinite-dimensional separable real topological vector space. This quite technical structure can be explained for the most (...) part in a simple, intuitive way. The structure of qualia space allows us to consider and even answer in a precise way such questions as: Is there a continuous path from the sensation of blue to the sensation of pain? Once we fix a desired accuracy of approximation, do there exist finitely many perceptual experiences such that any possible perceptual experience is approximately equal to one of them? What should be meant by ‘fundamentally different’ perceptual experiences? There is the possibility of additional structure, such as a Hilbert space structure on the vector space in which Q is embedded. (shrink)

This paper addresses the doubts voiced by Wigner about the physical relevance of the concept of geometrical points by exploiting some facts known to all but honored by none: Almost all real numbers are transcendental; the explicit representation of any one will require an infinite amount of physical resources. An instrument devised to measure a continuous real variable will need a continuum of internal states to achieve perfect resolution. Consequently, a laboratory instrument for measuring a continuous variable in a (...) class='Hi'>finite time can report only a finite number of values, each of which is constrained to be a rational number. It does not matter whether the variable is classical or quantum-mechanical. Now, in von Neumann’s measurement theory (von Neumann, Mathematical Foundations of Quantum Mechanics, Princeton University Press, Princeton, [1955]), an operator A with a continuous spectrum—which has no eigenvectors—cannot be measured, but it can be approximated by operators with discrete spectra which are measurable. The measurable approximant F(A) is not canonically determined; it has to be chosen by the experimentalist. It is argued that this operator can always be chosen in such a way that Sewell’s results (Sewell in Rep. Math. Phys. 56: 271, [2005]; Sewell, Lecture given at the J.T. Lewis Memorial Conference, Dublin, [2005]) on the measurement of a hermitian operator on a finite-dimensional vector space (described in Sect. 3.2) constitute an adequate resolution of the measurement problem in this theory. From this follows our major conclusion, which is that the notion of a geometrical point is as meaningful in nonrelativistic quantum mechanics as it is in classical physics. It is necessary to be sensitive to the fact that there is a gap between theoretical and experimental physics, which reveals itself tellingly as an error inherent in the measurement of a continuous variable. (shrink)

Recent work on compositional distributional models shows that bialgebras over finite dimensional vector spaces can be applied to treat generalised quantifiersGeneralised quantifiers for natural language. That technique requires one to construct the vector space over powersets, and therefore is computationally costly. In this paper, we overcome this problem by considering fuzzy versions of quantifiers along the lines of ZadehZadeh, L. A., within the category of many valued relationsMany valued relations. We show that this category is (...) a concrete instantiation of the compositional distributional model. We show that the semantics obtained in this model is equivalent to the semantics of the fuzzy quantifiers of ZadehZadeh, L. A.. As a result, we are now able to treat fuzzy quantification without requiring a powerset construction. (shrink)

We show that the first order theory of the lattice $\mathscr{L}^{ (S) of finite dimensional closed subsets of any nontrivial infinite dimensional Steinitz Exhange System S has logical complexity at least that of first order number theory and that the first order theory of the lattice L(S ∞ ) of computably enumerable closed subsets of any nontrivial infinite dimensional computable Steinitz Exchange System S ∞ has logical complexity exactly that of first order number theory. Thus, for (...) example, the lattice of finite dimensional subspaces of a standard copy of $\bigoplus_\omega$ Q interprets first order arithmetic and is therefore as complicated as possible. In particular, our results show that the first order theories of the lattice L(V ∞ ) of c.e. subspaces of a fully effective ℵ 0 -dimensional vector space V∞ and the lattice of c.e. algebraically closed subfields of a fully effective algebraically closed field F ∞ of countably infinite transcendence degree each have logical complexity that of first order number theory. (shrink)

In finite probability theory, events are subsets S⊆U of the outcome set. Subsets can be represented by 1-dimensional column vectors. By extending the representation of events to two dimensional matrices, we can introduce "superposition events." Probabilities are introduced for classical events, superposition events, and their mixtures by using density matrices. Then probabilities for experiments or `measurements' of all these events can be determined in a manner exactly like in quantum mechanics (QM) using density matrices. Moreover the transformation (...) of the density matrices induced by the experiments or `measurements' is the Lüders mixture operation as in QM. And finally by moving the machinery into the n-dimensional vector space over ℤ₂, different basis sets become different outcome sets. That `non-commutative' extension of finite probability theory yields the pedagogical model of quantum mechanics over ℤ₂ that can model many characteristic non-classical results of QM. (shrink)

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)

We extend the hierarchy of finite-dimensional Ellentuck spaces to infinite dimensions. Using uniform barriers [Formula: see text] on [Formula: see text] as the prototype structures, we construct a class of continuum many topological Ramsey spaces [Formula: see text] which are Ellentuck-like in nature, and form a linearly ordered hierarchy under projections. We prove new Ramsey-classification theorems for equivalence relations on fronts, and hence also on barriers, on the spaces [Formula: see text], extending the Pudlák–Rödl theorem for barriers on (...) the Ellentuck space. The inspiration for these spaces comes from continuing the iterative construction of the forcings [Formula: see text] to the countable transfinite. The [Formula: see text]-closed partial order [Formula: see text] is forcing equivalent to [Formula: see text], which forces a non-p-point ultrafilter [Formula: see text]. This work forms the basis for further work classifying the Rudin–Keisler and Tukey structures for the hierarchy of the generic ultrafilters [Formula: see text]. (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)

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.

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)

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.

It will be shown that the probability calculus of a quantum mechanical entity can be obtained in a deterministic framework, embedded in a real space, by introducing a lack of knowledge in the measurements on that entity. For all n ∃ ℕ we propose an explicit model in $\mathbb{R}^{n^2 } $ , which entails a representation for a quantum entity described by an n-dimensional complex Hilbert space þn, namely, the “þn,Euclidean hidden measurement representation.” This Euclidean hidden measurement (...) representation is also in a more general sense equivalent with the orthodox Hilbert space formulation of quantum mechanics, since every mathematical ingredient of ordinary quantum mechanics can easily be translated into the framework of these representations. (shrink)

We discuss computability properties of the set of elements of best approximation of some point xX by elements of GX in computable Banach spaces X. It turns out that for a general closed set G, given by its distance function, we can only obtain negative information about as a closed set. In the case that G is finite-dimensional, one can compute negative information on as a compact set. This implies that one can compute the point in whenever it (...) is uniquely determined. This is also possible for a wider class of subsets G, given that one imposes additionally convexity properties on the space. If the Banach space X is computably uniformly convex and G is convex, then one can compute the uniquely determined point in . We also discuss representations of finite-dimensional subspaces of Banach spaces and we show that a basis representation contains the same information as the representation via distance functions enriched by the dimension. Finally, we study computability properties of the dimension and the codimension map and we show that for finite-dimensional spaces X the dimension is computable, given the distance function of the subspace. (shrink)

These are notes designed to bring the beginning student of the philosophy of quantum mechanics 'up to scratch' on the mathematical background needed to understand elementary finite-dimensional quantum theory. There are just three chapters: Ch. 1 'Vector Spaces'; Ch. 2 'Inner Product Spaces'; and Ch. 3 'Operators on Finite-Dimensional Complex Inner Product Spaces'. The notes are entirely self-contained and presuppose knowledge of only high school level algebra.

The notions of linear and metric independence are investigated in relation to the property: if U is a set of n+1 independent vectors, and X is a set of n independent vectors, then adjoining some vector in U to X results in a set of n+1 independent vectors. It is shown that this property holds in any normed linear space. A related property – that finite-dimensional subspaces are proximinal – is established for strictly convex normed spaces (...) over the real or complex numbers. It follows that metric independence and linear independence are equivalent in such spaces. Proofs are carried out in the context of intuitionistic logic without the axiom of countable choice. (shrink)

A subspace V of an infinite dimensional fully effective vector space V ∞ is called decidable if V is r.e. and there exists an r.e. W such that $V \oplus W = V_\infty$ . These subspaces of V ∞ are natural analogues of recursive subsets of ω. The set of r.e. subspaces forms a lattice L(V ∞ ) and the set of decidable subspaces forms a lower semilattice S(V ∞ ). We analyse S(V ∞ ) and its (...) relationship with L(V ∞ ). We show: Proposition. Let U, V, W ∈ L(V ∞ ) where U is infinite dimensional and $U \oplus V = W$ . Then there exists a decidable subspace D such that U |oplus D = W. Corollary. Any r.e. subspace can be expressed as the direct sum of two decidable subspaces. These results allow us to show: Proposition. The first order theory of the lower semilattice of decidable subspaces, Th(S(V ∞ )), is undecidable. This contrasts sharply with the result for recursive sets. Finally we examine various generalizations of our results. In particular we analyse S * (V ∞ ), that is, S(V ∞ ) modulo finite dimensional subspaces. We show S * (V ∞ ) is not a lattice. (shrink)

We discuss the problem of how a (commutative) generalized observable in a finite-dimensional Hilbert space (communtative effect-valued resolution of the identity) can be considered as an unsharp realization of some standard observable (projection-valued resolution of the identity). In particular, we give a concrete procedure for constructing such a standard observable. Some results about the “uniqueness” of the resulting observable are also examined.

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)

In Ref. 1 we have considered the finite-dimensional quantum mechanics. There the quantum mechanical space of states wasV=C r. It is known that the second quantization of this space is the space of square-summable functions of finite number of variables(L 2(Rr,dx)) (Segal isomorphism). Creation and annihilation operators were introduced in Ref. 1, and the former coincided with the usual position and momentum operators in the conventional quantum mechanics. In this paper we shall investigate the (...) spectral properties of field operators. We shall show that the isomorphism between the exponential ofV andL 2(Rr,dx) can be understood as the decomposition by generalized eigenvectors of field operators (“Fourier transform”). (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)

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)

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)

Let I0 be a a computable basis of the fully effective vector space V∞ over the computable field F. Let I be a quasimaximal subset of I0 that is the intersection of n maximal subsets of the same 1-degree up to *. We prove that the principal filter \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\mathcal{L}^{\ast}(V,\uparrow )}$$\end{document} of V = cl(I) is isomorphic to the lattice \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\mathcal{L}(n, \overline{F})}$$\end{document} (...) of subspaces of an n-dimensional space over \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\overline{F}}$$\end{document}, a \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\Sigma _{3}^{0}}$$\end{document} extension of F. As a corollary of this and the main result of Dimitrov (Math Log 43:415–424, 2004) we prove that any finite product of the lattices \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${(\mathcal{L}(n_{i}, \overline{F }_{i}))_{i=1}^{k}}$$\end{document} is isomorphic to a principal filter of \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\mathcal{ L}^{\ast}(V_{\infty})}$$\end{document}. We thus answer Question 5.3 “What are the principal filters of \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\mathcal{L}^{\ast}(V_{\infty})?}$$\end{document} ” posed by Downey and Remmel (Computable algebras and closure systems: coding properties, handbook of recursive mathematics, vol 2, pp 977–1039, Stud Log Found Math, vol 139, North-Holland, Amsterdam, 1998) for spaces that are closures of quasimaximal sets. (shrink)

The law of gravitational attraction is a window on three formal approaches to laws of nature based on Lorentz-invariance: Poincaré’s four-dimensional vector space (1906), Minkowski’s matrix calculus and spacetime geometry (1908), and Sommerfeld’s 4-vector algebra (1910). In virtue of a common appeal to 4-vectors for the characterization of gravitational attraction, these three contributions track the emergence and early development of four-dimensional physics.

In this paper, we continue the study of the Killing symmetries of an N-dimensional generalized Minkowski space, i.e., a space endowed with a metric tensor, whose coefficients do depend on a set of non-metrical coordinates. We discuss here the finite structure of the space–time rotations in such spaces, by confining ourselves to the four-dimensional case. In particular, the results obtained are specialized to the case of a “deformed” Minkowski space M_4, for which we (...) derive the explicit general form of the finite rotations and boosts in different parametric bases. (shrink)

The method of Quasi-Analysis used by Carnap in his program of theconstitution of concepts from finite observations has the following twogoals: (1) Given unsharp observations in terms of similarity relations thetrue properties of the observed objects shall be obtained by a suitablelogical construction. (2) From a single relation on a finite domain,different dimensions of qualities shall be reconstructed and identified. Inthis article I show that with a slight modification Quasi-Analysis iscapable of fulfilling the first goal for a single (...) observable dimension. Weobtain a partition of the so-called Quality Classes representing thepairwise disjoint and exhaustive extensions associated to the ``values'''' ofthe observable. On the other hand, an example demonstrates that the methodfails, as Goodman has pointed out, for a relation expressing similarity withregard to at least one out of many properties.Since it seems to be impossible in general to reconstruct more-dimensionalqualities from a single similarity relation, the constitution of at least asmany similarity relations as there are qualities have to be presumed. Thenit is possible to state adequate sufficient conditions for the dimension ofthe observable space, even if some of the similarity relations might dependon others. The concept of topological dimension cannot be used for thispurpose on finite sets of observations. We replace it by a set-algebraicalcondition on the Quality Classes. (shrink)

We provide a mathematical description of quantum measurements with a finite exactness. The exactness of a quantum measurement is used as a new metric on the space of quantum states. This metric differs very much from the standard Euclidean metric. This is the so-called ultrametric. We show that a finite exactness of a quantum measurement cannot he described by real numbers. Therefore, we must change the basic number field. There exist nonequivalent ultrametric Hilbert space representations already (...) in the finite-dimensional case (compare with ideas of L. de Broglie). Different preparation procedures could generate nonequivalent representations. The Heisenberg uncertainty principle is a consequence of properties of a preparation procedure. The uncertainty principle “time-energy” is a consequence of the Schrödinger dynamics. (shrink)

Although great progress in neuroanatomy and physiology has occurred lately, we still cannot go directly to those levels to discover the neural mechanisms of higher cognition and consciousness. But we can use neurocomputational methods based on these details to push this project forward. Here we describe vector subtraction as an operation that computes sequential paths through high-dimensional vector spaces. Vector-space interpretations of network activity patterns are a fruitful resource in recent computational neuroscience. Vector subtraction (...) also appears to be implemented neurally in primate frontal eye field activity, which computes dimensions of saccadic eye movements. We use this apparent neural implementation as a model and construct from it a general neurocomputational account of an important type of sequential cognitive and conscious process. We defend the biological plausibility of all components of the general model and show that it yields testable anatomical and physiological predictions. We close by suggesting some interesting consequences for consciousness if our model characterizes correctly the neural mechanisms producing a common type of episode in our conscious streams. (shrink)

For any unit vector in an inner product space S, we define a mapping on the system of all ⊥-closed subspaces of S, F(S), whose restriction on the system of all splitting subspaces of S, E(S), is always a finitely additive state. We show that S is complete iff at least one such mapping is a finitely additive state on F(S). Moreover, we give a completeness criterion via the existence of a regular finitely additive state on appropriate systems (...) of subspaces. Finally, the result will be generalized to general inner product spaces. (shrink)

In this talk I will introduce two spaces: the first space is the usual n-dimensional vector space with the unusual feature that n is a non-integer; the second space is composed of the linear matrices acting on the previous space (physicists are particularly interested in studying the limit as n goes to zero). These two spaces are not known to most mathematicians, but they are widely used by physicists. It is possible that, by extending (...) the notion of space, they can become well defined mathematical objects. (shrink)

We argue that, under certain plausible assumptions, de Sitter space settles into a quiescent vacuum in which there are no dynamical quantum fluctuations. Such fluctuations require either an evolving microstate, or time-dependent histories of out-of-equilibrium recording devices, which we argue are absent in stationary states. For a massive scalar field in a fixed de Sitter background, the cosmic no-hair theorem implies that the state of the patch approaches the vacuum, where there are no fluctuations. We argue that an analogous (...) conclusion holds whenever a patch of de Sitter is embedded in a larger theory with an infinite-dimensional Hilbert space, including semiclassical quantum gravity with false vacua or complementarity in theories with at least one Minkowski vacuum. This reasoning provides an escape from the Boltzmann brain problem in such theories. It also implies that vacuum states do not uptunnel to higher-energy vacua and that perturbations do not decohere while slow-roll inflation occurs, suggesting that eternal inflation is much less common than often supposed. On the other hand, if a de Sitter patch is a closed system with a finite-dimensional Hilbert space, there will be Poincaré recurrences and dynamical Boltzmann fluctuations into lower-entropy states. Our analysis does not alter the conventional understanding of the origin of density fluctuations from primordial inflation, since reheating naturally generates a high-entropy environment and leads to decoherence, nor does it affect the existence of non-dynamical vacuum fluctuations such as those that give rise to the Casimir effect. (shrink)

A complete set of mutually unbiased bases for a Hilbert space of dimension N is analogous in some respects to a certain finite geometric structure, namely, an affine plane. Another kind of quantum measurement, known as a symmetric informationally complete positive-operator-valued measure, is, remarkably, also analogous to an affine plane, but with the roles of points and lines interchanged. In this paper I present these analogies and ask whether they shed any light on the existence or non-existence of (...) such symmetric quantum measurements for a general quantum system with a finite-dimensional state space. (shrink)