Transfinite extensions of Friedberg's completeness criterion

Journal of Symbolic Logic 42 (1):1-10 (1977)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.2307/2272313

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,386

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

Completeness and conservative extension results for some Boolean relevant logics.Steve Giambrone & Robert K. Meyer - 1989 - Studia Logica 48 (1):1 - 14.
A criterion for completeness of degrees of unsolvability.Richard Friedberg - 1957 - Journal of Symbolic Logic 22 (2):159-160.
Completeness and decidability of tense logics closely related to logics above K.Frank Wolter - 1997 - Journal of Symbolic Logic 62 (1):131-158.
Completeness theorem for Dummett's LC quantified and some of its extensions.Giovanna Corsi - 1992 - Studia Logica 51 (2):317 - 335.
Canonical Extensions and Relational Completeness of Some Substructural Logics.J. Michael Dunn, Mai Gehrke & Alessandra Palmigiano - 2005 - Journal of Symbolic Logic 70 (3):713 - 740.
Transfinite Progressions: A Second Look At Completeness.Torkel Franzén - 2004 - Bulletin of Symbolic Logic 10 (3):367-389.

Analytics

Added to PP
2009-01-28

Downloads
10 (#1,168,820)

6 months
2 (#1,240,909)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

A non-inversion theorem for the jump operator.Richard A. Shore - 1988 - Annals of Pure and Applied Logic 40 (3):277-303.
Measuring complexities of classes of structures.Barbara F. Csima & Carolyn Knoll - 2015 - Annals of Pure and Applied Logic 166 (12):1365-1381.

Add more citations

References found in this work

Theory of Recursive Functions and Effective Computability.Hartley Rogers - 1971 - Journal of Symbolic Logic 36 (1):141-146.

Add more references