Erkenntnis 43 (3):295 - 320 (1995)
|Abstract||Questions of definedness are ubiquitous in mathematics. Informally, these involve reasoning about expressions which may or may not have a value. This paper surveys work on logics in which such reasoning can be carried out directly, especially in computational contexts. It begins with a general logic of partial terms, continues with partial combinatory and lambda calculi, and concludes with an expressively rich theory of partial functions and polymorphic types, where termination of functional programs can be established in a natural way.|
|Keywords||No keywords specified (fix it)|
|Categories||No categories specified (fix it)|
|Through your library||Configure|
Similar books and articles
A. Avron & B. Konikowska (2008). Rough Sets and 3-Valued Logics. Studia Logica 90 (1):69 - 92.
Reinhard Muskens (1999). On Partial and Paraconsistent Logics. Notre Dame Journal of Formal Logic 40 (3):352-374.
Ingemarie Bethke (1987). On the Existence of Extensional Partial Combinatory Algebras. Journal of Symbolic Logic 52 (3):819-833.
Jaap van Oosten (2011). Partial Combinatory Algebras of Functions. Notre Dame Journal of Formal Logic 52 (4):431-448.
William M. Farmer (1990). A Partial Functions Version of Church's Simple Theory of Types. Journal of Symbolic Logic 55 (3):1269-1291.
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-01-28
Total downloads7 ( #133,343 of 548,984 )
Recent downloads (6 months)1 ( #63,327 of 548,984 )
How can I increase my downloads?