Back to Search Start Over

A combinatorial problem in logic

Authors :
Claude Berge
A. Ramachandra Rao
Source :
Discrete Mathematics. 17:23-26
Publication Year :
1977
Publisher :
Elsevier BV, 1977.

Abstract

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.

Subjects

Subjects :
Discrete mathematics
Combinatorics
Minimum k-cut
Optimization problem
Quadratic assignment problem
Barycentric-sum problem
Discrete Mathematics and Combinatorics
Combinatorial optimization
Graph theory
Combinatorial class
Series-parallel networks problem
Theoretical Computer Science
Mathematics

Details

ISSN :
0012365X
Volume :
17
Database :
OpenAIRE
Journal :
Discrete Mathematics
Accession number :
edsair.doi.dedup.....0384bf7e21702efc6e311a359dfdaa64
Full Text :
https://doi.org/10.1016/0012-365x(77)90018-8
Full Text Access
View/download PDF

Tools

Authors Abstract Subjects Details