Decidability of Scott's Model as an Ordered $\mathbb{Q}$-Vectorspace

Journal of Symbolic Logic 62 (3):917-924 (1997)
  Copy   BIBTEX

Abstract

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.

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 93,867

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Implicit Definability of Subfields.Akito Tsuboi & Kenji Fukuzaki - 2003 - Notre Dame Journal of Formal Logic 44 (4):217-225.
More on d-Logics of Subspaces of the Rational Numbers.Guram Bezhanishvili & Joel Lucero-Bryan - 2012 - Notre Dame Journal of Formal Logic 53 (3):319-345.

Analytics

Added to PP
2009-01-28

Downloads
13 (#1,040,422)

6 months
8 (#506,113)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

References found in this work

Foundations of Constructive Analysis.John Myhill - 1972 - Journal of Symbolic Logic 37 (4):744-747.
A new model for intuitionistic analysis.Philip Scowcroft - 1990 - Annals of Pure and Applied Logic 47 (2):145-165.
More on real algebra in scott's model.Philip Scowcroft - 1986 - Annals of Pure and Applied Logic 30 (3):277-291.
A transfer theorem in constructive real algebra.Philip Scowcroft - 1988 - Annals of Pure and Applied Logic 40 (1):29-87.

Add more references