Prefix classes of krom formulae with identity
From MaRDI portal
Publication:3956908
DOI10.1007/BF02318025zbMath0494.03007MaRDI QIDQ3956908
Egon Börger, Stål Aanderaa, 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
03B10: Classical first-order logic
Cites Work
- Unnamed Item
- Recursive unsolvability of Post's problem of Tag und other topics in theory of Turing machines
- Decidability of a portion of the predicate calculus
- Eine Entscheidbare Klasse Von Kromformeln
- Prefix classes of Krom formulas
- The decision problem for standard classes
- Semi-conservative reduction
- Beitrag zur Reduktion des Entscheidungsproblems auf Klassen von Hornformeln mit kurzen Alternationen
- Computability of Recursive Functions