Complexity, logic, and recursion theory

✍ Scribed by Andrea Sorbi

Publisher: CRC Press
Year: 1997
Tongue: English
Leaves: 366
Series: Lecture Notes in Pure and Applied Mathematics
Edition: 1
Category: Library

No coin nor oath required. For personal study only.

✦ Synopsis

Integrating two classical approaches to computability, this timely reference offers detailed coverage of recent research at the interface of logic, computability theory, and theoretical computer science. Presents new, never-before-published results and provides information not easily accessible in the literature.

📜 SIMILAR VOLUMES

Complexity, logic, and recursion theory

📁 Complexity, logic, and recursion theory

✍ Sorbi, Andrea 📂 Library 📅 2019 🏛 CRC Press 🌐 English

"Integrates two classical approaches to computability. Offers detailed coverage of recent research at the interface of logic, computability theory, nd theoretical computer science. Presents new, never-before-published results and provides informtion not easily accessible in the literature."</div> <

Complexity, logic, and recursion theory

📁 Complexity, logic, and recursion theory

✍ Andrea Sorbi 📂 Library 📅 1997 🏛 CRC Press 🌐 English

Recursion Theory and Computational Compl

📁 Recursion Theory and Computational Complexity

✍ Steve Homer (auth.), G. Lolli (eds.) 📂 Library 📅 2011 🏛 Springer-Verlag Berlin Heidelberg 🌐 English

<p>S. Homer: Admissible recursion theory.- B.E. Jacobs: Computational complexity and recursion theory.- D. Normann: A survey of set recursion.- G.E. Sacks: Priority arguments in Higgler recursion.- R.I. Soare: Construction in the recursively enumerable degrees.- W. Maass: Recursively invariant recur

Recursion Theory and Computational Compl

📁 Recursion Theory and Computational Complexity

✍ Steve Homer (auth.), G. Lolli (eds.) 📂 Library 📅 2011 🏛 Springer-Verlag Berlin Heidelberg 🌐 English

Recursive function theory and logic

📁 Recursive function theory and logic

✍ Ann Yasuhara 📂 Library 📅 1971 🏛 Academic Press 🌐 English

Bounded arithmetic, propositional logic

📁 Bounded arithmetic, propositional logic and complexity theory

✍ Jan Krajicek 📂 Library 📅 1995 🏛 Cambridge University Press 🌐 English