Vector logic is a mathematical model of the propositional calculus in which the logical variables are represented by vectors and the logical operations by matrices. In this framework, many tautologies of classical logic are intrinsic identities between operators and, consequently, they are valid beyond the bivalued domain. The operators can be expressed as Kronecker polynomials. These polynomials allow us to show that many important tautologies of classical logic are generated from basic operators via the operations called (...) Type I and Type II products. Finally, it is described a matrix version of the Fredkin gate that extends its properties to the many-valued domain, and it is proved that the filtered Fredkin operators are second degree Kronecker polynomials that cannot be generated by Type I or Type II products. (shrink)

In this work, we investigate the representation of counterfactual conditionals using the vector logic, a matrix-vector formalism for logical functions and truth values. Inside this formalism, the counterfactuals can be transformed in complex matrices preprocessing an implication matrix with one of the square roots of NOT, a complex matrix. This mathematical approach puts in evidence the virtual character of the counterfactuals. This happens because this representation produces a valuation of a counterfactual that is the superposition of the (...) two opposite truth values weighted, respectively, by two complex conjugated coefficients. This result shows that this procedure gives an uncertain evaluation projected on the complex domain. After this basic representation, the judgement of the plausibility of a given counterfactual allows us to shift the decision towards an acceptance or a refusal. This shift is the result of applying for a second time one of the two square roots of NOT. (shrink)

Vector models of language are based on the contextual aspects of language, the distributions of words and how they co-occur in text. Truth conditional models focus on the logical aspects of language, compositional properties of words and how they compose to form sentences. In the truth conditional approach, the denotation of a sentence determines its truth conditions, which can be taken to be a truth value, a set of possible worlds, a context change potential, or similar. In the (...) class='Hi'>vector models, the degree of co-occurrence of words in context determines how similar the meanings of words are. In this paper, we put these two models together and develop a vector semantics for language based on the simply typed lambda calculus models of natural language. We provide two types of vector semantics: a static one that uses techniques familiar from the truth conditional tradition and a dynamic one based on a form of dynamic interpretation inspired by Heim’s context change potentials. We show how the dynamic model can be applied to entailment between a corpus and a sentence and provide examples. (shrink)

We show that vector space semantics and functional semantics in two-sorted first order logic are equivalent for pregroup grammars. We present an algorithm that translates functional expressions to vector expressions and vice-versa. The semantics is compositional, variable free and invariant under change of order or multiplicity. It includes the semantic vector models of Information Retrieval Systems and has an interior logic admitting a comprehension schema. A sentence is true in the interior logic if and (...) only if the ‘usual’ first order formula translating the sentence holds. The examples include negation, universal quantifiers and relative pronouns. (shrink)

Critics of reliability theories of epistemic justificationoften claim that the `generality problem' is an insurmountabledifficulty for such theories. The generality problem is theproblem of specifying the level of generality at which abelief-forming process is to be described for the purposeof assessing its reliability. This problem is not asintractable as it seems. There are illuminating solutionsto analogous problems in the ethics literature. Reliabilistsought to attend to utilitarian approaches to choices betweeninfinite utility streams; they also ought to attend towelfarist approaches to social (...) choice situations that donot demand full aggregation of individual welfares.These analogies suggest that the traditional `single number'approach to reliability is misguided. I argue that a newapproach – the `vector reliability' approach – is preferable.Vector reliability theories associate target beliefs withreliability vectors – that is, structured collections ofreliability numbers – and construct criteria of epistemicjustification that appeal to these vectors. The bulk of thetheoretical labor involved in a reliability account of epistemicjustification is thus transferred from picking a uniquereliability number to constructing a plausible criterionof epistemic justification. (shrink)

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.

