The decision problem for some classes of sentences without quantifiers

DOI10.2307/2268172zbMATH Open0063.03864OpenAlexW2145062905MaRDI QIDQ5844609FDOQ5844609

J. C. C. McKinsey

Publication date: 1943

Published in: Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/2268172

Cites Work

• Free lattices

Cited In (89)

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

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)