In this work we mainly emphasize two, somehow orthogonal, aspects of completeness for first-order calculi. Firstly, from the syntactic point of view, our aim is to single out minimal, albeit sufficient, requirements on the underlying language to ensure general completeness results. Secondly, concerning the semantic aspects of automated reasoning, we are interested in generalizing standard completeness arguments to the case of theory-reasoning.
File in questo prodotto:
Non ci sono file associati a questo prodotto.