On the public citation graph
A simple, purely algebraic proof of the completeness of some first order logics
0 signed · 26 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/b978-0-7204-2233-7.50029-0openalex-snapshot
MODEL-THEORETIC METHODS AND RESULTS IN THE THEORY OF CYLINDRIC ALGEBRAS**Research supported by NSF grants GP-1232 and GP-1395.
inferredcites →https://doi.org/10.1016/s0049-237x(08)71537-4openalex-snapshot
Internal Semantics and Algebraic Logic
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/11828563_19openalex-snapshot
Algebraization of Hybrid Logic with Binders
inferred← citeshttps://doi.org/10.1007/3-540-10854-8_31openalex-snapshot
Dynamic algebras of programs
inferred← citeshttps://doi.org/10.1007/bf00370684openalex-snapshot
Algebraization of quantifier logics, an introductory overview
inferred← citeshttps://doi.org/10.1007/bf01849839openalex-snapshot
On conceptual completeness of syntactic-semantical systems
inferred← citeshttps://doi.org/10.1007/bfb0095613openalex-snapshot
Cylindric set algebras and related structures
inferred← citeshttps://doi.org/10.1007/bfb0095614openalex-snapshot
On cylindric-relativized set algebras
inferred← citeshttps://doi.org/10.1007/s00012-004-1807-yopenalex-snapshot
On amalgamation of reducts of polyadic algebras
inferred← citeshttps://doi.org/10.1007/s11787-015-0129-5openalex-snapshot
The Universal Theory of First Order Algebras and Various Reducts
inferred← citeshttps://doi.org/10.1016/0168-0072(86)90061-8openalex-snapshot
Representable cylindric algebras
inferred← citeshttps://doi.org/10.1016/s0049-237x(08)70008-9openalex-snapshot
I. Bibliography of Cylindric Algebras and Related Algebraic Structures
inferred← citeshttps://doi.org/10.1016/s0168-0072(97)00027-4openalex-snapshot
Complexity of equations valid in algebras of relations part I: Strong non-finitizability
inferred← citeshttps://doi.org/10.1023/a:1021364629235openalex-snapshot
A Note on Algebras of Substitutions
inferred← citeshttps://doi.org/10.1093/jigpal/jzq021openalex-snapshot
On nonrepresentable G-polyadic algebras with representable cylindric reducts
inferred← citeshttps://doi.org/10.1093/jigpal/jzr049openalex-snapshot
Some variants of Vaught's conjecture from the perspective of algebraic logic
inferred← citeshttps://doi.org/10.1305/ndjfl/1093870384openalex-snapshot
The class of neat-reducts of cylindric algebras is not a variety but is closed with respect to ${\rm HP}$.
inferred← citeshttps://doi.org/10.1556/sscmath.2011.1184openalex-snapshot
Amalgamation in universal algebraic logic
inferred← citeshttps://doi.org/10.2178/bsl/1130335206openalex-snapshot
Algebraic Logic, Where Does it Stand Today?
inferred← citeshttps://doi.org/10.2307/2273903openalex-snapshot
The contributions of Alfred Tarski to algebraic logic
inferred← citeshttps://doi.org/10.4064/-28-1-311-318openalex-snapshot
Weak products of universal algebras
inferred← citeshttps://doi.org/10.48550/arxiv.1401.1156openalex-snapshot
Algebraisable versions of predicate topological logic
inferred← citeshttps://doi.org/10.48550/arxiv.1402.5998openalex-snapshot
Algebraic analysis of temporal and topological finite variable fragments, using cylindric modal algebras
inferred← citeshttps://doi.org/10.48550/arxiv.1403.1805openalex-snapshot
The Universal Theory of First Order Algebras and Various Reducts
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.