Logical Methods: In Honor of Anil Nerode’s Sixtieth Birthday: 12 - Rilegato

Rilegato

ISBN 10: 0817636900 ISBN 13: 9780817636906

Casa editrice: Birkhauser Boston Inc, 1994

Riassunto

Anil Nerode, Director of the Mathematics Institute at Cornell, USA, is one of the most influential logicians in the world. This volume, published in his honour, contains much new and significant work. The papers in this book are principally concerned with mathematical logic and some of its applications in computing. The book contains papers on recursion theory, intuitionism, computability in group theory, recursive model theory, reverse mathematics and the extraction of programs from proofs. A survey of Nerode's technical achievements over the last 30 years is also included. In particular, the book features papers on new developments in the understanding of the properties of intuitionistic set theory and intuitionistic analysis, the extension of computability in ordinary mathematics pioneered by Marian Boykan Pour-El and Ian Richards, the proof-theoretic strength of a long-standing conjecture of Fraisse and an extension of, and further account of, the Curry-Howard method of extracting programs from logical proofs. The papers in general arose from the conference, "Logical Methods in Mathematics and Computer Science. A Symposium in Honor of Anil Nerode on the Occasion of his Sixtieth Birthday", held at the Mathematical Sciences Institute at Cornell University, from June 1-3, 1992.

Su questo libro

Contenuti

The Work of Anil Nerode: A Retrospective.- Embedding Distributive Lattices Preserving 1 Below A Nonzero Recursively Enumerable Turing Degree.- Prime Isols and the Theorems of Fermat and Wilson.- Problem Solving Strategies for the Derivation of Programs.- Effective Real Dynamics.- An Integer Lattice Arising in the Model Theory of Wreath Products.- Undecidability and Definability for Parametrized Polynomial Time m-Reducibilities.- Extracting Programs from Proofs by an Extension of the Curry-Howard Process.- A Bird’s-Eye View of Twilight Combinatorics.- Effectively and Noneffectively Nowhere Simple Subspaces.- Index Sets in Recursive Combinatorics.- Computability in Unitary Representations of Compact Groups.- Recursive Properties of Intervals of Recursive Linear Orders.- Algorithmic Stability of Models.- The Combinatorics of the Friedberg-Muchnick Theorem.- Partial Automata and Finitely Generated Congruences: An Extension of Nerode’s Theorem.- Minimal Pair Constructions and Iterated Trees of Strategies.- Intuitionistic L.- n-Recursive Linear Orders Without (n + 1)-Recursive Copies.- Multiple Agent Autonomous Control — A Hybrid Systems Architecture.- Distributed Concurrent Programs as Strategies in Games.- Dempster-Shafer Logic Programs and Stable Semantics.- Who Put the “Back” in Back-and-Forth?.- Polynomial Time Categoricity and Linear Orderings.- The Disjunction and Numerical Existence Properties for Intuitionistic Analysis.- On the Strength of Fraïssé’s Conjecture.

Product Description

Book by None

Dettagli dell'edizione

• Editore: Birkhauser Boston Inc
• Data di pubblicazione: 1994
• Lingua: Inglese
• ISBN 10: 0817636900
• ISBN 13: 9780817636906
• Rilegatura: Copertina rigida
• Numero di pagine: 830
• Redattore: Crossley John N., Remmel Jeffrey B., Shore Richard, Sweedler Moss E.
• Contatto del produttore: non disponibile
• Persona responsabile: non disponibile