Polynomial-time analogues of isolatedness

Annals of Pure and Applied Logic 56 (1-3):173-182 (1992)
  Copy   BIBTEX

Abstract

Recently, Nerode and Remmel have developed a polynomial-time version of the theory of recursive equivalence types and have defined two analogues of isolatedness for that setting. This paper examines various properties of those two analogues and investigates their relationship to additive cancellability

Categories

Keywords

Reprint years

DOI

10.1016/0168-0072(92)90072-8

Links

PhilArchive



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

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

On the lattices of NP-subspaces of a polynomial time vector space over a finite field.Anil Nerode & J. B. Remmel - 1996 - Annals of Pure and Applied Logic 81 (1-3):125-170.
BLASS. A., A game semantics for linear logic CENZER, D. and REMMEL, J., Polynomial-time Abehan groups CLOTE, P. and TAKEUTI, G., Bounded arithmetic for NC, ALogTIME, L and NL. [REVIEW]P. Lincoln, J. Mitchell & A. Scedrov - 1992 - Annals of Pure and Applied Logic 56:365.
The bounded injury priority method and the learnability of unions of rectangles.Zhixiang Chen & Steven Homer - 1996 - Annals of Pure and Applied Logic 77 (2):143-168.
Feasible graphs with standard universe.Douglas Cenzer & Jeffrey B. Remmel - 1998 - Annals of Pure and Applied Logic 94 (1-3):21-35.
Set theoretical analogues of the Barwise-Schlipf theorem.Ali Enayat - 2022 - Annals of Pure and Applied Logic 173 (9):103158.
Polynomial-time abelian groups.Douglas Cenzer & Jeffrey Remmel - 1992 - Annals of Pure and Applied Logic 56 (1-3):313-363.
Addendum to “Choiceless polynomial time”.Andreas Blass, Yuri Gurevich & Saharon Shelah - 2001 - Annals of Pure and Applied Logic 112 (1):117.
Completeness proofs for propositional logic with polynomial-time connectives.John N. Crossley & Philip J. Scott - 1989 - Annals of Pure and Applied Logic 44 (1-2):39-52.
Feasible Graphs and Colorings.Douglas Cenzer & Jeffrey Remmel - 1995 - Mathematical Logic Quarterly 41 (3):327-352.
Polynomial-time versus recursive models.Douglas Cenzer & Jeffrey Remmel - 1991 - Annals of Pure and Applied Logic 54 (1):17-58.

Analytics

Added to PP
2014-01-16

Downloads
4 (#1,642,858)

6 months
1 (#1,719,665)

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

No references found.

Add more references