Prefix classes of krom formulae with identity

DOI10.1007/BF02318025MaRDI QIDQ3956908zbMATH OpenFDO

Authors Stål Aanderaa, Egon Börger, Yuri Gurevich

Publication date 1982

Published in Archiv für mathematische Logik und Grundlagenforschung (Search for Journal in Brave)

Full work available at URL https://eudml.org/doc/137990

zbMATH Keywords

conservative reduction class for satisfiabilitydecidable classKrom sentences

Mathematics Subject Classification ID

Classical first-order logic (03B10)

Cites work

• Beitrag zur Reduktion des Entscheidungsproblems auf Klassen von Hornformeln mit kurzen Alternationen
• Computability of Recursive Functions
• Decidability of a portion of the predicate calculus
• Eine Entscheidbare Klasse Von Kromformeln
• scientific article; zbMATH DE number 3366917 (Why is no real title available?)
• Prefix classes of Krom formulas
• Recursive unsolvability of Post's problem of Tag und other topics in theory of Turing machines
• Semi-conservative reduction
• The decision problem for standard classes

This page was built for publication: Prefix classes of krom formulae with identity

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