Article contents
RESOLVING INFINITARY PARADOXES
Published online by Cambridge University Press: 19 June 2017
Abstract
Graph normal form, GNF, [1], was used in [2, 3] for analyzing paradoxes in propositional discourses, with the semantics—equivalent to the classical one—defined by kernels of digraphs. The paper presents infinitary, resolution-based reasoning with GNF theories, which is refutationally complete for the classical semantics. Used for direct (not refutational) deduction it is not explosive and allows to identify in an inconsistent discourse, a maximal consistent subdiscourse with its classical consequences. Semikernels, generalizing kernels, provide the semantic interpretation.
- Type
- Articles
- Information
- Copyright
- Copyright © The Association for Symbolic Logic 2017
References
REFERENCES
- 8
- Cited by