Results for 'ℚ‐vectorspace'

4 found
Order:
  1.  15
    Decidability in the Constructive Theory of Reals as an Ordered ℚ‐vectorspace.Miklós Erdélyi-Szabó - 1997 - Mathematical Logic Quarterly 43 (3):343-354.
    We show that various fragments of the intuitionistic/constructive theory of the reals are decidable.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  2. Decidability in the Constructive Theory of Reals as an Ordered?? vectorspace.Mikl S. Erd lyi-Szab - 1997 - Mathematical Logic Quarterly 43 (3):343-354.
     
    Export citation  
     
    Bookmark  
  3.  17
    Decidability of Scott's Model as an Ordered $\mathbb{Q}$-Vectorspace.Miklós Erdélyi-Szabó - 1997 - Journal of Symbolic Logic 62 (3):917-924.
    Let $L = \langle, +, h_q, 1\rangle_{q \in \mathbb{Q}}$ where $\mathbb{Q}$ is the set of rational numbers and $h_q$ is a one-place function symbol corresponding to multiplication by $q$. Then the $L$-theory of Scott's model for intuitionistic analysis is decidable.
    Direct download (7 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  4.  29
    The Vector Space Kinna-Wagner Principle is Equivalent to the Axiom of Choice.Kyriakos Keremedis - 2001 - Mathematical Logic Quarterly 47 (2):205-210.
    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 (...)
    Direct download  
     
    Export citation  
     
    Bookmark   1 citation