Computation and Proof Theory - Lecture Notes in Mathematics
Latest Publications

TOTAL DOCUMENTS

(FIVE YEARS 0)

H-INDEX

(FIVE YEARS 0)

Published By Springer Berlin Heidelberg

9783540139010, 9783540391197

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Contiguous R.E. Degrees

Computation and Proof Theory - Lecture Notes in Mathematics ◽

10.1007/bfb0099477 ◽

1984 ◽

pp. 1-37 ◽

Cited By ~ 6

Author(s):

Klaus Ambos-Spies

Download Full-text

A unified approach to constructive and recursive analysis

Computation and Proof Theory - Lecture Notes in Mathematics ◽

10.1007/bfb0099489 ◽

1984 ◽

pp. 259-278 ◽

Cited By ~ 10

Author(s):

Christoph Kreitz ◽

Klaus Weihrauch

Keyword(s):

Unified Approach ◽

Recursive Analysis

Download Full-text

Some logical problems connected with a modular decomposition theory of automata

Computation and Proof Theory - Lecture Notes in Mathematics ◽

10.1007/bfb0099492 ◽

1984 ◽

pp. 365-388 ◽

Cited By ~ 2

Author(s):

Dieter Rödding

Keyword(s):

Modular Decomposition ◽

Decomposition Theory

Download Full-text

Effective operators in a topological setting

Computation and Proof Theory - Lecture Notes in Mathematics ◽

10.1007/bfb0099496 ◽

1984 ◽

pp. 437-451 ◽

Cited By ~ 5

Author(s):

Dieter Spreen ◽

Paul Young

Keyword(s):

Effective Operators

Download Full-text

Undecidability and recursive equivalence II

Computation and Proof Theory - Lecture Notes in Mathematics ◽

10.1007/bfb0099480 ◽

1984 ◽

pp. 79-100 ◽

Cited By ~ 1

Author(s):

J. N. Crossley ◽

J. B. Remmel

Download Full-text

Between constructive and classical mathematics

Computation and Proof Theory - Lecture Notes in Mathematics ◽

10.1007/bfb0099484 ◽

1984 ◽

pp. 143-162 ◽

Cited By ~ 4

Author(s):

Solomon Feferman

Keyword(s):

Classical Mathematics

Download Full-text

A star-finite relational semantics for parallel programs

Computation and Proof Theory - Lecture Notes in Mathematics ◽

10.1007/bfb0099483 ◽

1984 ◽

pp. 129-142

Author(s):

E. J. Farkas ◽

M. E. Szabo

Keyword(s):

Parallel Programs ◽

Relational Semantics

Download Full-text

Abstract recursion as a foundation for the theory of algorithms

Computation and Proof Theory - Lecture Notes in Mathematics ◽

10.1007/bfb0099491 ◽

1984 ◽

pp. 289-364 ◽

Cited By ~ 21

Author(s):

Yiannis N. Moschovakis

Download Full-text

An axiomatization of the apartness fragment of the theory DLO+ of dense linear order

Computation and Proof Theory - Lecture Notes in Mathematics ◽

10.1007/bfb0099497 ◽

1984 ◽

pp. 453-475

Author(s):

T. Uesu

Keyword(s):

Linear Order

Download Full-text

Minimal degrees and 1-generic sets below 0′

Computation and Proof Theory - Lecture Notes in Mathematics ◽

10.1007/bfb0099479 ◽

1984 ◽

pp. 63-77 ◽

Cited By ~ 6

Author(s):

C. T. Chong ◽

C. G. Jockusch

Download Full-text

Computation and Proof Theory - Lecture Notes in MathematicsLatest Publications

TOTAL DOCUMENTS

H-INDEX

Published By Springer Berlin Heidelberg

Contiguous R.E. Degrees

A unified approach to constructive and recursive analysis

Some logical problems connected with a modular decomposition theory of automata

Effective operators in a topological setting

Undecidability and recursive equivalence II

Between constructive and classical mathematics

A star-finite relational semantics for parallel programs

Abstract recursion as a foundation for the theory of algorithms

An axiomatization of the apartness fragment of the theory DLO+ of dense linear order

Minimal degrees and 1-generic sets below 0′

Computation and Proof Theory - Lecture Notes in Mathematics
Latest Publications