Bernays–Schönfinkel class
id:
bernays-sch-nfinkel-class-313-9876992
title:
Bernays–Schönfinkel class
text:
The Bernays–Schönfinkel class of formulas, named after Paul Bernays, Moses Schönfinkel and Frank P. Ramsey, is a fragment of first-order logic formulas where satisfiability is decidable. It is the set of sentences that, when written in prenex normal form, have an ∃ ∗ ∀ ∗ quantifier prefix and do not contain any function symbols. Ramsey proved that, if ϕ is a formula in the Bernays–Schönfinkel class with one free variable, then either { x ∈ N : ϕ } :\phi (x)\}} is finite, or { x ∈ N : ¬ ϕ } :\n
brand slug:
wiki
category slug:
encyclopedia
description:
original url:
https://en.wikipedia.org/wiki/Bernays%E2%80%93Sch%C3%B6nfinkel_class
date created:
date modified:
2024-01-25T21:57:02Z
main entity:
{"identifier":"Q4894025","url":"https://www.wikidata.org/entity/Q4894025"}
image:
fields total:
13
integrity:
13