• DocumentCode
    2541226
  • Title

    Articular models for first-degree paraconsistent systems

  • Author

    Jennings, R.E. ; Chen, Y.

  • Author_Institution
    Lab. for Logic & Exp. Philos., Simon Fraser Univ., Burnaby, BC, Canada
  • fYear
    2010
  • fDate
    7-9 July 2010
  • Firstpage
    904
  • Lastpage
    907
  • Abstract
    We present a class of models (h-models) in which the sentences of a propositional language are represented as simple hypergraphs on the power set of a universe, and in which entailments are modeled by relations between hypergraphs. An h-model theoretic semantic analysis of the system FDE of first-degree entailment is proposed and a non-constructive completeness proof given in the familiar idiom of Henkin models. Finally we introduce a hitherto unstudied system of analytic entailment and provide its natural h-model representation.
  • Keywords
    formal languages; graph theory; programming language semantics; theorem proving; Henkin models; articular models; degree paraconsistent systems; first-degree entailment; h-model theoretic semantic analysis; hypergraphs; natural h-model representation; nonconstructive completeness proof; paraconsistent inference systems; propositional language; Algebra; Bismuth; Laboratories; Lattices; Legged locomotion; Presses; Semantics;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Cognitive Informatics (ICCI), 2010 9th IEEE International Conference on
  • Conference_Location
    Beijing
  • Print_ISBN
    978-1-4244-8041-8
  • Type

    conf

  • DOI
    10.1109/COGINF.2010.5599781
  • Filename
    5599781