The decision problem for some classes of sentences without quantifiers

Cites work

Free lattices

Cited in

(97)

An efficient algorithm for Horn description
Why Horn formulas matter in computer science: initial structures and generic examples
The word and generator problems for lattices
Free products and the word problem
Varieties generated by para primal algebras
On the word problem of lattices with the help of graphs
A field guide to equational logic
Syntactic characterization of closure under connected limits
Classes of algebraic systems defined by universal Horn sentences
Universal Horn axiom systems for lattices of submodules
Double Horn functions
Error-free and best-fit extensions of partially defined Boolean functions
Variations on extending partially defined Boolean functions with missing bits.
Resolution-based decision procedures for the universal theory of some classes of distributive lattices with operators
Conjunctive-query containment and constraint satisfaction
On functional dependencies in q-Horn theories
Varieties of Boolean inverse semigroups
Algorithmically complex residually finite groups
Symmetric embeddings of free lattices into each other
On the expressive power of data dependencies
A Horn sentence for involution lattices of quasiorders
Horn approximations of empirical data
Efficient dualization of \(O(\log n\))-term monotone disjunctive normal forms
Join-semidistributive lattices and convex geometries.
Sublattices of lattices of order-convex sets. I: The main representation theorem
Iterating conditionals and symmetric Stone algebras
An axiomatisation of a pure calculus of names
Varieties of lattices with geometric descriptions
Computability of finite quotients of finitely generated groups
The possibilistic Horn non-clausal knowledge bases
Existence varieties of regular rings and complemented modular lattices
A representation of antimatroids by Horn rules and its application to educational systems
On the existence of free models in fuzzy universal Horn classes
Polynomial certificates for propositional classes
Completeness of calculii for axiomatically defined classes of algebras
Solvability of independent systems of equations in finitely generated nilpotent groups
Reasoning with models
Almost structural completeness; an algebraic approach
The large-scale geometry of locally compact solvable groups
Characterizability in Horn belief revision
Can you compute the operator norm?
On the consistency problem for modular lattices and related structures
Asymptotic invariants, complexity of groups and related problems.
On Arithmetical Classes Not Closed Under Direct Union
On the interpretation of Aristotelian syllogistic
The validity of equations of complex algebras
Properties preserved under algebraic constructions
A note on direct products
On closure under direct product
Canonical Inference for Implicational Systems
Horn representation of a concept lattice
Decision procedure of some relevant logics: a constructive perspective
Finitely Presented Lattices: Canonical Forms and the Covering Relation
Über die Axiome Produkt-Abgeschlossener Arithmetischer Klassen
Partial algebras and complexity of satisfiability and universal theory for distributive lattices, Boolean algebras and Heyting algebras
Lattices freely generated by an order and preserving certain bounds
Construction and learnability of canonical Horn formulas
Fragments of first order logic, I: universal Horn logic
Finitely Presented Lattices
Model-based recasting in answer-set programming
Disjunctive closures for knowledge compilation
The Undecidability of the Word Problems for Projective Geometries and Modular Lattices
Canonical ground Horn theories
An equational logic sampler
Succinctness and tractability of closure operator representations
Learning definite Horn formulas from closure queries
Residuated Algebraic Structures in the Vicinity of Pre-rough Algebra and Decidability
On first-order sentences without finite models
Residually finite groups
Reduced Products and Horn Classes
Existential Horn Sentences
Partition semantics for relations
On sentences which are true of direct unions of algebras
Complexity of word problems for HNN-extensions
Ascending HNN extensions of residually finite groups can be non-Hopfian and can have very few finite quotients
The algebraic structure of the densification and the sparsification tasks for CSPs
On the Boolean connectivity problem for Horn relations
A first polynomial non-clausal class in many-valued logic
Union-closed sets and Horn Boolean functions
Matroid Horn functions
Hypergraph Horn functions
Bounding conjugacy depth functions for wreath products of finitely generated abelian groups
On residual finiteness of graphs of free groups with cyclic edge groups
Fundamental n-quandles of links are residually finite
Remarks and problems about algorithmic descriptions of groups
An equational theory for a nilpotent A-loop.
One head is better than two: a polynomial restriction for propositional definite Horn forgetting
On the uniform word problem for lattices
Characterizing data dependencies then and now
Algorithms for twisted conjugacy classes of polycyclic-by-finite groups. II
Computing finite index congruences of finitely presented semigroups and monoids
Embedding lattices into derived lattices.
Model complete universal Horn classes
Residual finiteness in permutation varieties of semigroups
Theory revision with queries: Horn, read-once, and parity formulas
Obstruction to a Higman embedding theorem for residually finite groups with solvable word problem
The multiple facets of the canonical direct unit implicational basis

This page was built for publication: The decision problem for some classes of sentences without quantifiers

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