Definably complete structures are not pseudo-enumerable
type: Item
instance of: scholarly article
title: Definably complete structures are not pseudo-enumerable
zbMATH Open document ID: 1220.03029
author: A. Fornasiero
published in: Archive for Mathematical Logic
publication date: 2011-08-16T00:00:00Z
Mathematics Subject Classification ID: 03C64
Mathematics Subject Classification ID: 12J15
Mathematics Subject Classification ID: 54E52
zbMATH DE Number: 5939553
zbMATH Keywords: definably complete structures
zbMATH Keywords: pseudo-enumerable sets
zbMATH Keywords: Baire structures
MaRDI profile type: Publication
full work available at URL: s00153-011-0235-x
OpenAlex ID: W1973819769
cites work: Definable versions of theorems by Kirszbraun and Helly
cites work: Locally o-minimal structures and structures with locally o-minimal open core
cites work: Dimensions, matroids, and dense pairs of first-order structures
cites work: A first-order version of Pfaffian closure
cites work: Definably complete Baire structures
cites work: Defining the set of integers in expansions of the real field by a closed discrete set
cites work: An analogue of the Baire category theorem
cites work: Expansions of dense linear orders with the intermediate value property
cites work: Q5700815
DOI: 10.1007/S00153-011-0235-X
description: scientific article; zbMATH DE number 5939553