De Gruyter Series in Logic & its Applications – serie
Visar alla böcker i serien De Gruyter Series in Logic & its Applications. Handla med fri frakt och snabb leverans.
12 produkter
Inner Models and Large Cardinals
Av Martin Zeman
Inbunden, 2001
2826 kr
Lägg i varukorg
This volume is an introduction to inner model theory, an area of set theory which is concerned with fine structural inner models reflecting large cardinal properties of the set theoretic universe.The monograph contains a detailed presentation of general fine structure theory as well as a modern …
Recursion Theory and Complexity
Proceedings of the Kazan '97 Workshop, Kazan, Russia, July 14–19, 1997
Av M. M. Arslanov, Marat M. Arslanov m. fl.
Inbunden, 1999
2386 kr
Lägg i varukorg
No detailed description available for "Recursion Theory and Complexity".
Fine Structure and Class Forcing
Inbunden, 2000
2239 kr
Lägg i varukorg
No detailed description available for "Fine Structure and Class Forcing".
Aspects of Complexity
Minicourses in Algorithmics, Complexity and Computational Algebra. Mathematics Workshop, Kaikoura, January 7-15, 2000
Av Rod Downey, Denis R. Hirschfeldt
Inbunden, 2001
1644 kr
Lägg i varukorg
The book contains 8 detailed expositions of the lectures given at the Kaikoura 2000 Workshop on Computability, Complexity, and Computational Algebra.Topics covered include basic models and questions of complexity theory, the Blum-Shub-Smale model of computation, probability theory applied to …
One Hundred Years of Russell´s Paradox
Mathematics, Logic, Philosophy
Inbunden, 2004
3404 kr
Lägg i varukorg
The papers collected in this volume represent the main body of research arising from the International Munich Centenary Conference in 2001, which commemorated the discovery of the famous Russell Paradox a hundred years ago. The 31 contributions and the introductory essay by the editor were (with …
Determinacy of Long Games
Av Itay Neeman
Inbunden, 2004
2679 kr
Lägg i varukorg
In this volume the author develops and applies methods for proving, from large cardinals, the determinacy of definable games of countable length on natural numbers. The determinacy is ultimately derived from iteration strategies, connecting games on natural numbers with the specific iteration games …
Axiom of Determinacy, Forcing Axioms, and the Nonstationary Ideal
Inbunden, 2010
3551 kr
Lägg i varukorg
The starting point for this monograph is the previously unknown connection between the Continuum Hypothesis and the saturation of the non-stationary ideal on ω1; and the principle result of this monograph is the identification of a canonical model in which the Continuum Hypothesis is false. This is …
Recursion Theory
Computational Aspects of Definability
Inbunden, 2015
2141 kr
Lägg i varukorg
This monograph presents recursion theory from a generalized point of view centered on the computational aspects of definability. A major theme is the study of the structures of degrees arising from two key notions of reducibility, the Turing degrees and the hyperdegrees, using techniques and ideas …
Ordinal Computability
An Introduction to Infinitary Machines
Av Merlin Carl
Inbunden, 2019
1791 kr
Lägg i varukorg
Ordinal Computability discusses models of computation obtained by generalizing classical models, such as Turing machines or register machines, to transfinite working time and space. In particular, recognizability, randomness, and applications to other areas of mathematics are covered.
Ultrapower Axiom
Inbunden, 2022
2875 kr
Lägg i varukorg
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 axioms. Assuming the Ultrapower Axiom, a combinatorial principle conjectured to hold in all such natural models, we solve various classical problems …
Model Theory of Operator Algebras
Inbunden, 2023
2549 kr
Lägg i varukorg
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. Applications have grown considerably in the past decade. This book is dedicated to showing how the techniques of continuous model theory are used to …
Automatic Complexity
A Computable Measure of Irregularity
Inbunden, 2024
2369 kr
Lägg i varukorg
Automatic Complexity discusses a treatment of a computable form of Kolmogorov complexity, in which Turing machines are replaced by finite automata. The complexities of many types of words are studied, including random words, normal words, Fibonacci words, Thue words, and words produced by linear …
