Trees and Keislers problem

Archive for Mathematical Logic 40 (4):273-276 (2001)
  Copy   BIBTEX

Abstract

We give a new negative solution to Keisler's problem regarding Skolem functions and elementary extensions. In contrast to existing ad hoc solutions due to Payne, Knight, and Lachlan, our solution uses well-known models

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 103,667

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

Infinitary Jónsson functions and elementary embeddings.Masahiro Shioya - 1994 - Archive for Mathematical Logic 33 (2):81-86.
On elementary equivalence in fuzzy predicate logics.Pilar Dellunde & Francesc Esteva - 2013 - Archive for Mathematical Logic 52 (1-2):1-17.
Skolem functions and elementary embeddings.Julia F. Knight - 1977 - Journal of Symbolic Logic 42 (1):94-98.
First-order theories of bounded trees.Ruaan Kellerman - 2021 - Archive for Mathematical Logic 61 (1):263-297.
On Keisler singular‐like models.Shahram Mohsenipour - 2008 - Mathematical Logic Quarterly 54 (3):330-336.
Some Remarks on Finite Löwenheim‐Skolem Theorems.Martin Grohe - 1996 - Mathematical Logic Quarterly 42 (1):569-571.
Adding Skolem functions to simple theories.Herwig Nübling - 2004 - Archive for Mathematical Logic 43 (3):359-370.
Subsets of models of arithmetic.Roman Kossak & Jeffrey B. Paris - 1992 - Archive for Mathematical Logic 32 (1):65-73.

Analytics

Added to PP
2013-11-23

Downloads
29 (#837,578)

6 months
4 (#963,879)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references