5 found
Order:
See also
  1.  7
    Undecidability of the Real-Algebraic Structure of Scott's Model.Miklós Erdélyi-Szabó - 1998 - Mathematical Logic Quarterly 44 (3):344-348.
    We show that true first-order arithmetic of the positive integers is interpretable over the real-algebraic structure of Scott's topological model for intuitionistic analysis. From this the undecidability of the structure follows.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  2.  12
    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 (3 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  3.  6
    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 (8 more)  
     
    Export citation  
     
    Bookmark  
  4.  33
    Towards a Natural Language Semantics Without Functors and Operands.Miklós Erdélyi-Szabó, László Kálmán & Agi Kurucz - 2008 - Journal of Logic, Language and Information 17 (1):1-17.
    The paper sets out to offer an alternative to the function/argument approach to the most essential aspects of natural language meanings. That is, we question the assumption that semantic completeness (of, e.g., propositions) or incompleteness (of, e.g., predicates) exactly replicate the corresponding grammatical concepts (of, e.g., sentences and verbs, respectively). We argue that even if one gives up this assumption, it is still possible to keep the compositionality of the semantic interpretation of simple predicate/argument structures. In our opinion, compositionality presupposes (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  5.  15
    Undecidability of the Real-Algebraic Structure of Models of Intuitionistic Elementary Analysis.Miklós Erdélyi-Szabó - 2000 - Journal of Symbolic Logic 65 (3):1014-1030.
    We show that true first-order arithmetic is interpretable over the real-algebraic structure of models of intuitionistic analysis built upon a certain class of complete Heyting algebras. From this the undecidability of the structures follows. We also show that Scott's model is equivalent to true second-order arithmetic. In the appendix we argue that undecidability on the language of ordered rings follows from intuitionistically plausible properties of the real numbers.
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark