The DOI matches its Crossref record.
On sentences which are true of direct unions of algebras
Abstract
It is well known that certain sentences corresponding to similar algebras are invariant under direct union; that is, are true of the direct union when true of each factor algebra. An axiomatizable class of similar algebras, such as the class of groups, is closed under direct union when each of its axioms is invariant. In this paper we shall determine a wide class of invariant sentences. We shall also be concerned with determining sentences which are true of a direct union provided they are true of some factor algebra. In the case where all the factor algebras are the same, a further result is obtained. In §2 it will be shown that these criteria are the only ones of their kind. Lemma 7 below may be of some independent interest. We adopt the terminology and notation of McKinsey with the exception that the sign · will be used for conjunction. Expressions of the form ∼∊, where ∊ is an equation, will be called inequalities. In accordance with the analogy between conjunction and disjunction with product and sum respectively, we shall call α1, …, αn the terms of the disjunction and the factors of the conjunction Every closed sentence is equivalent to a sentence in prenez normal form, where x1, …, xm distinct individual variables, Q1, …, Q m are quantifiers, and the matrix S is an open sentence in which each of the variables x1, …, x m actually occurs. The sentence S may be written in either disjunctive normal form: where αi,j is either an equation or an inequality, or in conjunctive normal form: .
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cited by
Constraint logic programming: a survey
Jaffar, J., & Maher, M. J. (1994) · The Journal of Logic Programming · doi:10.1016/0743-1066(94)90033-7 · Cited by 1,312
Artificial Intelligence: A New Synthesis
(1998) · Elsevier eBooks · doi:10.1016/c2009-0-27773-7 · Cited by 1,163
Knowledge Representation and Reasoning
(2024) · Encyclopedia of Computer Graphics and Games · doi:10.1007/978-3-031-23161-2_300700 · Cited by 819
DogOnt - Ontology Modeling for Intelligent Domotic Environments
Bonino, D., & Corno, F. (2008) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-88564-1_51 · Cited by 256
Logic-based technologies for multi-agent systems: a systematic literature review
Calegari, R., Ciatto, G., Mascardi, V., & Omicini, A. (2021) · Autonomous Agents and Multi-Agent Systems · doi:10.1007/s10458-020-09478-3 · Cited by 117
“However, SHOP implements an inference mechanism based on Horn clauses [190], with support to negation as failure.”
Method
Metadata
- Authors
- Horn, A.
- Venue
- Journal of Symbolic Logic
- Publisher
- Cambridge University Press (CUP)
- Published
- 1951-03
- Volume
- 16
- Issue
- 1
- Pages
- 14-21
- ISSN
- 0022-4812 (ISSN-L)
- 1943-5886
- OpenAlex
- W2087588854
- Cited by
- 379
- References
- 0
- FWCI
- 1.84
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: On sentences which are true of direct unions of algebras. https://app.cochat.ai/papers/10.2307/2268661
- The paper
- Horn, A. (1951). On sentences which are true of direct unions of algebras. Journal of Symbolic Logic. https://doi.org/10.2307/2268661
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.