A Graph Calculus for Predicate Logic
Copyright policy )A Graph Calculus for Predicate Logic
We introduce a refutation graph calculus for classical first-order predicate logic, which is an extension of previous ones for binary relations. One reduces logical consequence to establishing that a constructed graph has empty extension, i. e. it represents bottom. Our calculus establishes that a graph has empty extension by converting it to a normal form, which is expanded to other graphs until we can recognize conflicting situations (equivalent to a formula and its negation).
In Proceedings LSFA 2012, arXiv:1303.7136
FOS: Computer and information sciences, Computer Science - Logic in Computer Science, Electronic computers. Computer science, QA1-939, QA75.5-76.95, Mathematics, Logic in Computer Science (cs.LO)
FOS: Computer and information sciences, Computer Science - Logic in Computer Science, Electronic computers. Computer science, QA1-939, QA75.5-76.95, Mathematics, Logic in Computer Science (cs.LO)
citations This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).0 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Average influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Average impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Average
Citations provided by BIP!Popularity provided by BIP!