A Propositional Plausible Logic
MetadataShow full item record
A new non-monotonic propositional logic called PPL — for Propositional Plausible Logic — is defined. An example is worked and four theorems about PPL are stated.
Lecture Notes in Computer Science
© 2015 Springer Berlin / Heidelberg. This is the author-manuscript version of this paper. Reproduced in accordance with the copyright policy of the publisher. The original publication is available at www.springerlink.com
Information and Computing Sciences not elsewhere classified