Untersuchungen über das Eliminationsproblem der mathematischen Logik
From MaRDI portal
Publication:1840069
DOI10.1007/BF01448035zbMath0009.38601OpenAlexW2057503265MaRDI QIDQ1840069
Publication date: 1934
Published in: Mathematische Annalen (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/159730
Related Items
Zum Eliminationsproblem der mathematischen Logik., Symbol elimination and applications to parametric entailment problems, Semantic forgetting in expressive description logics, Second-Order Quantifier Elimination on Relational Monadic Formulas – A Basic Method and Some Less Expected Applications, Intermediate logics admitting a structural hypersequent calculus, General domain circumscription and its first-order reduction, Second-order quantifier elimination in higher-order contexts with applications to the semantical analysis of conditionals, SCAN—Elimination of predicate quantifiers, Annotation theories over finite graphs, Predicate Elimination for Preprocessing in First-Order Theorem Proving, Elimination problems in logic: a brief history, IV. Semantic extensions of SQEMA, Towards incorporating background theories into quantifier elimination, On the strength and scope of DLS, Second-order reasoning in description logics, Approximate databases: a support tool for approximate reasoning, Voting by eliminating quantifiers, Zum Eliminationsproblem der mathematischen Logik, Algorithmic Correspondence for Relevance Logics I. The Algorithm $$\mathsf {PEARL}$$
