Recap: Expressivity and Efficiency

  • Daniele Mundici
Part of the UNITEXT book series (UNITEXT)


Recall the example on page 3, in which we transcribed in clauses the problem of checking whether a graph G with n vertices is k-colourable. We used n × k variables with the intention that each variable X ij abbreviates the phrase “vertex i has colour j”. Each variable X ij also represents the question “does vertex i have colour j?”, and intends to contain the yes-no answer to this question.


Finite Number Mathematical Logic Formal Language Combinatorial Problem Initial Problem 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Copyright information

© Springer-Verlag Italia 2012

Authors and Affiliations

  • Daniele Mundici
    • 1
  1. 1.Department of Mathematics and Computer Science “U. Dini”University of FlorenceItaly

Personalised recommendations