Paper Info
Title
A First-Order Logic for Partial Recursive Functions
Abstract
This paper is an extension of the first-order logic for partial functions [GL 89a] [GL 89b] to a logic of programs in the framework of a first order -calculus. We define a typed functional language coupled to a logic with a definedness operator and a three-boolean valued semantics with an associated consequence relation. We study the proof theory of our logic through a tableaux method and show how to obtain complete sequent calculi for reasoning about partial recursive functions.
Year
DOI
Venue
1990
10.1007/BFb0029619
MFCS
Keywords
Field
DocType
partial recursive function,first-order logic,partial recursive functions,first order logic,proof theory,first order,functional language
Discrete mathematics,Second-order logic,Computer science,Multimodal logic,Substructural logic,Bunched logic,Predicate logic,Higher-order logic,Dynamic logic (modal logic),Intermediate logic
Conference
ISBN
Citations 
PageRank 
3-540-52953-5
0
0.34
References 
Authors
11
1
Name
Order
Citations
PageRank
Antonio Gavilanes-Franco171.69