<s>
The	O
Bernays	B-Algorithm
–	I-Algorithm
Schönfinkel	I-Algorithm
class	I-Algorithm
(	O
also	O
known	O
as	O
Bernays	O
–	O
Schönfinkel	O
–	O
Ramsey	O
class	O
)	O
of	O
formulas	O
,	O
named	O
after	O
Paul	O
Bernays	O
,	O
Moses	O
Schönfinkel	O
and	O
Frank	O
P	O
.	O
Ramsey	O
,	O
is	O
a	O
fragment	O
of	O
first-order	O
logic	O
formulas	O
where	O
satisfiability	O
is	O
decidable	O
.	O
</s>
<s>
It	O
is	O
the	O
set	O
of	O
sentences	O
that	O
,	O
when	O
written	O
in	O
prenex	B-Application
normal	I-Application
form	I-Application
,	O
have	O
an	O
quantifier	O
prefix	O
and	O
do	O
not	O
contain	O
any	O
function	B-Language
symbols	I-Language
.	O
</s>
<s>
This	O
class	O
of	O
logic	O
formulas	O
is	O
also	O
sometimes	O
referred	O
as	O
effectively	B-Algorithm
propositional	I-Algorithm
(	O
EPR	O
)	O
since	O
it	O
can	O
be	O
effectively	O
translated	O
into	O
propositional	O
logic	O
formulas	O
by	O
a	O
process	O
of	O
grounding	O
or	O
instantiation	O
.	O
</s>
