2002 Spring Meeting of the Association for Symbolic Logic

Bulletin of Symbolic Logic 8 (3):446-451 (2002)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 101,459

External links

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

Through your library

Analytics

Added to PP
2014-03-24

Downloads
25 (#889,993)

6 months
6 (#891,985)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Paolo Mancosu
University of California, Berkeley

Citations of this work

No citations found.

Add more citations

References found in this work

The truth is never simple.John P. Burgess - 1986 - Journal of Symbolic Logic 51 (3):663-681.
Combinators and structurally free logic.J. Dunn & R. Meyer - 1997 - Logic Journal of the IGPL 5 (4):505-537.
The unfolding of non-finitist arithmetic.Solomon Feferman & Thomas Strahm - 2000 - Annals of Pure and Applied Logic 104 (1-3):75-96.
The Complexity of Revision.Gian Aldo Antonelli - 1994 - Notre Dame Journal of Formal Logic 35 (1):67-72.

View all 6 references / Add more references