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

Categories

Keywords

Reprint years

DOI

10.1007/s001530000061

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 92,611

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

Results on the Generic Kurepa Hypothesis.R. B. Jensen & K. Schlechta - 1990 - Archive for Mathematical Logic 30 (1):13-27.
Uniformization, choice functions and well orders in the class of trees.Shmuel Lifsches & Saharon Shelah - 1996 - Journal of Symbolic Logic 61 (4):1206-1227.
Game Trees For Decision Analysis.Prakash P. Shenoy - 1998 - Theory and Decision 44 (2):149-171.
Skolem functions and elementary embeddings.Julia F. Knight - 1977 - Journal of Symbolic Logic 42 (1):94-98.
On Scott and Karp trees of uncountable models.Tapani Hyttinen & Jouko Väänänen - 1990 - Journal of Symbolic Logic 55 (3):897-908.
Perfect trees and elementary embeddings.Sy-David Friedman & Katherine Thompson - 2008 - Journal of Symbolic Logic 73 (3):906-918.
Minimal realizability of intuitionistic arithmetic and elementary analysis.Zlatan Damnjanovic - 1995 - Journal of Symbolic Logic 60 (4):1208-1241.
Finite Tree Property for First-Order Logic with Identity and Functions.Merrie Bergmann - 2005 - Notre Dame Journal of Formal Logic 46 (2):173-180.
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.
Computable Trees of Scott Rank [image] , and Computable Approximation.Wesley Calvert, Julia F. Knight & Jessica Millar - 2006 - Journal of Symbolic Logic 71 (1):283 - 298.
Computable Trees of Scott Rank $\omega _{1}^{\mathit{CK}}$ , and Computable Approximation.Wesley Calvert, Julia F. Knight & Jessica Millar - 2006 - Journal of Symbolic Logic 71 (1):283 - 298.
The Mathematics of Skolem's Paradox.Timothy Bays - 2002 - In Dale Jacquette (ed.), Philosophy of Logic. Malden, Mass.: North Holland. pp. 615--648.

Analytics

Added to PP
2013-11-23

Downloads
21 (#743,384)

6 months
8 (#373,162)

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