A Theory of Explicit Mathematics Equivalent to ID1

Authors:
Reinhard Kahle;Thomas Studer
Affiliations:
-;-
Venue:
Proceedings of the 14th Annual Conference of the EACSL on Computer Science Logic
Year:
2000

Citing 5
Cited 0

Logics for termination and correctness of functional programs, II. logic of strength PRA

Proof theory
A Theory of Objects

A Theory of Objects
Call-by-Value, Call-by-Name and the Logic of Values

CSL '96 Selected Papers from the10th International Workshop on Computer Science Logic
Induction in the Elementary Theory of Types and Names

CSL '87 Proceedings of the 1st Workshop on Computer Science Logic
Why the constant ‘undefined’? Logics of partial terms for strict and non-strict functional programming languages

Journal of Functional Programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

We show that the addition of name induction to the theory EETJ + (LEM-IN) of explicit elementary types with join yields a theory proof-theoretically equivalent to ID1.