Lecture Notes in Computer Science - Logic and Computational Complexity
Latest Publications

TOTAL DOCUMENTS

(FIVE YEARS 0)

H-INDEX

(FIVE YEARS 0)

Published By Springer Berlin Heidelberg

9783540601784, 9783540447207

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Intrinsic theories and computational complexity

Lecture Notes in Computer Science - Logic and Computational Complexity ◽

10.1007/3-540-60178-3_84 ◽

1995 ◽

pp. 177-194 ◽

Cited By ~ 20

Author(s):

Daniel Leivant

Keyword(s):

Computational Complexity

Download Full-text

Some consequences of cryptographical conjectures for S 2 1 and EF

Lecture Notes in Computer Science - Logic and Computational Complexity ◽

10.1007/3-540-60178-3_86 ◽

1995 ◽

pp. 210-220 ◽

Cited By ~ 15

Author(s):

Jan Krajíček ◽

Pavel Pudlák

Download Full-text

Strict finitism and feasibility

Lecture Notes in Computer Science - Logic and Computational Complexity ◽

10.1007/3-540-60178-3_76 ◽

1995 ◽

pp. 1-21

Author(s):

Felice Cardone

Keyword(s):

Strict Finitism

Download Full-text

Preservation theorems in finite model theory

Lecture Notes in Computer Science - Logic and Computational Complexity ◽

10.1007/3-540-60178-3_99 ◽

1995 ◽

pp. 480-502 ◽

Cited By ~ 9

Author(s):

Eric Rosen ◽

Scott Weinstein

Keyword(s):

Model Theory ◽

Finite Model ◽

Finite Model Theory ◽

Preservation Theorems

Download Full-text

Logical omniscience

Lecture Notes in Computer Science - Logic and Computational Complexity ◽

10.1007/3-540-60178-3_77 ◽

1995 ◽

pp. 22-29 ◽

Cited By ~ 9

Author(s):

Rohit Parikh

Keyword(s):

Logical Omniscience

Download Full-text

Expressing computational complexity in constructive type theory

Lecture Notes in Computer Science - Logic and Computational Complexity ◽

10.1007/3-540-60178-3_82 ◽

1995 ◽

pp. 131-144 ◽

Cited By ~ 1

Author(s):

Robert L. Constable

Keyword(s):

Computational Complexity ◽

Type Theory ◽

Constructive Type Theory ◽

Constructive Type

Download Full-text

Frege proof system and TNC°

Lecture Notes in Computer Science - Logic and Computational Complexity ◽

10.1007/3-540-60178-3_87 ◽

1995 ◽

pp. 221-252

Author(s):

Gaisi Takeuti

Keyword(s):

Proof System

Download Full-text

A constant-space sequential model of computation for first-order logic

Lecture Notes in Computer Science - Logic and Computational Complexity ◽

10.1007/3-540-60178-3_97 ◽

1995 ◽

pp. 447-462 ◽

Cited By ~ 1

Author(s):

Steven Lindell

Keyword(s):

Order Logic ◽

First Order Logic ◽

Sequential Model ◽

Model Of Computation ◽

First Order

Download Full-text

Type 2 polynomial hierarchies

Lecture Notes in Computer Science - Logic and Computational Complexity ◽

10.1007/3-540-60178-3_89 ◽

1995 ◽

pp. 269-280

Author(s):

Anil Seth

Download Full-text

Characterizing parallel time by type 2 recursions with polynomial output length

Lecture Notes in Computer Science - Logic and Computational Complexity ◽

10.1007/3-540-60178-3_88 ◽

1995 ◽

pp. 253-268 ◽

Cited By ~ 4

Author(s):

Stephen J. Bellantoni

Keyword(s):

Parallel Time

Download Full-text

Lecture Notes in Computer Science - Logic and Computational ComplexityLatest Publications

TOTAL DOCUMENTS

H-INDEX

Published By Springer Berlin Heidelberg

Intrinsic theories and computational complexity

Some consequences of cryptographical conjectures for S 2 1 and EF

Strict finitism and feasibility

Preservation theorems in finite model theory

Logical omniscience

Expressing computational complexity in constructive type theory

Frege proof system and TNC°

A constant-space sequential model of computation for first-order logic

Type 2 polynomial hierarchies

Characterizing parallel time by type 2 recursions with polynomial output length

Lecture Notes in Computer Science - Logic and Computational Complexity
Latest Publications