Standaard Boekhandel gebruikt cookies en gelijkaardige technologieën om de website goed te laten werken en je een betere surfervaring te bezorgen.
Hieronder kan je kiezen welke cookies je wilt inschakelen:
Technische en functionele cookies
Deze cookies zijn essentieel om de website goed te laten functioneren, en laten je toe om bijvoorbeeld in te loggen. Je kan deze cookies niet uitschakelen.
Analytische cookies
Deze cookies verzamelen anonieme informatie over het gebruik van onze website. Op die manier kunnen we de website beter afstemmen op de behoeften van de gebruikers.
Marketingcookies
Deze cookies delen je gedrag op onze website met externe partijen, zodat je op externe platformen relevantere advertenties van Standaard Boekhandel te zien krijgt.
Je kan maximaal 250 producten tegelijk aan je winkelmandje toevoegen. Verwijdere enkele producten uit je winkelmandje, of splits je bestelling op in meerdere bestellingen.
This monograph presents recursion theory from a generalized point of view centered on the computational aspects of definability. A major theme is the ...Lees meer
The book is about strong axioms of infi nity in set theory (also known as large cardinal axioms), and the ongoing search for natural models of these a...Lees meer
This volume is an introduction to inner model theory, an area of set theory which is concerned with fine structural inner models reflecting large card...Lees meer
Continuous model theory is an extension of classical first order logic which is best suited for classes of structures which are endowed with a metric....Lees meer
In this volume the author develops and applies methods for proving, from large cardinals, the determinacy of definable games of countable length on na...Lees meer
The book contains 8 detailed expositions of the lectures given at the Kaikoura 2000 Workshop on Computability, Complexity, and Computational Algebra. ...Lees meer
The starting point for this monograph is the previously unknown connection between the Continuum Hypothesis and the saturation of the non-stationary i...Lees meer
Automatic complexity is a computable and visual form of Kolmogorov complexity. Introduced by Shallit and Wang in 2001, it replaces Turing machines by ...Lees meer
The papers collected in this volume represent the main body of research arising from the International Munich Centenary Conference in 2001, which comm...Lees meer
Ordinal Computability discusses models of computation obtained by generalizing classical models, such as Turing machines or register machines, to tran...Lees meer