Logic for approximate entailment in ordered universes of discourse
classification
🧮 math.LO
keywords
logicpossibleapplicationsapproximateconclusionsentailmentorderunderlying
read the original abstract
The Logic of Approximate Entailment (LAE) is a graded counterpart of classical propositional calculus, where conclusions that are only approximately correct can be drawn. This is achieved by equipping the underlying set of possible worlds with a similarity relation. When using this logic in applications, however, a disadvantage must be accepted; namely, in LAE it is not possible to combine conclusions in a conjunctive way. In order to overcome this drawback, we propose in this paper a modification of LAE where, at the semantic level, the underlying set of worlds is moreover endowed with an order structure. The chosen framework is designed in view of possible applications.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.