ScienceOpen:
research and publishing network
For Publishers
Discovery
Metadata
Peer review
Hosting
Publishing
For Researchers
Join
Publish
Review
Collect
My ScienceOpen
Sign in
Register
Dashboard
Blog
About
Search
Advanced search
My ScienceOpen
Sign in
Register
Dashboard
Search
Search
Advanced search
For Publishers
Discovery
Metadata
Peer review
Hosting
Publishing
For Researchers
Join
Publish
Review
Collect
Blog
About
10
views
4
references
Top references
cited by
5
Cite as...
0 reviews
Review
0
comments
Comment
0
recommends
+1
Recommend
0
collections
Add to
0
shares
Share
Twitter
Sina Weibo
Facebook
Email
4,929
similar
All similar
Record
: found
Abstract
: not found
Book Chapter
: not found
The L. E. J. Brouwer Centenary Symposium, Proceedings of the Conference held in Noordwijkerhout
Complexity of Normalization in the Pure Typed Lambda – Calculus
edited_book
Author(s):
Helmat Schwichtenberg
Publication date
(Print):
1982
Publisher:
Elsevier
Read this book at
Publisher
Further versions
oa repository (via OAI-PMH title and first author match)
Powered by
Buy book
Review
Review book
Invite someone to review
Bookmark
Cite as...
There is no author summary for this book yet. Authors can add summaries to their books on ScienceOpen to make them more accessible to a non-specialist audience.
Related collections
KOME: An International Journal of Pure Communication Inquiry
Most cited references
4
Record
: found
Abstract
: not found
Book
: not found
Metamathematical Investigation of Intuitionistic Arithmetic and Analysis
A. S. Troelstra
(1973)
0
comments
Cited
30
times
– based on
0
reviews
Bookmark
Record
: found
Abstract
: not found
Article
: not found
The typed λ-calculus is not elementary recursive
Richard Statman
(1979)
0
comments
Cited
18
times
– based on
0
reviews
Review now
Bookmark
Record
: found
Abstract
: not found
Book
: not found
The calculi of lambda conversion
A. Church
(1941)
0
comments
Cited
11
times
– based on
0
reviews
Bookmark
All references
Author and book information
Book Chapter
Publication date (Print):
1982
Pages
: 453-457
DOI:
10.1016/S0049-237X(09)70143-0
SO-VID:
48849b94-c5f8-417c-baea-ed9a349634c5
History
Data availability:
Comments
Comment on this book
Sign in to comment
Book chapters
pp. vii
Preface
pp. vii
Preface
pp. 1
The Type Theoretic Interpretation of Constructive Set Theory: Choice Principles
pp. 5
An Introduction to First-Order Logic
pp. 11
Epistemic and Intuitionistic Arithmetic
pp. 15
Some Connections Between Elementary and Modal Logic
pp. 33
A Basis for a Mathematical Theory of Computation)
pp. 55
The Type Theoretic Interpretation of Constructive Set Theory
pp. 63
Une Extension De ĽInterpretation De Gödel a ĽAnalyse, Et Son Application a ĽElimination Des Coupures Dans ĽAnalyse Et La Theorie Des Types
pp. 68
3. Investigations into Logical Deduction
pp. 73
An Intuitionistic Theory of Types: Predicative Part
pp. 91
Notions of Choice Sequence
pp. 92
Semantical Analysis of Intuitionistic Logic I
pp. 98
Quelques Remarques, Théorèmes Et Problèmes Sur Les Classes Définissables D'algèbres
pp. 105
On Local and Non-Local Properties
pp. 107
Formal Spaces
pp. 110
Completeness and Correspondence in the First and Second Order Semantics for Modal Logic
pp. 118
The Algebraic Theory of Context-Free Languages
pp. 149
A Note on Bar Induction Rule
pp. 153
Constructive Mathematics and Computer Programming
pp. 165
The Effective Topos
pp. 179
Hauptsatz for the Intuitionistic Theory of Iterated Inductive Definitions
pp. 191
Degrees of Functions with no Fixed Points
pp. 217
Constructive Logic Versus Algebraization I
pp. 221
Geometry of Interaction 1: Interpretation of System F
pp. 235
Ideas and Results in Proof Theory
pp. 266
The Foundations of Classical Mechanics in the Light of Recent Advances in Continuum Mechanics
pp. 283
An Approach to Constructive Mathematical Logic
pp. 337
Gödel’s Functional (“Dialectica”) Interpretation
pp. 453
Complexity of Normalization in the Pure Typed Lambda – Calculus
pp. 459
Nonstandard Models and Constructivity
pp. 571
Informational Independence as a Semantical Phenomenon
pp. 631
Degrees of Unsolvability: A Survey of Results
pp. 739
An Introduction to Inductive Definitions
pp. 821
The Incompleteness Theorems
pp. 1133
A Mathematical Incompleteness in Peano Arithmetic
Similar content
4,929
A rho-recognition site on phage lambda cro-gene mRNA.
Authors:
S L Bektesh
,
J P Richardson
Effects of spontaneously generated coherence on the pump-probe response of a\(\Lambda \)system
Authors:
Sunish Menon
,
G. Agarwal
Transcription termination signals in the nin region of bacteriophage lambda: identification of Rho-dependent termination regions.
Authors:
Weixin Cheng
,
D L Court
,
Donald L. Court
See all similar
Cited by
5
Complexity Hierarchies beyond Elementary
Authors:
Sylvain Schmitz
Exact bounds for lengths of reductions in typed λ -calculus
Authors:
Arnold Beckmann
Estimation of the length of interactions in arena game semantics
Authors:
Pierre Clairambault
See all cited by