Hostname: page-component-7b7567c8c-fvjsw Total loading time: 0 Render date: 2026-11-17T08:17:22.473Z Has data issue: false hasContentIssue false

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

Published online by Cambridge University Press:  12 March 2014

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

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.

Information

Type
Research Article
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