A combinatorial problem in logic

This short note is an application of some theorems of graph theory to the problem of the minimum number of counter-examples needed to show that a special class of theories is complete.

Saved in:
Bibliographic Details
Published inDiscrete mathematics Vol. 17; no. 1; pp. 23 - 26
Main Authors Berge, C., Rao, A.Ramachandra
Format Journal Article
LanguageEnglish
Published Elsevier B.V 1977
Online AccessGet full text

Cover

More Information
Summary:This short note is an application of some theorems of graph theory to the problem of the minimum number of counter-examples needed to show that a special class of theories is complete.
ISSN:0012-365X
1872-681X
DOI:10.1016/0012-365X(77)90018-8