scientific article; zbMATH DE number 3918329

MaRDI QIDQ3693501zbMATH OpenFDO

Authors Stål Aanderaa

Publication date 1984

zbMATH Keywords

dyadic predicate letterextended Ackermann classmonadic predicate letters

Mathematics Subject Classification ID

Classical first-order logic (03B10) Decidability of theories and sets of sentences (03B25)

Recommendations

• scientific article; zbMATH DE number 3715502
• The unsolvability of the Gödel class with identity
• scientific article; zbMATH DE number 52574
• Decision procedures for elementary sublanguages of set theory: X. Multilevel syllogistic extended by the singleton and powerset operators
• Satisfiability of formulae with one \(\forall\) is decidable in exponential time

Cited in

(5)

• Logical knowledge-representation formalisms
• The unsolvability of the Gödel class with identity
• First-Order Formulas in Conjunctive Quantificational Form
• scientific article; zbMATH DE number 3715502 (Why is no real title available?)
• Modeling terms by graphs with structure constraints (two illustrations)

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 Q3693501)