{"title":"Articular models for first-degree paraconsistent systems","authors":"R. Jennings, Yuesen Chen","doi":"10.1109/COGINF.2010.5599781","DOIUrl":null,"url":null,"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.","PeriodicalId":365083,"journal":{"name":"9th IEEE International Conference on Cognitive Informatics (ICCI'10)","volume":"27 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-07-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"9th IEEE International Conference on Cognitive Informatics (ICCI'10)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/COGINF.2010.5599781","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 6
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.