Some Key Techniques on Pairing Vector Spaces

2011 ◽  
pp. 380-382 ◽  
Author(s):  
Tatsuaki Okamoto ◽  
Katsuyuki Takashima
Keyword(s):  
Vector Spaces ◽  
Key Techniques

Model Based Defect Detection in Multi-Dimensional Vector Spaces

2011 ◽  
Vol 131 (9) ◽  
pp. 1633-1641
Author(s):  
Toshifumi Honda ◽  
Kenji Obara ◽  
Minoru Harada ◽  
Hajime Igarashi
Keyword(s):  
Defect Detection ◽  
Vector Spaces ◽  
Dimensional Vector ◽  
Model Based

A closer look at the stable completion

2017 ◽  
Author(s):  
Ehud Hrushovski ◽  
François Loeser
Keyword(s):  
Inverse Limit ◽  
Unit Vector ◽  
Vector Spaces ◽  
Dimensional Vector ◽  
Compact Sets ◽  
Linear Topology ◽  
Topological Embedding ◽  
Definable Set ◽  
Finite Dimensional ◽  
The One

This chapter introduces the concept of stable completion and provides a concrete representation of unit vector Mathematical Double-Struck Capital A superscript n in terms of spaces of semi-lattices, with particular emphasis on the frontier between the definable and the topological categories. It begins by constructing a topological embedding of unit vector Mathematical Double-Struck Capital A superscript n into the inverse limit of a system of spaces of semi-lattices L(Hsubscript d) endowed with the linear topology, where Hsubscript d are finite-dimensional vector spaces. The description is extended to the projective setting. The linear topology is then related to the one induced by the finite level morphism L(Hsubscript d). The chapter also considers the condition that if a definable set in L(Hsubscript d) is an intersection of relatively compact sets, then it is itself relatively compact.

Stable and Supported Semantics in Continuous Vector Spaces

2020 ◽  
Author(s):  
Yaniv Aspis ◽  
Krysia Broda ◽  
Alessandra Russo ◽  
Jorge Lobo
Keyword(s):  
Logic Program ◽  
Matrix Multiplication ◽  
Vector Spaces ◽  
Continuous Space ◽  
Continuous Vector ◽  
Novel Approach ◽  
Gradient Based ◽  
Normal Logic ◽  
Parameter Values ◽  
Normal Logic Program

We introduce a novel approach for the computation of stable and supported models of normal logic programs in continuous vector spaces by a gradient-based search method. Specifically, the application of the immediate consequence operator of a program reduct can be computed in a vector space. To do this, Herbrand interpretations of a propositional program are embedded as 0-1 vectors in $\mathbb{R}^N$ and program reducts are represented as matrices in $\mathbb{R}^{N \times N}$. Using these representations we prove that the underlying semantics of a normal logic program is captured through matrix multiplication and a differentiable operation. As supported and stable models of a normal logic program can now be seen as fixed points in a continuous space, non-monotonic deduction can be performed using an optimisation process such as Newton's method. We report the results of several experiments using synthetically generated programs that demonstrate the feasibility of the approach and highlight how different parameter values can affect the behaviour of the system.

Finite dimensional locally convex cones

Filomat ◽  
2017 ◽  
Vol 31 (16) ◽  
pp. 5111-5116
Author(s):  
Davood Ayaseha
Keyword(s):  
Finite Dimension ◽  
Convex Cones ◽  
Vector Spaces ◽  
Topological Vector Spaces ◽  
Euclidean Topology ◽  
Finite Dimensional ◽  
Dimensional Cone ◽  
Locally Convex Cones ◽  
Locally Convex ◽  
Special Case

We study the locally convex cones which have finite dimension. We introduce the Euclidean convex quasiuniform structure on a finite dimensional cone. In special case of finite dimensional locally convex topological vector spaces, the symmetric topology induced by the Euclidean convex quasiuniform structure reduces to the known concept of Euclidean topology. We prove that the dual of a finite dimensional cone endowed with the Euclidean convex quasiuniform structure is identical with it?s algebraic dual.

Examples of theories of presheaf type

2018 ◽  
Author(s):  
Olivia Caramello
Keyword(s):  
Finite Groups ◽  
Linear Independence ◽  
Geometric Theory ◽  
Vector Spaces ◽  
Linear Orders ◽  
Locally Finite ◽  
Strong Unit ◽  
Locally Finite Groups ◽  
Simplicial Sets ◽  
Separable Extensions

This chapter discusses several classical as well as new examples of theories of presheaf type from the perspective of the theory developed in the previous chapters. The known examples of theories of presheaf type that are revisited in the course of the chapter include the theory of intervals (classified by the topos of simplicial sets), the theory of linear orders, the theory of Diers fields, the theory of abstract circles (classified by the topos of cyclic sets) and the geometric theory of finite sets. The new examples include the theory of algebraic (or separable) extensions of a given field, the theory of locally finite groups, the theory of vector spaces with linear independence predicates and the theory of lattice-ordered abelian groups with strong unit.

Sign in / Sign up

Export Citation Format

Share Document