scientific article
From MaRDI portal
zbMath0564.03011MaRDI QIDQ3677735
Publication date: 1984
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Decidability of theories and sets of sentences (03B25) Mechanization of proofs and logical operations (03B35)
Related Items
Interpolation systems for ground proofs in automated deduction: a survey, Conflict-driven satisfiability for theory combination: lemmas, modules, and proofs, On First-Order Model-Based Reasoning, A new combination procedure for the word problem that generalizes fusion decidability results in modal logics, Decidable \({\exists}^*{\forall}^*\) first-order fragments of linear rational arithmetic with uninterpreted predicates, Unions of non-disjoint theories and combinations of satisfiability procedures