Decorated linear order types and the theory of concatenation

&
In F. Delon (ed.), Logic Colloquium 2007. Cambridge University Press. pp. 1 (2010)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

Links

PhilArchive



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

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

Virtual modality. [REVIEW]William Boos - 2003 - Synthese 136 (3):435 - 491.
Propositions as [Types].Steve Awodey & Andrej Bauer - unknown
Intensional first-order logic with types.Shalom Lappin - unknown
Decidable discrete linear orders.M. Moses - 1988 - Journal of Symbolic Logic 53 (2):531-539.
Basic proof theory.A. S. Troelstra - 1996 - New York: Cambridge University Press. Edited by Helmut Schwichtenberg.
Peano arithmetic may not be interpretable in the monadic theory of linear orders.Shmuel Lifsches & Saharon Shelah - 1997 - Journal of Symbolic Logic 62 (3):848-872.
Linear order and its place in grammar.Richard Wiese - 2003 - Behavioral and Brain Sciences 26 (6):693-694.
Nonexistence of universal orders in many cardinals.Menachem Kojman & Saharon Shelah - 1992 - Journal of Symbolic Logic 57 (3):875-891.

Analytics

Added to PP
2009-01-28

Downloads
44 (#364,497)

6 months
7 (#441,920)

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

Undecidability without Arithmetization.Andrzej Grzegorczyk - 2005 - Studia Logica 79 (2):163-230.

Add more references