Decision Problems and Some Solutions

  • Domenico Cantone
  • Eugenio Omodeo
  • Alberto Policriti
Part of the Monographs in Computer Science book series (MCS)

Abstract

Viewed as a collection of sentences, any first-order theory of sets is recursively enumerable: this is an advantage ensuing from the axiomatic method. To restate it, a list of all sentences provable in the theory can be generated through an automatic (infinite) process. Moreover, a reliable certification of theoremhood (that is, a formal derivation from the axioms of the theory) can come along with each sentence in the list.

Keywords

Decision Problem Boolean Algebra Free Variable Conjunctive Normal Form Satisfiability 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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer Science+Business Media New York 2001

Authors and Affiliations

  • Domenico Cantone
    • 1
  • Eugenio Omodeo
    • 2
  • Alberto Policriti
    • 3
  1. 1.Dipartimento di Matematica e InformaticaUniversità di CataniaCataniaItaly
  2. 2.Dipartimento di Matematica Pura e ApplicataUniversità di L’AquilaL’AquilaItaly
  3. 3.Dipartimento di Matematica e InformaticaUniversità degli Studi di UdineUdineItaly

Personalised recommendations