Yet another proof of Goedel's completeness theorem for first-order classical logic

arXiv0910.2059MaRDI QIDQ6215837

Marco Bright Caminati

Publication date: 11 October 2009

Mathematics Subject Classification ID

65D07: Numerical computation using splines

03C07: Basic properties of first-order languages and structures