Books in Mathematical logic and foundations

101-110 of 141 results in All results

LOGIC COLLOQUIUM '69

• 1st Edition
• Volume 61
• April 1, 2000
• Lev D. Beklemishev
• English
• eBook 978-0-08-095474-5

  9 7 8 - 0 - 0 8 - 0 9 5 4 7 4 - 5

An Algebraic Approach to Non-Classical Logics

• 1st Edition
• Volume 78
• April 1, 2000
• Lev D. Beklemishev
• English
• eBook 978-0-08-095488-2

  9 7 8 - 0 - 0 8 - 0 9 5 4 8 8 - 2

The Metamathematics of Algebraic Systems

• 1st Edition
• Volume 66
• April 1, 2000
• Lev D. Beklemishev
• English
• eBook 978-0-08-095478-3

  9 7 8 - 0 - 0 8 - 0 9 5 4 7 8 - 3

The Theory of Semisets

• 1st Edition
• Volume 70
• April 1, 2000
• Lev D. Beklemishev
• English
• eBook 978-0-08-095481-3

  9 7 8 - 0 - 0 8 - 0 9 5 4 8 1 - 3

Truth, Syntax and Modality

• 1st Edition
• Volume 68
• April 1, 2000
• Lev D. Beklemishev
• English
• eBook 978-0-08-095479-0

  9 7 8 - 0 - 0 8 - 0 9 5 4 7 9 - 0

Word Problems

• 1st Edition
• Volume 71
• April 1, 2000
• Lev D. Beklemishev
• English
• eBook 978-0-08-095482-0

  9 7 8 - 0 - 0 8 - 0 9 5 4 8 2 - 0

Sets and Classes on The Work by Paul Bernays

• 1st Edition
• Volume 84
• April 1, 2000
• Lev D. Beklemishev
• English
• eBook 978-0-08-095494-3

  9 7 8 - 0 - 0 8 - 0 9 5 4 9 4 - 3

Algebra of Proofs

• 1st Edition
• Volume 88
• April 1, 2000
• Lev D. Beklemishev
• English
• eBook 978-0-08-095497-4

  9 7 8 - 0 - 0 8 - 0 9 5 4 9 7 - 4

Classical Recursion Theory, Volume II

• 1st Edition
• Volume 143
• September 7, 1999
• P. Odifreddi
• English
• Hardback 978-0-444-50205-6

  9 7 8 - 0 - 4 4 4 - 5 0 2 0 5 - 6

Volume II of Classical Recursion Theory describes the universe from a local (bottom-upor synthetical) point of view, and covers the whole spectrum, from therecursive to the arithmetical sets.The first half of the book provides a detailed picture of the computablesets from the perspective of Theoretical Computer Science. Besides giving adetailed description of the theories of abstract Complexity Theory and of Inductive Inference, it contributes a uniform picture of the most basic complexityclasses, ranging from small time and space bounds to the elementary functions,with a particular attention to polynomial time and space computability. It alsodeals with primitive recursive functions and larger classes, which are ofinterest to the proof theorist. The second half of the book starts with the classical theory of recursivelyenumerable sets and degrees, which constitutes the core of Recursion orComputability Theory. Unlike other texts, usually confined to the Turingdegrees, the book covers a variety of other strong reducibilities, studyingboth their individual structures and their mutual relationships. The lastchapters extend the theory to limit sets and arithmetical sets. The volumeends with the first textbook treatment of the enumeration degrees, whichadmit a number of applications from algebra to the Lambda Calculus.The book is a valuable source of information for anyone interested inComplexity and Computability Theory. The student will appreciate the detailedbut informal account of a wide variety of basic topics, while the specialistwill find a wealth of material sketched in exercises and asides. A massivebibliography of more than a thousand titles completes the treatment on thehistorical side.

Categorical Logic and Type Theory

• 1st Edition
• Volume 141
• January 14, 1999
• B. Jacobs
• English
• Paperback 978-0-444-50853-9

  9 7 8 - 0 - 4 4 4 - 5 0 8 5 3 - 9
• eBook 978-0-08-052870-0

  9 7 8 - 0 - 0 8 - 0 5 2 8 7 0 - 0

This book is an attempt to give a systematic presentation of both logic and type theory from a categorical perspective, using the unifying concept of fibred category. Its intended audience consists of logicians, type theorists, category theorists and (theoretical) computer scientists.