Vectorization of a class of structures is a natural notion in finite model theory. Roughly speaking, vectorizations allow tuples to be treated similarly to elements of structures. The importance of vectorizations is highlighted by the fact that if the complexity class PTIME corresponds to a logic with reasonable syntax, then it corresponds to a logic generated via vectorizations by a single generalized quantifier (Dawar in J Log Comput 5(2):213–226, 1995). It is somewhat surprising, then, that there have been (...) few systematic studies of the expressive power of vectorizations of various quantifiers. In the present paper, we consider the simplest case: the cardinality quantifiers C S. We show that, in general, the expressive power of the vectorized quantifier logic $${{\rm FO}(\{{\mathsf C}_S^{(n)}\, | \, n \in \mathbb{Z}_+\})}$$ is much greater than the expressive power of the non-vectorized logic FO(C S ). (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 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.

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.

This paper uncovers the basic reason for the mysterious change of sign from plus to minus in the fourth coordinate of nature's Pythagorean law, usually accepted on empirical grounds, although it destroys the rational basis of a Riemannian geometry. Here we assume a genuine, positive-definite Riemannian space and an action principle which is quadratic in the curvature quantities (and thus scale invariant). The constant σ between the two basic invariants is equated to1/2. Then the matter tensor has the trace zero. (...) In consequence of the constancy of the scalar curvature and the divergence identity of the matter tensor, the perturbation metric has to satisfy a scalar and a vector condition, with a negative sign in the fourth coordinate. These conditions lead to the Lorentz condition and the wave equation for the vector potential. Thus the entire Maxwell-Lorentz type of electrodynamics becomes logically derivable, making no concession to any irrationality. (shrink)

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)

In this paper, we propose an annotated logic program called aVALPSN to dealwith defeasible reasoning. We propose a translation from Billington’s defeasible theory into VALPSN and clarify the relation between them based onthe translation.

CS Peirce introduced the concept of abduction into our epistemic lexicon. It is a view of problem solving that emphasizes ecological contexts, preparatory or predictive predilection knotted to learning and inquiry. Abduction is essentially tied more broadly to pragmatism. One view of the brain reflects the fact that predictive predilections knotted to abduction or hypothesis testing dominates the landscape of diverse forms of problem solving. Abduction is biologically constrained and contextual, not a monolithic term and runs the range of neural (...) capability. (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)

We develop a vector space semantics for verb phrase ellipsis with anaphora using type-driven compositional distributional semantics based on the Lambek calculus with limited contraction of Jäger. Distributional semantics has a lot to say about the statistical collocation based meanings of content words, but provides little guidance on how to treat function words. Formal semantics on the other hand, has powerful mechanisms for dealing with relative pronouns, coordinators, and the like. Type-driven compositional distributional semantics brings these two models together. (...) We review previous compositional distributional models of relative pronouns, coordination and a restricted account of ellipsis in the DisCoCat framework of Coecke et al. :1079–1100, 2013). We show how DisCoCat cannot deal with general forms of ellipsis, which rely on copying of information, and develop a novel way of connecting typelogical grammar to distributional semantics by assigning vector interpretable lambda terms to derivations of LCC in the style of Muskens and Sadrzadeh Logical aspects of computational linguistics, Springer, Berlin, 2016). What follows is an account of ellipsis in which word meanings can be copied: the meaning of a sentence is now a program with non-linear access to individual word embeddings. We present the theoretical setting, work out examples, and demonstrate our results with a state of the art distributional model on an extended verb disambiguation dataset. (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)

This article describes the use of continuous vector space models for reasoning with a formal knowledge base. The practical significance of these models is that they support fast, approximate but robust inference and hypothesis generation, which is complementary to the slow, exact, but sometimes brittle behaviour of more traditional deduction engines such as theorem provers.The article explains the way logical connectives can be used in semantic vector models, and summarizes the development of Predication-based Semantic Indexing, which involves the (...) use of Vector Symbolic Architectures to represent the concepts and relationships from a knowledge base of subject-predicate-object triples. Experiments show that the use of continuous models for formal reasoning is not only possible, but already demonstrably effective for some recognized informatics tasks, and showing promise in other traditional problem areas. Examples described in this article include: predicting new uses for existing drugs in biomedical informatics; removing unwanted meanings from search results in information retrieval and concept navigation; type inference from attributes; comparing words based on their orthography; and representing tabular data, including modelling numerical values.The algorithms and techniques described in this article are all publicly released and freely available in the Semantic Vectors open-source software package.1. (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)

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.

