Logic and computational complexity : international workshop, LCC '94, Indianapolis, IN, USA, October 13-16, 1994 : selected papers
This book contains revised versions of papers invited for presentation at the International Workshop on Logic and Computational Complexity, LCC '94, held in Indianapolis, IN in October 1994. The synergy between logic and computational complexity has gained importance and vigor in recent years,...
Guardado en:
| Autor principal: | |
|---|---|
| Formato: | Livre numérique |
| Lenguaje: | Anglais |
| Publicado: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| Colección: | Lecture notes in computer science
960 |
| Materias: | |
| Acceso en línea: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Nota: |
Actes d'un séminaire tenu à Indianapolis du 13 au 16 octobre 1994, d'après l écran-titre Archives Springer e-books (Licence nationale) Archives Springer e-books (Licence nationale) |
| Autres localisations: | Voir dans le Sudoc |
| Edition sous un autre format: | • Logic and computational complexity, international workshop, LCC '94, Indianapolis, IN, USA, October 13-16, 1994, selected papers, Daniel Leivant (ed.), Berlin, Springer, 1995, 1 vol. (VIII-514 p.), Lecture notes in computer science, 3-540-60178-3 • Logic and Computational Complexity, Texte imprimé, 9783662195796 |
Tabla de Contenidos:
- Strict finitism and feasibility
- Logical omniscience
- On feasible numbers
- On parallel hierarchies and R k i
- Program extraction from classical proofs
- Computation models and function algebras
- Expressing computational complexity in constructive type theory
- Light linear logic
- Intrinsic theories and computational complexity
- On Herbrand's theorem
- Some consequences of cryptographical conjectures for S 2 1 and EF
- Frege proof system and TNC˚-- Characterizing parallel time by type 2 recursions with polynomial output length
- Type 2 polynomial hierarchies
- The hierarchy of terminating recursive programs over N
- Feasibly categorical models
- Metafinite model theory
- Automatic presentations of structures
- A restricted second order logic for finite structures
- Comparing the power of monadic NP games
- Linear constraint query languages expressive power and complexity
- A constant-space sequential model of computation for first-order logic
- Logics capturing relativized complexity classes uniformly
- Preservation theorems in finite model theory
- A query language for NC (extended abstract).