Switch to: References

Add citations

You must login to add citations.
  1. A transfer theorem in constructive real algebra.Philip Scowcroft - 1988 - Annals of Pure and Applied Logic 40 (1):29-87.
  • A new model for intuitionistic analysis.Philip Scowcroft - 1990 - Annals of Pure and Applied Logic 47 (2):145-165.
  • A transfer theorem in constructive p-adic algebra.Deirdre Haskell - 1992 - Annals of Pure and Applied Logic 58 (1):29-55.
    The main result of this paper is a transfer theorem which describes the relationship between constructive validity and classical validity for a class of first-order sentences over the p-adics. The proof of one direction of the theorem uses a principle of intuitionism; the proof of the other direction is classically valid. Constructive verifications of known properties of the p-adics are indicated. In particular, the existence of cylindric algebraic decompositions for the p-adics is used.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark  
  • Encoding true second‐order arithmetic in the real‐algebraic structure of models of intuitionistic elementary analysis.Miklós Erdélyi-Szabó - 2021 - Mathematical Logic Quarterly 67 (3):329-341.
    Based on the paper [4] we show that true second‐order arithmetic is interpretable over the real‐algebraic structure of models of intuitionistic analysis built upon a certain class of complete Heyting algebras.
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  • 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