Representing definable functions of HA by neighbourhood functions

Annals of Pure and Applied Logic 170 (8):891-909 (2019)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,503

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

Elementary equivalence of some rings of definable functions.Vincent Astier - 2008 - Archive for Mathematical Logic 47 (4):327-340.
On sets ∀-definable from Pfaffian functions.Ricardo Bianconi - 1992 - Journal of Symbolic Logic 57 (2):688-697.
Noetherian varieties in definably complete structures.Tamara Servi - 2008 - Logic and Analysis 1 (3-4):187-204.
Game representations of classes of piecewise definable functions.Luca Motto Ros - 2011 - Mathematical Logic Quarterly 57 (1):95-112.
On Sets $forall$-Definable From Pfaffian Functions.Ricardo Bianconi - 1992 - Journal of Symbolic Logic 57 (2):688-697.
Tame Topology over dp-Minimal Structures.Pierre Simon & Erik Walsberg - 2019 - Notre Dame Journal of Formal Logic 60 (1):61-76.
Essentially periodic ordered groups.Françoise Point & Frank O. Wagner - 2000 - Annals of Pure and Applied Logic 105 (1-3):261-291.
Expansions of the real field with power functions.Chris Miller - 1994 - Annals of Pure and Applied Logic 68 (1):79-94.
Simple monadic theories and partition width.Achim Blumensath - 2011 - Mathematical Logic Quarterly 57 (4):409-431.
Cell decomposition for semibounded p-adic sets.Eva Leenknegt - 2013 - Archive for Mathematical Logic 52 (5-6):667-688.

Analytics

Added to PP
2019-04-16

Downloads
19 (#792,513)

6 months
4 (#779,417)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

Formal systems for some branches of intuitionistic analysis.G. Kreisel - 1970 - Annals of Mathematical Logic 1 (3):229.
Functional completeness of cartesian categories.J. Lambek - 1974 - Annals of Mathematical Logic 6 (3):259.
Ordinal analysis of terms of finite type.W. A. Howard - 1980 - Journal of Symbolic Logic 45 (3):493-504.
On bar recursion of types 0 and 1.Helmut Schwichtenberg - 1979 - Journal of Symbolic Logic 44 (3):325-329.

Add more references