Logical foundations of mathematics and computational complexity : a gentle introduction
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F67985840%3A_____%2F13%3A00393022" target="_blank" >RIV/67985840:_____/13:00393022 - isvavai.cz</a>
Result on the web
<a href="http://dx.doi.org/10.1007/978-3-319-00119-7" target="_blank" >http://dx.doi.org/10.1007/978-3-319-00119-7</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1007/978-3-319-00119-7" target="_blank" >10.1007/978-3-319-00119-7</a>
Alternative languages
Result language
angličtina
Original language name
Logical foundations of mathematics and computational complexity : a gentle introduction
Original language description
The two main themes of the book, logic and complexity, are connected by both being important for understanding the main problems about the foundations of mathematics. The book covers a broad spectrum of results in logic and set theory that are relevant to foundations, as well as results in computational complexity and the interdisciplinary area of proof complexity. The author also presents his ideas on how these areas are connected, what are the most fundamental problems and how should be approached.
Czech name
—
Czech description
—
Classification
Type
B - Specialist book
CEP classification
BA - General mathematics
OECD FORD branch
—
Result continuities
Project
<a href="/en/project/IAA100190902" target="_blank" >IAA100190902: Mathematical logic, complexity, and algorithms</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>Z - Vyzkumny zamer (s odkazem do CEZ)<br>I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace
Others
Publication year
2013
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
ISBN
978-3-319-00118-0
Number of pages
695
Publisher name
Springer
Place of publication
Heidelberg
UT code for WoS book
—