Ihre E-Mail wurde erfolgreich gesendet. Bitte prüfen Sie Ihren Maileingang.

Leider ist ein Fehler beim E-Mail-Versand aufgetreten. Bitte versuchen Sie es erneut.

Vorgang fortführen?

Exportieren
  • 1
    UID:
    b3kat_BV035282797
    Umfang: 1 Online-Ressource (VIII, 514 S.)
    ISBN: 3540601783
    Serie: Lecture notes in computer science 960
    Sprache: Englisch
    Fachgebiete: Informatik
    RVK:
    RVK:
    Schlagwort(e): Berechnungskomplexität ; Mathematische Logik ; Logik ; Komplexität ; Datenverarbeitung ; Komplexitätstheorie ; Beweistheorie ; Logik ; Komplexitätstheorie ; Berechnungstheorie ; Konferenzschrift ; Konferenzschrift
    URL: Volltext  (lizenzpflichtig)
    URL: Volltext  (lizenzpflichtig)
    URL: Volltext  (lizenzpflichtig)
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 2
    UID:
    almahu_BV010322279
    Umfang: VIII, 514 S.
    ISBN: 3-540-60178-3
    Serie: Lecture notes in computer science 960
    Sprache: Englisch
    Fachgebiete: Informatik
    RVK:
    RVK:
    RVK:
    Schlagwort(e): Berechnungskomplexität ; Mathematische Logik ; Logik ; Komplexität ; Datenverarbeitung ; Komplexitätstheorie ; Beweistheorie ; Logik ; Komplexitätstheorie ; Berechnungstheorie ; Konferenzschrift ; Konferenzschrift ; Konferenzschrift
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 3
    UID:
    b3kat_BV010322279
    Umfang: VIII, 514 S.
    ISBN: 3540601783
    Serie: Lecture notes in computer science 960
    Sprache: Englisch
    Fachgebiete: Informatik
    RVK:
    RVK:
    RVK:
    Schlagwort(e): Berechnungskomplexität ; Mathematische Logik ; Logik ; Komplexität ; Datenverarbeitung ; Komplexitätstheorie ; Beweistheorie ; Logik ; Komplexitätstheorie ; Berechnungstheorie ; Konferenzschrift
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 4
    Online-Ressource
    Online-Ressource
    Berlin, Heidelberg : Springer Berlin Heidelberg
    UID:
    gbv_1649317735
    Umfang: Online-Ressource
    ISBN: 9783540447207
    Serie: Lecture Notes in Computer Science 960
    Weitere Ausg.: ISBN 9783540601784
    Weitere Ausg.: Buchausg. u.d.T. Logic and computational complexity Berlin : Springer, 1995 ISBN 3540601783
    Sprache: Englisch
    Fachgebiete: Informatik
    RVK:
    RVK:
    Schlagwort(e): Komplexitätstheorie ; Beweistheorie ; Logik ; Komplexitätstheorie ; Berechnungstheorie ; Konferenzschrift
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 5
    UID:
    kobvindex_ZLB12371998
    Umfang: VIII, 514 Seiten , graph. Darst. , 24 cm
    Ausgabe: 1
    ISBN: 3540601783
    Serie: Lecture notes in computer science Vol. 960
    Anmerkung: Literaturangaben
    Sprache: Deutsch
    Schlagwort(e): Komplexitätstheorie ; Beweistheorie ; Logik ; Kongress ; Indianapolis 〈Ind., 1994〉 ; Komplexitätstheorie ; Berechnungstheorie ; Kongress ; Indianapolis 〈Ind., 1994〉 ; Kongress ; Konferenzschrift
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 6
    UID:
    edoccha_9959186470202883
    Umfang: 1 online resource (VIII, 520 p.)
    Ausgabe: 1st ed. 1995.
    Ausgabe: Online edition Springer Lecture Notes Archive ; 041142-5
    ISBN: 3-540-44720-2
    Serie: Lecture Notes in Computer Science, 960
    Inhalt: 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.
    Anmerkung: Bibliographic Level Mode of Issuance: Monograph , 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). , English
    In: Springer eBooks
    Weitere Ausg.: ISBN 3-540-60178-3
    Sprache: Englisch
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 7
    UID:
    edocfu_9959186470202883
    Umfang: 1 online resource (VIII, 520 p.)
    Ausgabe: 1st ed. 1995.
    Ausgabe: Online edition Springer Lecture Notes Archive ; 041142-5
    ISBN: 3-540-44720-2
    Serie: Lecture Notes in Computer Science, 960
    Inhalt: 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.
    Anmerkung: Bibliographic Level Mode of Issuance: Monograph , 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). , English
    In: Springer eBooks
    Weitere Ausg.: ISBN 3-540-60178-3
    Sprache: Englisch
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 8
    UID:
    almahu_9947920620902882
    Umfang: VIII, 520 p. , online resource.
    ISBN: 9783540447207
    Serie: Lecture Notes in Computer Science, 960
    Inhalt: 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.
    Anmerkung: 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).
    In: Springer eBooks
    Weitere Ausg.: Printed edition: ISBN 9783540601784
    Sprache: Englisch
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 9
    UID:
    almahu_9948621372202882
    Umfang: VIII, 520 p. , online resource.
    Ausgabe: 1st ed. 1995.
    ISBN: 9783540447207
    Serie: Lecture Notes in Computer Science, 960
    Inhalt: 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.
    Anmerkung: 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).
    In: Springer Nature eBook
    Weitere Ausg.: Printed edition: ISBN 9783662195796
    Weitere Ausg.: Printed edition: ISBN 9783540601784
    Sprache: Englisch
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 10
    UID:
    almafu_9959186470202883
    Umfang: 1 online resource (VIII, 520 p.)
    Ausgabe: 1st ed. 1995.
    Ausgabe: Online edition Springer Lecture Notes Archive ; 041142-5
    ISBN: 3-540-44720-2
    Serie: Lecture Notes in Computer Science, 960
    Inhalt: 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.
    Anmerkung: Bibliographic Level Mode of Issuance: Monograph , 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). , English
    In: Springer eBooks
    Weitere Ausg.: ISBN 3-540-60178-3
    Sprache: Englisch
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
Meinten Sie 3540201483?
Meinten Sie 3540051783?
Meinten Sie 3540001743?
Schließen ⊗
Diese Webseite nutzt Cookies und das Analyse-Tool Matomo. Weitere Informationen finden Sie auf den KOBV Seiten zum Datenschutz