Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

16

STACS
1993
Springer

favoriteEmaildiscussreport

110views Theoretical Computer Science» more STACS 1993»

A First-Order Isomorphism Theorem

13 years 8 months ago

A First-Order Isomorphism Theorem

Download www.cs.umass.edu

We show that for most complexity classes of interest, all sets complete under rstorder projections (fops) are isomorphic under rst-order isomorphisms. That is, a very restricted version of the Berman-Hartmanis Conjecture holds. Since \natural" complete problems seem to stay complete via fops, this indicates that up to rst-order isomorphism there is only one \natural" complete problem for each \nice" complexity class.

Eric Allender, José L. Balcázar, Nei

Real-time Traffic

Complete Problem | Complexity Classes | Rst-order Isomorphism | STACS 1993 | Theoretical Computer Science |

claim paper

Related Content

» The FirstOrder Isomorphism Theorem

» The First Order Theories of the Medvedev and Muchnik Lattices

» MSPASS Modal Reasoning by Translation and FirstOrder Resolution

» FirstOrder Logic Formalisation of Arrows Theorem

» Herbrands Theorem Skolemization and Proof Systems for FirstOrder Lukasiewicz Logic

» A Focusing Inverse Method Theorem Prover for FirstOrder Linear Logic

» Comparing Unification Algorithms in FirstOrder Theorem Proving

» Using FirstOrder Theorem Provers in the Jahob Data Structure Verification System

» Clausal ConnectionBased Theorem Proving in Intuitionistic FirstOrder Logic

Post Info
More Details (n/a)

Added	10 Aug 2010
Updated	10 Aug 2010
Type	Conference
Year	1993
Where	STACS
Authors	Eric Allender, José L. Balcázar, Neil Immerman

Comments (0)