On the public citation graph
Completeness of calculii for axiomatically defined classes of algebras
0 signed · 56 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1016/s1385-7258(54)50074-0openalex-snapshot
Contributions to the Theory of Models. I
inferredcites →https://doi.org/10.1016/s1385-7258(54)50075-2openalex-snapshot
Contributions to the Theory of Models. II
inferredcites →https://doi.org/10.1017/s0305004100013463openalex-snapshot
On the Structure of Abstract Algebras
inferredcites →https://doi.org/10.2307/2267044openalex-snapshot
The completeness of the first-order functional calculus
inferredcites →https://doi.org/10.2307/2268172openalex-snapshot
The decision problem for some classes of sentences without quantifiers
inferredcites →https://doi.org/10.2307/2268420openalex-snapshot
Alfred Tarski. Contributions to the theory of models. Koninklijke Nederlandse Akademie van Wetenschappen, Proceedings, series A, vol. 57 (1954), pp. 572–588, and vol. 58 (1955), pp. 56–64; also Indagationes mathematicae, vol. 16 (1954), pp. 572–588, and vol. 17 (1955), pp. 56–64.
inferredcites →https://doi.org/10.2307/2268976openalex-snapshot
Fragments of the propositional calculus
inferredcites →https://doi.org/10.2307/2305996openalex-snapshot
Proceedings of the First Canadian Mathematical Congress.
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1006/inco.1994.1037openalex-snapshot
A Completeness Theorem for Kleene Algebras and the Algebra of Regular Events
inferred← citeshttps://doi.org/10.1006/jcss.1997.1449openalex-snapshot
Comparison of Functional and Predicative Query Paradigms
inferred← citeshttps://doi.org/10.1007/3-540-12727-5_18openalex-snapshot
Characterizing specification languages which admit initial semantics
inferred← citeshttps://doi.org/10.1007/3-540-17660-8_56openalex-snapshot
Parameterized horn clause specifications: Proof theory and correctness
inferred← citeshttps://doi.org/10.1007/3-540-18625-5_57openalex-snapshot
Reasoning in systems of equations and inequations
inferred← citeshttps://doi.org/10.1007/3-540-50939-9_139openalex-snapshot
Implementation of parameterized observational specifications
inferred← citeshttps://doi.org/10.1007/3-540-58156-1_8openalex-snapshot
Induction using term orderings
inferred← citeshttps://doi.org/10.1007/3-540-64299-4_34openalex-snapshot
A completeness result for equational deduction in coalgebraic specification
inferred← citeshttps://doi.org/10.1007/978-3-030-76920-8_2openalex-snapshot
Universal Algebraic Methods for Non-classical Logics
inferred← citeshttps://doi.org/10.1007/978-94-009-1675-3_1openalex-snapshot
Induction Using Term Orders
inferred← citeshttps://doi.org/10.1007/bf01178578openalex-snapshot
Contextual rewriting as a sound and complete proof method for conditional LOG-specifications
inferred← citeshttps://doi.org/10.1007/bf01200495openalex-snapshot
Gentzen-style axiomatizations in equational logic
inferred← citeshttps://doi.org/10.1007/bf01978706openalex-snapshot
Bases of admissible rules of the logics S4 and Int
inferred← citeshttps://doi.org/10.1007/bfb0043084openalex-snapshot
Other logics for (equational) theories
inferred← citeshttps://doi.org/10.1016/0304-3975(84)90087-2openalex-snapshot
Conditional rewrite rules
inferred← citeshttps://doi.org/10.1016/0304-3975(84)90125-7openalex-snapshot
Characterizing specification languages which admit initial semantics
inferred← citeshttps://doi.org/10.1016/0304-3975(93)90006-fopenalex-snapshot
Modular specification of process algebras
inferred← citeshttps://doi.org/10.1016/0743-1066(84)90010-4openalex-snapshot
A theory of complete logic programs with equality
inferred← citeshttps://doi.org/10.1016/0743-1066(85)90016-0openalex-snapshot
General failure of logic programs
inferred← citeshttps://doi.org/10.1016/0743-1066(90)90034-3openalex-snapshot
Inference rules and proof procedures for inequations
inferred← citeshttps://doi.org/10.1016/0743-1066(92)90047-7openalex-snapshot
The term rewriting approach to automated theorem proving
inferred← citeshttps://doi.org/10.1016/b978-0-444-88074-1.50018-4openalex-snapshot
Algebraic Specification
inferred← citeshttps://doi.org/10.1016/s0049-237x(08)70041-7openalex-snapshot
Problems of Admissibility and Substitution, Logical Equations and Restricted Theories of free Algebras
inferred← citeshttps://doi.org/10.1016/s0304-3975(99)00210-8openalex-snapshot
Logicality of conditional rewrite systems
inferred← citeshttps://doi.org/10.1017/s1446788700022217openalex-snapshot
Generalized implication equation languages
inferred← citeshttps://doi.org/10.1070/sm1987v056n02abeh003038openalex-snapshot
BASES OF ADMISSIBLE RULES OF THE MODAL SYSTEM $ \mathrm{Grz}$ AND OF INTUITIONISTIC LOGIC
inferred← citeshttps://doi.org/10.1090/s0002-9939-1988-0954975-7openalex-snapshot
Completeness Theorems for Universal and Implicational Logics of Algebras Via Congruences
inferred← citeshttps://doi.org/10.1109/lics.1991.151646openalex-snapshot
A completeness theorem for Kleene algebras and the algebra of regular events
inferred← citeshttps://doi.org/10.1137/0213006openalex-snapshot
Formal Systems for Tuple and Equality Generating Dependencies
inferred← citeshttps://doi.org/10.1145/1067309.1067326openalex-snapshot
Logical verification and equational verification
inferred← citeshttps://doi.org/10.1216/rmj-1987-17-3-463openalex-snapshot
Implications for semigroups embeddable in orthocryptogroups
inferred← citeshttps://doi.org/10.1515/9781400881833-002openalex-snapshot
§2. Algebraic Preliminaries
inferred← citeshttps://doi.org/10.2307/2272123openalex-snapshot
Fragments of first order logic, I: universal Horn logic
inferred← citeshttps://doi.org/10.48550/arxiv.0801.2368openalex-snapshot
Feasibly Reducing KAT Equations to KA Equations
inferred← citeshttps://doi.org/10.48550/arxiv.2106.10966openalex-snapshot
Consequence Relations An Introduction to the Tarski-Lindenbaum Method
inferred← citeshttps://doi.org/10.48550/arxiv.cs/0505024openalex-snapshot
Logic Column 12: Logical Verification and Equational Verification
inferred← citeshttps://doi.org/10.48550/arxiv.math/0312420openalex-snapshot
Algebraic Logic, Varieties of Algebras and Algebraic Varieties
inferred← citeshttps://doi.org/10.48550/arxiv.math/0609600openalex-snapshot
On the problem of M-hyperquasivarieties
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.