On sentences which are true of direct unions of algebras
From MaRDI portal
Publication:5805954
DOI10.2307/2268661zbMath0043.24801OpenAlexW2087588854WikidataQ56227332 ScholiaQ56227332MaRDI QIDQ5805954
Publication date: 1951
Published in: Journal of Symbolic Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/2268661
Related Items (63)
The fraction of large random trees representing a given Boolean function in implicational logic ⋮ RustHorn: CHC-Based Verification for Rust Programs ⋮ Complexity versus stability for classes of propositional formulas ⋮ Reasoning About Algebraic Structures with Implicit Carriers in Isabelle/HOL ⋮ The complexity of constraint satisfaction games and QCSP ⋮ Belief Update Within Propositional Fragments ⋮ Complexity of the problem of being equivalent to Horn formulas ⋮ On propositional definability ⋮ A representation of antimatroids by Horn rules and its application to educational systems ⋮ Belief revision within fragments of propositional logic ⋮ Horn Clause Solvers for Program Verification ⋮ Reasoning with models ⋮ Inference in Nineteenth-Century British Logic ⋮ The algebraic structure of the densification and the sparsification tasks for CSPs ⋮ A first polynomial non-clausal class in many-valued logic ⋮ Construction and learnability of canonical Horn formulas ⋮ Three views on dependency covers from an FCA perspective ⋮ Complexity of the problem of being equivalent to Horn formulas. II ⋮ A Prolog assisted search for new simple Lie algebras ⋮ Information-based distance measures and the canonical reflection of view updates ⋮ Reduced Products and Horn Classes ⋮ Properties preserved under algebraic constructions ⋮ Unnamed Item ⋮ On closure under direct product ⋮ Unnamed Item ⋮ Sequent calculus for classical logic probabilized ⋮ Colouring, constraint satisfaction, and complexity ⋮ Disjunctive closures for knowledge compilation ⋮ Canonical Inference for Implicational Systems ⋮ Forward chaining is simple\((x)\) ⋮ Minimal change: relevance and recovery revisited ⋮ RSS query algebra: towards a better news management ⋮ Models and quantifier elimination for quantified Horn formulas ⋮ Dynamic algebras: Examples, constructions, applications ⋮ Learning definite Horn formulas from closure queries ⋮ Horn sentences in identity theory ⋮ Canonical Ground Horn Theories ⋮ On generating all solutions of generalized satisfiability problems ⋮ A language for generic programming in the large ⋮ Über die Axiome Produkt-Abgeschlossener Arithmetischer Klassen ⋮ Reduced products and sheaves of metric structures ⋮ The multiple facets of the canonical direct unit implicational basis ⋮ Polynomial certificates for propositional classes ⋮ The ubiquitous axiom ⋮ Programming and symbolic computation in Maude ⋮ Unnamed Item ⋮ Existential Horn Sentences ⋮ Horn representation of a concept lattice ⋮ Inference approach based on Petri nets ⋮ Double Horn functions ⋮ On Arithmetical Classes Not Closed Under Direct Union ⋮ Efficient Reasoning for Inconsistent Horn Formulae ⋮ Characterizability in Horn Belief Revision ⋮ On the complexity of inconsistency measurement ⋮ Special issue: Boolean functions and related problems ⋮ Disjunctive and conjunctive normal forms of pseudo-Boolean functions ⋮ A method for the synthesis of deducibility conditions for Horn and some other formulas ⋮ Horn approximations of empirical data ⋮ A systematic study of models of abstract data types ⋮ The possibilistic Horn non-clausal knowledge bases ⋮ On functional dependencies in \(q\)-Horn theories ⋮ Proof theory for linear lattices ⋮ Theory revision with queries: Horn, read-once, and parity formulas
Cites Work
This page was built for publication: On sentences which are true of direct unions of algebras
