Prague Bounded Arithmetic Workshop 2017
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F67985840%3A_____%2F17%3A00488110" target="_blank" >RIV/67985840:_____/17:00488110 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
Prague Bounded Arithmetic Workshop 2017
Original language description
Bounded arithmetic is an area in logic that is closely related to computational complexity. It studies weak fragments of Peano Arithmetic associated with complexity classes. The aim is to capture the reasoning that only uses concept of the corresponding computational complexity.
Czech name
—
Czech description
—
Classification
Type
W - Workshop organization
CEP classification
—
OECD FORD branch
10101 - Pure mathematics
Result continuities
Project
—
Continuities
I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace
Others
Publication year
2017
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Event location
Prague
Event country
CZ - CZECH REPUBLIC
Event starting date
—
Event ending date
—
Total number of attendees
30
Foreign attendee count
19
Type of event by attendee nationality
WRD - Celosvětová akce