Embeddability of ptykes

&
Journal of Symbolic Logic 57 (2):659-676 (1992)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.2307/2275298

Links

PhilArchive



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

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

On the quasi-ordering of borel linear orders under embeddability.Alain Louveau & Jean Saint-Raymond - 1990 - Journal of Symbolic Logic 55 (2):537-560.
Embeddability, syntax, and semantics in accounts of scientific theories.Peter Turney - 1990 - Journal of Philosophical Logic 19 (4):429 - 451.
Embeddability and the word problem.Deko V. Dekov - 1995 - Journal of Symbolic Logic 60 (4):1194-1198.
Diversity of speed-ups and embeddability in computational complexity.Donald A. Alton - 1976 - Journal of Symbolic Logic 41 (1):199-214.
Borel reducibility and Hölder(α) embeddability between Banach spaces.Longyun Ding - 2012 - Journal of Symbolic Logic 77 (1):224-244.
Introduction to?2 1 -logic.Jean-Yves Girard - 1985 - Synthese 62 (2):191-216.
Proofs and types.Jean-Yves Girard - 1989 - New York: Cambridge University Press.
From foundations to ludics.Jean-Yves Girard - 2003 - Bulletin of Symbolic Logic 9 (2):131-168.
The complexity of continuous embeddability between dendrites.Alberto Marcone & Christian Rosendal - 2004 - Journal of Symbolic Logic 69 (3):663-673.

Analytics

Added to PP
2009-01-28

Downloads
26 (#596,950)

6 months
1 (#1,516,429)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Dag Normann
University of Oslo

Citations of this work

No citations found.

Add more citations

References found in this work

[product]¹2-logic, Part 1: Dilators.Jean-Yves Girard - 1981 - Annals of Mathematical Logic 21 (2):75.
Π12-logic, Part 1: Dilators.Jean-Yves Girard - 1981 - Annals of Mathematical Logic 21 (2-3):75-219.
Proof Theory and Logical Complexity.Helmut Pfeifer & Jean-Yves Girard - 1989 - Journal of Symbolic Logic 54 (4):1493.
Set recursion and Πhalf-logic.Jean-Yves Girard & Dag Normann - 1985 - Annals of Pure and Applied Logic 28 (3):255-286.
A strong boundedness theorem for dilators.A. S. Kechris & W. H. Woodin - 1991 - Annals of Pure and Applied Logic 52 (1-2):93-97.

View all 8 references / Add more references