Nondeterministic three-valued logic: Isotonic and guarded truth-functions
Studia Logica 42 (1):1 - 22 (1983)
| Abstract | Nondeterministic programs occurring in recently developed programming languages define nondeterminate partial functions. Formulas (Boolean expressions) of such nondeterministic languages are interpreted by a nonempty subset of {T (true), F (false), U (undefined)}. As a semantic basis for the propositional part of a corresponding nondeterministic three-valued logic we study the notion of a truth-function over {T, F, U} which is computable by a nondeterministic evaluation procedure. The main result is that these truth-functions are precisely the functions satisfying four basic properties, called -isotonic, –-isotonic, hereditarily guarded, and hereditarily guard-using, and that a function satisfies these properties iff it is explicitly definable (in a certain normal form) from if..then..else..fi, binary choice, and constants. | |||||||||
| Keywords | No keywords specified (fix it) | |||||||||
| Categories | ||||||||||
| Options |
|
|||||||||
Download options| PhilPapers Archive |
Upload a copy of this paper Check publisher's policy on self-archival Papers currently archived: 5,709 |
| External links |
 |
| Through your library | Configure |
Similar books and articlesBernhard Heinemann (2010). Using Hybrid Logic for Coping with Functions in Subset Spaces. Studia Logica 94 (1).
Rodney G. Downey & Asher M. Kach (2010). Euclidean Functions of Computable Euclidean Domains. Notre Dame Journal of Formal Logic 52 (2):163-172.
José Iovino (1997). Definability in Functional Analysis. Journal of Symbolic Logic 62 (2):493-505.
Erich Grädel & Yuri Gurevich (1995). Tailoring Recursion for Complexity. Journal of Symbolic Logic 60 (3):952-969.
Analytics
Monthly downloads |
Added to index2009-01-28Total downloads3 ( #202,107 of 549,753 )Recent downloads (6 months)1 ( #63,425 of 549,753 )How can I increase my downloads? |
My notes
Discussion
