Abstract
The derivation process in SMS depends upon a host of functions that define crucial correspondences within the system. The approach used is to postulate a set of SL formalisms to be accessed in building the DB component. The mechan ics of proof depend in large measure upon the correspondences described in this section. The following notation will be used schematically to describe those correspondences:
-
1)
the symbols’ sS, SS1, ..., SSn’ will continue to stand for sentence-sequences;
-
2)
the symbols’ sf, sf1, ..., sfn’ will continue to stand for sentence-sequence formalisms;
-
3)
the letter’ s’ will stand for the set of all well formed sentential sequences;
-
4)
the letter ‘F’ will stand for the set of all well formed sentential formalisms.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1991 Kluwer Academic Publishers
About this chapter
Cite this chapter
deBessonet, C.G. (1991). Correspondence and Inferencing. In: A Many-Valued Approach to Deduction and Reasoning for Artificial Intelligence. The Kluwer International Series in Engineering and Computer Science, vol 129. Springer, Boston, MA. https://doi.org/10.1007/978-0-585-27475-1_11
Download citation
DOI: https://doi.org/10.1007/978-0-585-27475-1_11
Publisher Name: Springer, Boston, MA
Print ISBN: 978-0-7923-9138-8
Online ISBN: 978-0-585-27475-1
eBook Packages: Springer Book Archive