Hostname: page-component-7b7567c8c-z4zkx Total loading time: 0 Render date: 2026-11-16T20:46:21.049Z Has data issue: false hasContentIssue false

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

Published online by Cambridge University Press:  12 March 2014

Eugenio Omodeo
Affiliation:
Dipartimento di Matematica e Informatica, Università di Trieste, 34127, Via Valerio 12/B, Italy. E-mail: eomodeo@units.it
Alberto Policriti
Affiliation:
Dipartimento di Matematica e Informatica, Università di Udine, 33100, Via Delle Scienze 206, Italy. E-mail: policriti@dimi.uniud.it

Abstract

As is well-known, the Bernays-Schönfinkel-Ramsey class of all prenex ∃*∀*-sentences which are valid in classical first-order logic is decidable. This paper paves the way to an analogous result which the authors deem to hold when the only available predicate symbols are ∈ and =, no constants or function symbols are present, and one moves inside a (rather generic) Set Theory whose axioms yield the well-foundedness of membership and the existence of infinite sets. Here semi-decidability of the satisfiability problem for the BSR class is proved by following a purely semantic approach, the remaining part of the decidability result being postponed to a forthcoming paper.

Information

Type
Research Article
Copyright
Copyright © Association for Symbolic Logic 2010

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