Some results on measure independent gödel speed-ups

Journal of Symbolic Logic 43 (4):667-672 (1978)
  Copy   BIBTEX

Abstract

We study the measure independent character of Godel speed-up theorems. In particular, we strengthen Arbib's necessary condition for the occurrence of a Godel speed-up [2, p. 13] to an equivalence result and generalize Di Paola's speed-up theorem [4]. We also characterize undecidable theories as precisely those theories which possess consistent measure independent Godel speed-ups and show that a theory τ 2 is a measure independent Godel speed-up of a theory τ 1 if and only if the set of undecidable sentences of τ 1 which are provable in τ 2 is not recursively enumerable

Links

PhilArchive



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

External links

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

Through your library

Similar books and articles

Two recursion theoretic characterizations of proof speed-ups.James S. Royer - 1989 - Journal of Symbolic Logic 54 (2):522-526.
Truth and speed-up.Martin Fischer - 2014 - Review of Symbolic Logic 7 (2):319-340.
Relativized Gödel speed‐up and the degree of succinctness of representations.Martin K. Solomon - 1990 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 36 (3):185-192.
Non‐elementary speed‐ups in logic calculi.Toshiyasu Arai - 2008 - Mathematical Logic Quarterly 54 (6):629-640.
A Minimal Set Low for Speed.Rod Downey & Matthew Harrison-Trainor - 2022 - Journal of Symbolic Logic 87 (4):1693-1728.
The τ-theory for free groups is undecidable.Libo Lo - 1983 - Journal of Symbolic Logic 48 (3):700-703.
A Non-arithmetical Gödel Logic.Peter Hájek - 2005 - Logic Journal of the IGPL 13 (4):435-441.

Analytics

Added to PP
2009-01-28

Downloads
43 (#110,248)

6 months
12 (#1,086,452)

Historical graph of downloads
How can I increase my downloads?

References found in this work

Computability & Unsolvability.Clifford Spector - 1958 - Journal of Symbolic Logic 23 (4):432-433.
Theory of Recursive Functions and Effective Computability.Hartley Rogers - 1971 - Journal of Symbolic Logic 36 (1):141-146.

Add more references