The full binary tree cannot be interpreted in a chain

Journal of Symbolic Logic 75 (4):1489-1498 (2010)
  Copy   BIBTEX

Abstract

We show that for no chain C there is a monadic-second order interpretation of the full binary tree in C

Links

PhilArchive



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

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

Rabin's uniformization problem.Yuri Gurevich & Saharon Shelah - 1983 - Journal of Symbolic Logic 48 (4):1105-1119.
An axiomatization of full computation tree logic.M. Reynolds - 2001 - Journal of Symbolic Logic 66 (3):1011-1057.
Trashing life’s tree.L. R. Franklin-Hall - 2010 - Biology and Philosophy 25 (4):689-709.
Two variable first-order logic over ordered domains.Martin Otto - 2001 - Journal of Symbolic Logic 66 (2):685-702.
On the existence of strong chains in ℘(ω1)/fin.Piotr Koszmider - 1998 - Journal of Symbolic Logic 63 (3):1055 - 1062.
Ladder, tree, web.Kalevi Kull - 2003 - Sign Systems Studies 31 (2):589-602.
Building iteration trees.Alessandro Andretta - 1991 - Journal of Symbolic Logic 56 (4):1369-1384.

Analytics

Added to PP
2010-09-12

Downloads
20 (#771,752)

6 months
2 (#1,206,195)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Add more citations

References found in this work

Linear Orderings.Joseph G. Rosenstein - 1983 - Journal of Symbolic Logic 48 (4):1207-1209.
Random graphs in the monadic theory of order.Shmuel Lifsches & Saharon Shelah - 1999 - Archive for Mathematical Logic 38 (4-5):273-312.

Add more references