Number of the records: 1
Prague Bounded Arithmetic Workshop 2017
- 1.0488110 - MÚ 2018 RIV eng U - Conference, Workshop Arrangement
Thapen, Neil - Pudlák, Pavel
Prague Bounded Arithmetic Workshop 2017.
[Prague, 02.11.2017-03.11.2017, (W-WRD 30/19)]
EU Projects: European Commission(XE) 339691 - FEALORA
Institutional support: RVO:67985840
Keywords : logic * bounded arithmetic * computational complexity
OECD category: Pure mathematics
https://calendar.math.cas.cz/content/prague-bounded-arithmetic-workshop-2017
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.
Permanent Link: http://hdl.handle.net/11104/0282728
Number of the records: 1