Hostname: page-component-cd9895bd7-fscjk Total loading time: 0 Render date: 2024-12-28T00:42:48.507Z Has data issue: false hasContentIssue false

A strong version of Herbrand's theorem for introvert sentences

Published online by Cambridge University Press:  12 March 2014

Tore Langholm*
Affiliation:
University of Oslo, Department of Linguistics, P.O. Box 1102 Blindern, 0317 Oslo, Norway, E-mail: [email protected]

Extract

A version of Herbrand's theorem tells us that a universal sentence of a first-order language with at least one constant is satisfiable if and only if the conjunction of all its ground instances is. In general the set of such instances is infinite, and arbitrarily large finite subsets may have to be inspected in order to detect inconsistency. Essentially, the reason that every member of such an infinite set may potentially matter, can be traced back to sentences like

(1)

Loosely put, such sentences effectively sabotage any attempt to build a model from below in a finite number of steps, since new members of the Herbrand universe are constantly brought to attention. Since they cause an indefinite expansion of the relevant part of the Herbrand universe, such sentences could quite appropriately be called expanding.

When such sentences are banned, stronger versions of Herbrand's theorem can be stated. Define a clause (disjunction of literals) to be non-expanding if every non-ground term occurring in a positive literal also occurs (possibly as an embedded subterm) in a negative literal of the same clause. Written as a disjunction of literals, the matrix of (1) clearly fails this criterion. Moreover, say that a sentence is non-expanding if it is a universal sentence with a quantifier-free matrix that is a conjunction of non-expanding clauses. Such sentences do in a sense never reach out beyond themselves, and the relevant part of the Herbrand universe is therefore drastically reduced.

Type
Research Article
Copyright
Copyright © Association for Symbolic Logic 1998

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

REFERENCES

[1] Ackermann, Wilhelm, Solvable cases of the decision problem, North-Holland, 1954.Google Scholar
[2] Dowling, William F. and Gallier, Jean H., Linear-time algorithms for testing the satisfiability of propositional Horn formulae, Journal of Logic Programming, vol. 3 (1984), pp. 267284.Google Scholar
[3] Givan, Robert and McAllester, David, New results on local inference relations, Principles of knowledge representation and reasoning: Proceedings of the third international conference (KR-92), Morgan Kaufmann Press, 1992, pp. 403412.Google Scholar
[4] McAllester, David, Automatic recognition of tractability in inference relations, Journal of the Association for Computing Machinery, vol. 40 (1993), pp. 284303.Google Scholar
[5] Shostak, Robert E., An algorithm for reasoning about equality, Communications of the Association for Computing Machinery, vol. 21 (1978), pp. 583585.Google Scholar