|Abstract||Even though it is not very often admitted, partial functions do play a significant role in many practical applications of deduction systems. Kleene has already given a semantic account of partial functions using a three-valued logic decades ago, but there has not been a satisfactory mechanization. Recent years have seen a thorough investigation of the framework of many-valued truth-functional logics. However, strong Kleene logic, where quantification is restricted and therefore not truthfunctional, does not fit the framework directly. We solve this problem by applying recent methods from sorted logics. This paper presents a tableau calculus that combines the proper treatment of partial functions with the efficiency of sorted calculi.|
|Keywords||No keywords specified (fix it)|
|Categories||categorize this paper)|
|Through your library||Only published papers are available at libraries|
Similar books and articles
Silvio Ghilardi & Giancarlo Meloni (1996). Relational and Partial Variable Sets and Basic Predicate Logic. Journal of Symbolic Logic 61 (3):843-872.
Robert Boyer, The Addition of Bounded Quantification and Partial Functions to a Computational Logic and its Theorem Prover.
François Lepage (2000). Partial Monotonic Protothetics. Studia Logica 66 (1):147-163.
Solomon Feferman (1995). Definedness. Erkenntnis 43 (3):295 - 320.
William M. Farmer (1990). A Partial Functions Version of Church's Simple Theory of Types. Journal of Symbolic Logic 55 (3):1269-1291.
P. J. Martín & A. Gavilanes (2002). Simultaneous Rigid Sorted Unification for Tableaux. Studia Logica 72 (1):31-59.
William M. Farmer & Joshua D. Guttman (2000). A Set Theory with Support for Partial Functions. Studia Logica 66 (1):59-78.
William M. Farmer (1995). Reasoning About Partial Functions with the Aid of a Computer. Erkenntnis 43 (3):279 - 294.
Added to index2009-04-20
Total downloads5 ( #169,941 of 722,778 )
Recent downloads (6 months)0
How can I increase my downloads?