Hostname: page-component-7dd5485656-s6l46 Total loading time: 0 Render date: 2025-10-29T23:39:23.995Z Has data issue: false hasContentIssue false
  • English
  • Français

The Bernays-Schönfinkel-Ramsey class for set theory: decidability

Published online by Cambridge University Press:  12 March 2014

Alberto Policriti  and
Eugenio Omodeo
Alberto Policriti
Affiliation:
Dipartimento di Matematica e Informatica, Università di Udine, 33100, Via Delle Scienze 206, Italy, E-mail: alberto.policriti@uniud.it
Eugenio Omodeo
Affiliation:
Dipartimento di Matematica e Informatica, Università di Trieste, 34127 Via Valerio 12/B, Italy, E-mail: eomodeo@units.it
Get access Rights & Permissions [Opens in a new window]

Abstract

As proved recently, the satisfaction problem for all prenex formulae in the set-theoretic Bernays-Shönfinkel-Ramsey class is semi-decidable over von Neumann's cumulative hierarchy. Here that semi-decidability result is strengthened into a decidability result for the same collection of formulae.

Keywords

Satisfiabilitydecision and semi-decision algorithmscomputable set theory

Information

Type
Research Article
Information
The Journal of Symbolic Logic , Volume 77 , Issue 3 , September 2012 , pp. 896 - 918
Copyright
Copyright © Association for Symbolic Logic 2012

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.)

Article purchase

Temporarily unavailable

References

REFERENCES

[BGG97] Börger, Egon, Grädel, Erich, and Gurevich, Yuri, The classical decision problem, Perspectives in Mathematical Logic, Springer, 1997.CrossRefGoogle Scholar
[COP01] Cantone, D., Omodeo, E. G., and Policriti, A., Set theory for computing. From decision procedures to declarative programming with sets, Monographs in Computer Science, Springer-Verlag, 2001.Google Scholar
[DOPR96] Dovier, A., Omodeo, E. G., Pontelli, E., and Rossi, G.-F., A language for programming in logic with finite sets, Journal of Logic Programming, vol. 28 (1996), no. 1, pp. 1–44.CrossRefGoogle Scholar
[Kun83] Kunen, K., Set theory: an introduction to independence proofs, Studies in Logic and the Foundations of Mathematics, Elsevier, 1983.Google Scholar
[OP10] Omodeo, E. G. and Policriti, A., The Bernays-Schönfinkel-Ramsey class for set theory: Semidecidability, this Journal, vol. 75 (2010), no. 2, pp. 459–480.Google Scholar
[OPT11] Omodeo, E. G., Policriti, A., and Tomescu, A. I., Infinity, in short, Journal of Logic and Computation, in press, DOI: 10.1093/logcom/exr020.Google Scholar
[PP88] Parlamento, F. and Policriti, A., The logically simplest form of the infinity axiom, Proceedings of the American Mathematical Society, vol. 103 (1988), no. 1, pp. 274–276.Google Scholar
[Ram30] Ramsey, F. P., On a problem offormal logic, Proceedings of the London Mathematical Society, vol. 30 (1930), pp. 264–286. read on 12 13, 1928.CrossRefGoogle Scholar