Towards finishing off the axiom of reducibility
Philippe de Rouilhan (1996)
Philosophia Scientiae
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Displaying similar documents to “A formalism for treating equivalence of recursive procedures”
Towards finishing off the axiom of reducibility
An algorithm for finding a minimal recursive path ordering
Hassan Aït-Kaci (1985)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
On temporal program verification rules
F. Kröger (1985)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
An axiomatic approach to distance on partial orderings
Wade D. Cook, Moshe Kress, Lawrence M. Seiford (1986)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
Retrieving library functions by unifying types modulo linear isomorphism
M. Rittri (1993)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
There is no complete axiom system for shuffle expressions
A. Szepietowski (2010)
RAIRO - Theoretical Informatics and Applications
Similarity:
In this paper we show that neither the set of all valid equations between shuffle expressions nor the set of schemas of valid equations is recursively enumerable. Thus, neither of the sets can be recursively generated by any axiom system.
A reduction of the axioms for the theory of prepositional types
P. Andrews (1963)
Fundamenta Mathematicae
Similarity:
A theory of prepositional types
Leon Henkin (1963)
Fundamenta Mathematicae
Similarity: