This HTML5 document contains 43 embedded RDF statements represented using HTML+Microdata notation.

The embedded RDF content will be recognized by any processor of HTML5 Microdata.

Namespace Prefixes

PrefixIRI
dctermshttp://purl.org/dc/terms/
n16http://linked.opendata.cz/resource/domain/vavai/riv/tvurce/
n12http://linked.opendata.cz/resource/domain/vavai/projekt/
n18http://linked.opendata.cz/resource/domain/vavai/subjekt/
n17http://linked.opendata.cz/ontology/domain/vavai/
n15http://linked.opendata.cz/resource/domain/vavai/zamer/
shttp://schema.org/
skoshttp://www.w3.org/2004/02/skos/core#
n3http://linked.opendata.cz/ontology/domain/vavai/riv/
n6http://bibframe.org/vocab/
n13http://linked.opendata.cz/resource/domain/vavai/vysledek/RIV%2F67985840%3A_____%2F11%3A00369682%21RIV12-AV0-67985840/
n2http://linked.opendata.cz/resource/domain/vavai/vysledek/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
n5http://linked.opendata.cz/ontology/domain/vavai/riv/klicoveSlovo/
n19http://linked.opendata.cz/ontology/domain/vavai/riv/duvernostUdaju/
xsdhhttp://www.w3.org/2001/XMLSchema#
n8http://linked.opendata.cz/ontology/domain/vavai/riv/jazykVysledku/
n4http://linked.opendata.cz/ontology/domain/vavai/riv/aktivita/
n20http://linked.opendata.cz/ontology/domain/vavai/riv/obor/
n11http://linked.opendata.cz/ontology/domain/vavai/riv/druhVysledku/
n7http://reference.data.gov.uk/id/gregorian-year/

Statements

Subject Item
n2:RIV%2F67985840%3A_____%2F11%3A00369682%21RIV12-AV0-67985840
rdf:type
skos:Concept n17:Vysledek
dcterms:description
We give a new characterization of the strict %22Sbjjb sentences provable using Sbkbk induction, for 1 j k. As a small application we show that, in a certain sense, Buss’s witnessing theorem for strict Sbkbk formulas already holds over the relatively weak theory PV. We exhibit a combinatorial principle with the property that a lower bound for it in constant-depth Frege would imply that the narrow CNFs with short depth j Frege refutations form a strict hierarchy with j, and hence that the relativized bounded arithmetic hierarchy can be separated by a family of %22Sb1b1 sentences. We give a new characterization of the strict %22Sbjjb sentences provable using Sbkbk induction, for 1 j k. As a small application we show that, in a certain sense, Buss’s witnessing theorem for strict Sbkbk formulas already holds over the relatively weak theory PV. We exhibit a combinatorial principle with the property that a lower bound for it in constant-depth Frege would imply that the narrow CNFs with short depth j Frege refutations form a strict hierarchy with j, and hence that the relativized bounded arithmetic hierarchy can be separated by a family of %22Sb1b1 sentences.
dcterms:title
Higher complexity search problems for bounded arithmetic and a formalized no-gap theorem Higher complexity search problems for bounded arithmetic and a formalized no-gap theorem
skos:prefLabel
Higher complexity search problems for bounded arithmetic and a formalized no-gap theorem Higher complexity search problems for bounded arithmetic and a formalized no-gap theorem
skos:notation
RIV/67985840:_____/11:00369682!RIV12-AV0-67985840
n17:predkladatel
n18:ico%3A67985840
n3:aktivita
n4:P n4:Z
n3:aktivity
P(1M0545), P(IAA100190902), P(LC505), Z(AV0Z10190503)
n3:cisloPeriodika
7-8
n3:dodaniDat
n7:2012
n3:domaciTvurceVysledku
n16:6610714
n3:druhVysledku
n11:J
n3:duvernostUdaju
n19:S
n3:entitaPredkladatele
n13:predkladatel
n3:idSjednocenehoVysledku
202048
n3:idVysledku
RIV/67985840:_____/11:00369682
n3:jazykVysledku
n8:eng
n3:klicovaSlova
bounded arithmetic; proof complexity; search problems
n3:klicoveSlovo
n5:proof%20complexity n5:search%20problems n5:bounded%20arithmetic
n3:kodStatuVydavatele
DE - Spolková republika Německo
n3:kontrolniKodProRIV
[396503786D33]
n3:nazevZdroje
Archive for Mathematical Logic
n3:obor
n20:BA
n3:pocetDomacichTvurcuVysledku
1
n3:pocetTvurcuVysledku
1
n3:projekt
n12:IAA100190902 n12:LC505 n12:1M0545
n3:rokUplatneniVysledku
n7:2011
n3:svazekPeriodika
50
n3:tvurceVysledku
Thapen, Neil
n3:wos
000300094700001
n3:zamer
n15:AV0Z10190503
s:issn
1432-0665
s:numberOfPages
16
n6:doi
10.1007/s00153-011-0240-0