•  4
    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.
  •  15
    Decidability in the Constructive Theory of Reals as an Ordered ℚ‐vectorspace
    Mathematical Logic Quarterly 43 (3): 343-354. 1997.
    We show that various fragments of the intuitionistic/constructive theory of the reals are decidable
  •  28
    Investigations into Logical Deduction
    with Gerhard Gentzen and Paul Bernays
    Journal of Symbolic Logic 35 (1): 144-145. 1970.
  •  51
    Towards a natural language semantics without functors and operands
    with László Kálmán and Agi Kurucz
    Journal of Logic, Language and Information 17 (1): 1-17. 2008.
    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 interpretati…Read more
  •  14
    Undecidability of the Real-Algebraic Structure of Scott's Model
    Mathematical Logic Quarterly 44 (3): 344-348. 1998.
    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