Eugene Wigner and others have speculated that the “collapse of the state vector” during an observation might be a physically real process so that some modification of current quantum theory would be required to describe the interaction with a conscious observer appropriately.Experimental reports on the “psychokinetic effect” as a mental influence on the outcome of quantum jumps suggest that perhaps this effect might be vital for an understanding of the observer's role in quantum mechanics.Combining these two speculations we introduce (...) a reduction principle that provides for the gradual reduction of a macroscopically ambiguous state and allows simultaneously for the occurrence of some psychokinetic effect in the process of observation.The resulting model leads to many of the paradoxical, but logically consistent, features of the psychokinetic effect that have been reported, and makes further testable predictions.The model does not touch on the more profound questions of consciousness. But the model implies that the result of a conscious observation, the collapse of the state vector, becomes accessible to the experimenter, with the psychokinetic effect as probe: Whether Schrödinger's cat has not or has collapsed the state vector determines whether or not the later human observer can still exert a psychokinetic influence on the result. (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 main scope of this short article is to provide a modification of the axioms given by Messmer and Wood for the theory of separably closed fields of positive characteristic and finite imperfectness degree. As their original axioms failed to meet natural expectations, a new axiomatization was given (i.e., Ziegler’s one), but the new axioms do not follow Messmer and Wood’s initial idea. Therefore, we aim to give a correct axiomatization that is more similar to the original one and that, (...) as with the original axioms, involves only one Hasse–Schmidt derivation, this time based on the iterativity conditions corresponding to the Witt group. (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.

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 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)

A modal accessibility relation is just a transition relation, and so can be represented by a {0, 1} valued transition matrix. Starting from this observation, I first show that the machinery of matrices, over Boolean algebras more general than the two-valued one, is appropriate for investigating multi-modal semantics. Then I show that bisimulations have a rather elegant theory, when expressed in terms of transformations on Boolean vector spaces. The resulting theory is a curious hybrid, fitting between conventional modal semantics (...) and conventional linear algebra. I don’t know where the investigations begun here will ultimately wind up, but in the meantime the approach has a kind of curious charm that others may find appealing. (shrink)

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.

Information Retrieval systems benefit from the use of long queries containing a large volume of search-relevant information. This situation is not common, as users of such systems tend to use very short and precise queries with few keywords. In this work we propose a modification of the Latent Dirichlet Allocation (LDA) technique using data from the document collection and its vocabulary for a better representation of short queries. Additionally, a study is carried out on how the modification of the proposed (...) LDA weighted vectors increase the performance using relevant documents as feedback. The work shown in this paper is tested using three biomedical corpora (TREC Genomics 2004, TREC Genomics 2005 and OHSUMED) and one legal corpus (FIRE 2017). Results prove that the application of the proposed representation technique, as well as the feedback adjustment, clearly outperforms the baseline methods (BM25 and non-modified LDA). (shrink)

Vector models of language are based on the contextual aspects of words and how they co-occur in text. Truth conditional models focus on the logical aspects of language, the denotations of phrases, and their compositional properties. In the latter approach the denotation of a sentence determines its truth conditions and can be taken to be a truth value, a set of possible worlds, a context change potential, or similar. In this short paper, we develop a vector semantics for (...) language based on the simply typed lambda calculus. Our semantics uses techniques familiar from the truth conditional tradition and is based on a form of dynamic interpretation inspired by Heim's context updates. (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.

Linear Logic was introduced by Girard as a resource-sensitive refinement of classical logic. In this paper we establish strong connections between natural fragments of Linear Logic and a number of basic concepts related to different branches of Computer Science such as Concurrency Theory, Theory of Computations, Horn Programming and Game Theory. In particular, such complete correlations allow us to introduce several new semantics for Linear Logic and to clarify many results on the complexity of natural fragments (...) of Linear Logic. As a main corollary, any non-deterministic and concurrent computation is proved to be simulated directly within the framework of each of these systems. (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)

The price of copper is unstable but it is considered an important indicator of the global economy. Changes in the price of copper point to higher global growth or an impending recession. In this work, the forecasting of the spot prices of copper from the New York Commodity Exchange is studied using a machine learning method, support vector regression coupled with different model schemas (recursive, direct and hybrid multi-step). Using these techniques, three different time series analyses are built and (...) its performance are compared. The numerical results show that the hybrid direct-recursive obtains the best results. (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.

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 ].

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)

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)