An abstract strong normalization theorem

Authors:
Ulrich Berger
Affiliations:
University of Wales Swansea
Venue:
CSL'05 Proceedings of the 19th international conference on Computer Science Logic
Year:
2005

Citing 6
Cited 0

Proving open properties by induction

Information Processing Letters
Domain theory

Handbook of logic in computer science (vol. 3)
Modified Realizability Toposes and Strong Normalization Proofs

TLCA '93 Proceedings of the International Conference on Typed Lambda Calculi and Applications
A Generic Strong Normalization Argument: Application to the Calculus of Constructions

CSL '93 Selected Papers from the 7th Workshop on Computer Science Logic
A Computational Interpretation of Open Induction

LICS '04 Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science
Continuous semantics for strong normalization

CiE'05 Proceedings of the First international conference on Computability in Europe: new Computational Paradigms

Quantified Score

Hi-index	0.00

Visualization

Abstract

We prove a strong normalization theorem for abstract term rewriting systems based on domain-theoretic models. The theorem applies to extensions of Gödel's system T by various forms of recursion related to bar recursion for which strong normalization was hitherto unknown.