Hardness assumptions in the foundations of theoretical computer science

Archive for Mathematical Logic 44 (6):667-675 (2005)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1007/s00153-005-0279-x

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 93,098

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

Preface.Douglas Cenzer, Valentina Harizanov, David Marker & Carol Wood - 2009 - Archive for Mathematical Logic 48 (1):1-6.
Preface.Douglas Cenzer & Rebecca Weber - 2008 - Archive for Mathematical Logic 46 (7-8):529-531.
Well-foundedness in Realizability.M. Hofmann, J. van Oosten & T. Streicher - 2006 - Archive for Mathematical Logic 45 (7):795-805.
Computability in Europe 2008.Arnold Beckmann, Costas Dimitracopoulos & Benedikt Löwe - 2010 - Archive for Mathematical Logic 49 (2):119-121.
Erratum: “Forcing and antifoundation”. [REVIEW]Athanassios Tzouvaras - 2005 - Archive for Mathematical Logic 44 (5):663-663.
Propositional logic of continuous transformations in Cantor space.Grigori Mints & Ting Zhang - 2005 - Archive for Mathematical Logic 44 (6):783-799.
A computably stable structure with no Scott family of finitary formulas.Peter Cholak, Richard A. Shore & Reed Solomon - 2006 - Archive for Mathematical Logic 45 (5):519-538.
Overspill and fragments of arithmetic.C. Dimitracopoulos - 1989 - Archive for Mathematical Logic 28 (3):173-179.
On locally modular, weakly minimal theories.James Loveys - 1993 - Archive for Mathematical Logic 32 (3):173-194.
Sheaf toposes for realizability.Steven Awodey & Andrej Bauer - 2008 - Archive for Mathematical Logic 47 (5):465-478.

Analytics

Added to PP
2013-11-23

Downloads
67 (#249,240)

6 months
9 (#355,374)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

Bounded arithmetic, propositional logic, and complexity theory.Jan Krajíček - 1995 - New York, NY, USA: Cambridge University Press.
Tautologies from pseudo-random generators.Jan Krajíček - 2001 - Bulletin of Symbolic Logic 7 (2):197-212.
Algorithms for quantum computation: Discrete logarithms and factoring.P. Shor - 1994 - Proceedings of the 35th Annual IEEE Symposium on Foundations of Computer Science:124-134.

View all 6 references / Add more references