On sentences which are true of direct unions of algebras

DOI10.2307/2268661zbMATH Open0043.24801OpenAlexW2087588854WikidataQ56227332 ScholiaQ56227332MaRDI QIDQ5805954FDOQ5805954

Alfred Horn

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

zbMATH Keywords

foundations, philosophy, logic

Cites Work

• The decision problem for some classes of sentences without quantifiers

Cited In (69)

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

This page was built for publication: On sentences which are true of direct unions of algebras

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5805954)