scientific article; zbMATH DE number 52574

MaRDI QIDQ4002871zbMATH OpenFDO

Authors Luca Ermanni

Publication date 23 January 1993

zbMATH Keywords

finite satisfiabilityinfinite \(\pi\)-spectrumprefix type of a prenex \(L\)-formulaspectrum of a first-order sentence

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25) Model theory of finite structures (03C13)

Recommendations

• scientific article; zbMATH DE number 4200184
• Satisfiability of formulae with one \(\forall\) is decidable in exponential time
• Random models and the Gödel case of the decision problem
• Zum Reduktionstyp ∃^∞∀∃∀ (0, 1) Und Zur Spektralen Darstellung ϱ‐Stelliger Aufzählbarer und Koaufzählbarer Prädikate Durch Ausdrücke Aus ∃^∞∀∃∀ (ϱ, 1)
• Eine Verschärfung Eines Satzes von Kostyrko zur Reduktionstheorie mit Einer Anwendung Auf die Spektrale Darstellung von Prädikaten

Cited in

(5)

• On the first-order prefix hierarchy
• Random models and the Gödel case of the decision problem
• scientific article; zbMATH DE number 4200184 (Why is no real title available?)
• scientific article; zbMATH DE number 3918329 (Why is no real title available?)
• Satisfiability of formulae with one \(\forall\) is decidable in exponential time

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4002871)