The Resource Logic and computational complexity : international workshop, LCC '94, Indianapolis, IN, USA, October 13-16, 1994 : selected papers, Daniel Leivant (ed.)
Logic and computational complexity : international workshop, LCC '94, Indianapolis, IN, USA, October 13-16, 1994 : selected papers, Daniel Leivant (ed.)
Resource Information
The item Logic and computational complexity : international workshop, LCC '94, Indianapolis, IN, USA, October 13-16, 1994 : selected papers, Daniel Leivant (ed.) represents a specific, individual, material embodiment of a distinct intellectual or artistic creation found in University of Missouri Libraries.This item is available to borrow from 1 library branch.
Resource Information
The item Logic and computational complexity : international workshop, LCC '94, Indianapolis, IN, USA, October 13-16, 1994 : selected papers, Daniel Leivant (ed.) represents a specific, individual, material embodiment of a distinct intellectual or artistic creation found in University of Missouri Libraries.
This item is available to borrow from 1 library branch.
- Summary
- 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, cutting across many areas. The 25 revised full papers in this book contributed by internationally outstanding researchers document the state-of-the-art in this interdisciplinary field of growing interest; they are presented in sections on foundational issues, applicative and proof-theoretic complexity, complexity of proofs, computational complexity of functionals, complexity and model theory, and finite model theory
- Language
- eng
- Extent
- 1 online resource (viii, 514 pages)
- Contents
-
- Strict finitism and feasibility / Felice Cardone
- Logical omniscience / Rohit Parikh
- On feasible numbers / Vladimir Yu. Sazonov
- On parallel hierarchies and R[i over k] / Stephen Bloch
- Program extraction from classical proofs / Ulrich Berger and Helmut Schwichtenberg
- Computational models and function algebras / Peter Clote
- Expressing computational complexity in constructive type theory / Robert L. Constable
- Light linear logic / Jean-Yves Girard
- Intrinsic theories and computational complexity / Daniel Leivant
- On Herbrand's theorem / Samuel R. Buss
- Some consequences of cryptographical conjectures for S1/2 and EF / Jan Krajíček and Pavel Pudlák
- Frege proof system and TNC[superscript] ̊/ Gaisi Takeuti
- Characterizing parallel time by type 2 recursions with polynomial output length / Stephen J. Bellantoni
- Type 2 polynomial hierarchies / Anil Seth
- The hierarchy of terminating recursive programs over N / Stanley S. Wainer
- Feasibly categorical models / Douglas Cenzer and Jeffrey B. Remmel
- Metafinite model theory / Erich Grädel and Yuri Gurevich
- Automatic presentations of structures / Bakhadyr Khoussainov and Anil Nerode
- A restricted second order logic for finite structures / Anuj Dawar
- Comparing the power of monadic NP games / Ronald Fagin
- Linear constraint query languages : expressive power and complexity / Stéphane Grumbach, Jianwen Su, and Christophe Tollu
- A constant-space sequential model of computation for first-order logic / Steven Lindell
- Logics capturing relativized complexity classes uniformly / J.A. Makowsky and Y.B. Pnueli
- Preservations theorems in finite model theory / Eric Rosen and Scott Weinstein
- A query language for NC / Dan Suciu and Val Breazu-Tannen
- Isbn
- 9783540447207
- Label
- Logic and computational complexity : international workshop, LCC '94, Indianapolis, IN, USA, October 13-16, 1994 : selected papers
- Title
- Logic and computational complexity
- Title remainder
- international workshop, LCC '94, Indianapolis, IN, USA, October 13-16, 1994 : selected papers
- Statement of responsibility
- Daniel Leivant (ed.)
- Title variation
- LCC '94
- Subject
-
- Berechnungskomplexität
- Berechnungstheorie
- Beweistheorie
- Complexiteit
- Complexité de calcul (Informatique) -- Congrès
- Complexité de calcul (informatique)
- Computational complexity
- Computational complexity
- Computational complexity -- Congresses
- Conference papers and proceedings
- Conference papers and proceedings
- Datenverarbeitung
- Indianapolis (Ind., 1994)
- Indianapolis <Ind., 1994>
- Komplexität
- Komplexitätstheorie
- Logic, Symbolic and mathematical
- Logic, Symbolic and mathematical
- Logic, Symbolic and mathematical -- Congresses
- Logica
- Logik
- Logique symbolique et mathématique
- Logique symbolique et mathématique -- Congrès
- Mathematische Logik
- Language
- eng
- Summary
- 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, cutting across many areas. The 25 revised full papers in this book contributed by internationally outstanding researchers document the state-of-the-art in this interdisciplinary field of growing interest; they are presented in sections on foundational issues, applicative and proof-theoretic complexity, complexity of proofs, computational complexity of functionals, complexity and model theory, and finite model theory
- Cataloging source
- SCPER
- Dewey number
- 511.3
- Illustrations
- illustrations
- Index
- no index present
- LC call number
- QA9.A1
- LC item number
- L625 1995
- Literary form
- non fiction
- Nature of contents
-
- dictionaries
- bibliography
- http://library.link/vocab/relatedWorkOrContributorName
- Leivant, Daniel Maurice Raphaël
- Series statement
- Lecture notes in computer science
- Series volume
- 960
- http://library.link/vocab/subjectName
-
- Logic, Symbolic and mathematical
- Computational complexity
- Complexité de calcul (Informatique)
- Logique symbolique et mathématique
- Computational complexity
- Logic, Symbolic and mathematical
- Berechnungskomplexität
- Berechnungstheorie
- Beweistheorie
- Datenverarbeitung
- Komplexität
- Komplexitätstheorie
- Logik
- Mathematische Logik
- Logica
- Complexiteit
- Logique symbolique et mathématique
- Complexité de calcul (informatique)
- Indianapolis <Ind., 1994>
- Label
- Logic and computational complexity : international workshop, LCC '94, Indianapolis, IN, USA, October 13-16, 1994 : selected papers, Daniel Leivant (ed.)
- Bibliography note
- Includes bibliographical references
- Carrier category
- online resource
- Carrier category code
-
- cr
- Carrier MARC source
- rdacarrier
- Content category
- text
- Content type code
-
- txt
- Content type MARC source
- rdacontent
- Contents
- Strict finitism and feasibility / Felice Cardone -- Logical omniscience / Rohit Parikh -- On feasible numbers / Vladimir Yu. Sazonov -- On parallel hierarchies and R[i over k] / Stephen Bloch -- Program extraction from classical proofs / Ulrich Berger and Helmut Schwichtenberg -- Computational models and function algebras / Peter Clote -- Expressing computational complexity in constructive type theory / Robert L. Constable -- Light linear logic / Jean-Yves Girard -- Intrinsic theories and computational complexity / Daniel Leivant -- On Herbrand's theorem / Samuel R. Buss -- Some consequences of cryptographical conjectures for S1/2 and EF / Jan Krajíček and Pavel Pudlák -- Frege proof system and TNC[superscript] ̊/ Gaisi Takeuti -- Characterizing parallel time by type 2 recursions with polynomial output length / Stephen J. Bellantoni -- Type 2 polynomial hierarchies / Anil Seth -- The hierarchy of terminating recursive programs over N / Stanley S. Wainer -- Feasibly categorical models / Douglas Cenzer and Jeffrey B. Remmel -- Metafinite model theory / Erich Grädel and Yuri Gurevich -- Automatic presentations of structures / Bakhadyr Khoussainov and Anil Nerode -- A restricted second order logic for finite structures / Anuj Dawar -- Comparing the power of monadic NP games / Ronald Fagin -- Linear constraint query languages : expressive power and complexity / Stéphane Grumbach, Jianwen Su, and Christophe Tollu -- A constant-space sequential model of computation for first-order logic / Steven Lindell -- Logics capturing relativized complexity classes uniformly / J.A. Makowsky and Y.B. Pnueli -- Preservations theorems in finite model theory / Eric Rosen and Scott Weinstein -- A query language for NC / Dan Suciu and Val Breazu-Tannen
- Control code
- 326709497
- Dimensions
- unknown
- Extent
- 1 online resource (viii, 514 pages)
- Form of item
- online
- Isbn
- 9783540447207
- Media category
- computer
- Media MARC source
- rdamedia
- Media type code
-
- c
- Other control number
- 10.1007/3-540-60178-3
- Other physical details
- illustrations.
- Sound
- unknown sound
- Specific material designation
- remote
- System control number
- (OCoLC)326709497
- Label
- Logic and computational complexity : international workshop, LCC '94, Indianapolis, IN, USA, October 13-16, 1994 : selected papers, Daniel Leivant (ed.)
- Bibliography note
- Includes bibliographical references
- Carrier category
- online resource
- Carrier category code
-
- cr
- Carrier MARC source
- rdacarrier
- Content category
- text
- Content type code
-
- txt
- Content type MARC source
- rdacontent
- Contents
- Strict finitism and feasibility / Felice Cardone -- Logical omniscience / Rohit Parikh -- On feasible numbers / Vladimir Yu. Sazonov -- On parallel hierarchies and R[i over k] / Stephen Bloch -- Program extraction from classical proofs / Ulrich Berger and Helmut Schwichtenberg -- Computational models and function algebras / Peter Clote -- Expressing computational complexity in constructive type theory / Robert L. Constable -- Light linear logic / Jean-Yves Girard -- Intrinsic theories and computational complexity / Daniel Leivant -- On Herbrand's theorem / Samuel R. Buss -- Some consequences of cryptographical conjectures for S1/2 and EF / Jan Krajíček and Pavel Pudlák -- Frege proof system and TNC[superscript] ̊/ Gaisi Takeuti -- Characterizing parallel time by type 2 recursions with polynomial output length / Stephen J. Bellantoni -- Type 2 polynomial hierarchies / Anil Seth -- The hierarchy of terminating recursive programs over N / Stanley S. Wainer -- Feasibly categorical models / Douglas Cenzer and Jeffrey B. Remmel -- Metafinite model theory / Erich Grädel and Yuri Gurevich -- Automatic presentations of structures / Bakhadyr Khoussainov and Anil Nerode -- A restricted second order logic for finite structures / Anuj Dawar -- Comparing the power of monadic NP games / Ronald Fagin -- Linear constraint query languages : expressive power and complexity / Stéphane Grumbach, Jianwen Su, and Christophe Tollu -- A constant-space sequential model of computation for first-order logic / Steven Lindell -- Logics capturing relativized complexity classes uniformly / J.A. Makowsky and Y.B. Pnueli -- Preservations theorems in finite model theory / Eric Rosen and Scott Weinstein -- A query language for NC / Dan Suciu and Val Breazu-Tannen
- Control code
- 326709497
- Dimensions
- unknown
- Extent
- 1 online resource (viii, 514 pages)
- Form of item
- online
- Isbn
- 9783540447207
- Media category
- computer
- Media MARC source
- rdamedia
- Media type code
-
- c
- Other control number
- 10.1007/3-540-60178-3
- Other physical details
- illustrations.
- Sound
- unknown sound
- Specific material designation
- remote
- System control number
- (OCoLC)326709497
Subject
- Berechnungskomplexität
- Berechnungstheorie
- Beweistheorie
- Complexiteit
- Complexité de calcul (Informatique) -- Congrès
- Complexité de calcul (informatique)
- Computational complexity
- Computational complexity
- Computational complexity -- Congresses
- Conference papers and proceedings
- Conference papers and proceedings
- Datenverarbeitung
- Indianapolis (Ind., 1994)
- Indianapolis <Ind., 1994>
- Komplexität
- Komplexitätstheorie
- Logic, Symbolic and mathematical
- Logic, Symbolic and mathematical
- Logic, Symbolic and mathematical -- Congresses
- Logica
- Logik
- Logique symbolique et mathématique
- Logique symbolique et mathématique -- Congrès
- Mathematische Logik
Genre
Member of
Library Links
Embed
Settings
Select options that apply then copy and paste the RDF/HTML data fragment to include in your application
Embed this data in a secure (HTTPS) page:
Layout options:
Include data citation:
<div class="citation" vocab="http://schema.org/"><i class="fa fa-external-link-square fa-fw"></i> Data from <span resource="http://link.library.missouri.edu/portal/Logic-and-computational-complexity-/Spmabhqj3TY/" typeof="Book http://bibfra.me/vocab/lite/Item"><span property="name http://bibfra.me/vocab/lite/label"><a href="http://link.library.missouri.edu/portal/Logic-and-computational-complexity-/Spmabhqj3TY/">Logic and computational complexity : international workshop, LCC '94, Indianapolis, IN, USA, October 13-16, 1994 : selected papers, Daniel Leivant (ed.)</a></span> - <span property="potentialAction" typeOf="OrganizeAction"><span property="agent" typeof="LibrarySystem http://library.link/vocab/LibrarySystem" resource="http://link.library.missouri.edu/"><span property="name http://bibfra.me/vocab/lite/label"><a property="url" href="http://link.library.missouri.edu/">University of Missouri Libraries</a></span></span></span></span></div>
Note: Adjust the width and height settings defined in the RDF/HTML code fragment to best match your requirements
Preview
Cite Data - Experimental
Data Citation of the Item Logic and computational complexity : international workshop, LCC '94, Indianapolis, IN, USA, October 13-16, 1994 : selected papers, Daniel Leivant (ed.)
Copy and paste the following RDF/HTML data fragment to cite this resource
<div class="citation" vocab="http://schema.org/"><i class="fa fa-external-link-square fa-fw"></i> Data from <span resource="http://link.library.missouri.edu/portal/Logic-and-computational-complexity-/Spmabhqj3TY/" typeof="Book http://bibfra.me/vocab/lite/Item"><span property="name http://bibfra.me/vocab/lite/label"><a href="http://link.library.missouri.edu/portal/Logic-and-computational-complexity-/Spmabhqj3TY/">Logic and computational complexity : international workshop, LCC '94, Indianapolis, IN, USA, October 13-16, 1994 : selected papers, Daniel Leivant (ed.)</a></span> - <span property="potentialAction" typeOf="OrganizeAction"><span property="agent" typeof="LibrarySystem http://library.link/vocab/LibrarySystem" resource="http://link.library.missouri.edu/"><span property="name http://bibfra.me/vocab/lite/label"><a property="url" href="http://link.library.missouri.edu/">University of Missouri Libraries</a></span></span></span></span></div>
