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

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

Namespace Prefixes

PrefixIRI
n5http://linked.opendata.cz/ontology/domain/vavai/riv/typAkce/
dctermshttp://purl.org/dc/terms/
n12http://purl.org/net/nknouf/ns/bibtex#
n10http://linked.opendata.cz/resource/domain/vavai/riv/tvurce/
n7http://linked.opendata.cz/resource/domain/vavai/projekt/
n17http://linked.opendata.cz/ontology/domain/vavai/
n13http://linked.opendata.cz/resource/domain/vavai/zamer/
n4https://schema.org/
shttp://schema.org/
skoshttp://www.w3.org/2004/02/skos/core#
n3http://linked.opendata.cz/ontology/domain/vavai/riv/
n19http://linked.opendata.cz/resource/domain/vavai/vysledek/RIV%2F67985840%3A_____%2F10%3A00353758%21RIV11-MSM-67985840/
n2http://linked.opendata.cz/resource/domain/vavai/vysledek/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
n15http://linked.opendata.cz/ontology/domain/vavai/riv/klicoveSlovo/
n9http://linked.opendata.cz/ontology/domain/vavai/riv/duvernostUdaju/
xsdhhttp://www.w3.org/2001/XMLSchema#
n18http://linked.opendata.cz/ontology/domain/vavai/riv/jazykVysledku/
n6http://linked.opendata.cz/ontology/domain/vavai/riv/aktivita/
n16http://linked.opendata.cz/ontology/domain/vavai/riv/druhVysledku/
n14http://linked.opendata.cz/ontology/domain/vavai/riv/obor/
n20http://reference.data.gov.uk/id/gregorian-year/

Statements

Subject Item
n2:RIV%2F67985840%3A_____%2F10%3A00353758%21RIV11-MSM-67985840
rdf:type
skos:Concept n17:Vysledek
dcterms:description
We study several situations where it is possible to extract a feasible computational information from a proof, either in a first-order theory or in a propositional proof system. We study several situations where it is possible to extract a feasible computational information from a proof, either in a first-order theory or in a propositional proof system.
dcterms:title
From feasible proofs to feasible computations From feasible proofs to feasible computations
skos:prefLabel
From feasible proofs to feasible computations From feasible proofs to feasible computations
skos:notation
RIV/67985840:_____/10:00353758!RIV11-MSM-67985840
n3:aktivita
n6:P n6:Z
n3:aktivity
P(IAA100190902), P(LC505), Z(AV0Z10190503), Z(MSM0021620839)
n3:dodaniDat
n20:2011
n3:domaciTvurceVysledku
n10:9626913
n3:druhVysledku
n16:D
n3:duvernostUdaju
n9:S
n3:entitaPredkladatele
n19:predkladatel
n3:idSjednocenehoVysledku
259855
n3:idVysledku
RIV/67985840:_____/10:00353758
n3:jazykVysledku
n18:eng
n3:klicovaSlova
lengths of proofs; computational time
n3:klicoveSlovo
n15:computational%20time n15:lengths%20of%20proofs
n3:kontrolniKodProRIV
[3B275A2C5405]
n3:mistoKonaniAkce
Brno
n3:mistoVydani
Heidelberg
n3:nazevZdroje
Computer science logic 2010
n3:obor
n14:BA
n3:pocetDomacichTvurcuVysledku
1
n3:pocetTvurcuVysledku
1
n3:projekt
n7:LC505 n7:IAA100190902
n3:rokUplatneniVysledku
n20:2010
n3:tvurceVysledku
Krajíček, Jan
n3:typAkce
n5:WRD
n3:zahajeniAkce
2010-08-23+02:00
n3:zamer
n13:AV0Z10190503 n13:MSM0021620839
s:numberOfPages
10
n12:hasPublisher
Springer-Verlag
n4:isbn
978-3-642-15204-7