Typical forcings, NP search problems and an extension of a theorem of Riis

Annals of Pure and Applied Logic 172 (4):102930 (2021)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Links

PhilArchive



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

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

Propositional proofs and reductions between NP search problems.Samuel R. Buss & Alan S. Johnson - 2012 - Annals of Pure and Applied Logic 163 (9):1163-1182.
Towards NP – P via proof complexity and search.Samuel R. Buss - 2012 - Annals of Pure and Applied Logic 163 (7):906-917.
Another extension of Van de Wiele's theorem.Robert S. Lubarsky - 1988 - Annals of Pure and Applied Logic 38 (3):301-306.
Perfect tree forcings for singular cardinals.Natasha Dobrinen, Dan Hathaway & Karel Prikry - 2020 - Annals of Pure and Applied Logic 171 (9):102827.
Product-free lambek calculus is NP-complete.Yury Savateev - 2012 - Annals of Pure and Applied Logic 163 (7):775-788.
On NP-completeness in Linear Logic.Alexey P. Kopylov - 1995 - Annals of Pure and Applied Logic 75 (1-2):137-152.
A recursion-theoretic approach to NP.Isabel Oitavem - 2011 - Annals of Pure and Applied Logic 162 (8):661-666.

Analytics

Added to PP
2020-12-18

Downloads
6 (#711,559)

6 months
18 (#821,922)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Add more citations

References found in this work

Bounded arithmetic and the polynomial hierarchy.Jan Krajíček, Pavel Pudlák & Gaisi Takeuti - 1991 - Annals of Pure and Applied Logic 52 (1-2):143-153.
Incompleteness in the Finite Domain.Pavel Pudlák - 2017 - Bulletin of Symbolic Logic 23 (4):405-441.
Dual weak pigeonhole principle, Boolean complexity, and derandomization.Emil Jeřábek - 2004 - Annals of Pure and Applied Logic 129 (1-3):1-37.

View all 12 references / Add more references