On the public citation graph

A Formalization of Set Theory without Variables

https://doi.org/10.1090/coll/041
0 signed · 398 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.
Claim with ORCID
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.
See reference health

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/cpa.3160480908openalex-snapshot
Solvable set/hyperset contexts: I. Some decision procedures for the pure, finite case
inferred← citeshttps://doi.org/10.1002/jgt.22741openalex-snapshot
Seurat games on Stockmeyer graphs
inferred← citeshttps://doi.org/10.1002/malq.19890350405openalex-snapshot
Finitary Algebraic Logic
inferred← citeshttps://doi.org/10.1002/malq.19950410207openalex-snapshot
Binary Relations and Permutation Groups
inferred← citeshttps://doi.org/10.1002/malq.200610026openalex-snapshot
Addition and multiplication of sets
inferred← citeshttps://doi.org/10.1002/malq.200710074openalex-snapshot
Weakly associative relation algebras with projections
inferred← citeshttps://doi.org/10.1006/jsco.1999.0362openalex-snapshot
Goals and Benchmarks for Automated Map Reasoning
inferred← citeshttps://doi.org/10.1007/0-306-48332-7_42openalex-snapshot
Boolean and Fuzzy Relations
inferred← citeshttps://doi.org/10.1007/10721959_13openalex-snapshot
System Description: aRa – An Automatic Theorem Prover for Relation Algebras
inferred← citeshttps://doi.org/10.1007/10721959_9openalex-snapshot
Gödel’s Algorithm for Class Formation
inferred← citeshttps://doi.org/10.1007/10721975_7openalex-snapshot
Normal Forms and Reduction for Theories of Binary Relations
inferred← citeshttps://doi.org/10.1007/11828563_12openalex-snapshot
Monotonicity Analysis Can Speed Up Verification
inferred← citeshttps://doi.org/10.1007/11964810_5openalex-snapshot
An Environment for Specifying Properties of Dyadic Relations and Reasoning About Them II: Relational Presentation of Non-classical Logics
inferred← citeshttps://doi.org/10.1007/11964810_7openalex-snapshot
Relational Logics and Their Applications
inferred← citeshttps://doi.org/10.1007/11965893_10openalex-snapshot
Axiomatizing the Logical Core of XPath 2.0
inferred← citeshttps://doi.org/10.1007/3-540-36280-0_21openalex-snapshot
Tangent Circle Algebras
inferred← citeshttps://doi.org/10.1007/3-540-36280-0_4openalex-snapshot
Algebraic Semantics of ER-Models in the Context of the Calculus of Relations. II: Dynamic View
inferred← citeshttps://doi.org/10.1007/3-540-36280-0_5openalex-snapshot
Interpretability of First—Order Dynamic Logic in a Relational Calculus
inferred← citeshttps://doi.org/10.1007/3-540-36576-1_15openalex-snapshot
The Converse of a Stochastic Relation
inferred← citeshttps://doi.org/10.1007/3-540-44802-0_2openalex-snapshot
Applications of Alfred Tarski’s Ideas in Database Theory
inferred← citeshttps://doi.org/10.1007/3-540-45744-5_12openalex-snapshot
Instructing Equational Set-Reasoning with Otter
inferred← citeshttps://doi.org/10.1007/3-540-46508-1_12openalex-snapshot
An Equational Re-engineering of Set Theories
inferred← citeshttps://doi.org/10.1007/3-540-47724-1_16openalex-snapshot
Composing Cardinal Direction Relations
inferred← citeshttps://doi.org/10.1007/3-540-48086-2_92openalex-snapshot
Combining Parallel and Distributed Search in Automated Equational Deduction
inferred← citeshttps://doi.org/10.1007/3-540-51081-8_112openalex-snapshot
An equational logic sampler
inferred← citeshttps://doi.org/10.1007/3-540-59200-8_78openalex-snapshot
Disguising recursively chained rewrite rules as equational theorems, as implemented in the prover EFTTP Mark 2
inferred← citeshttps://doi.org/10.1007/3-540-60117-1_14openalex-snapshot
Induction and recursion on datatypes
inferred← citeshttps://doi.org/10.1007/3-540-61550-4_147openalex-snapshot
From specifications to programs: A fork-algebraic approach to bridge the gap
inferred← citeshttps://doi.org/10.1007/3-540-63104-6_36openalex-snapshot
RALL: Machine-supported proofs for relation algebra
inferred← citeshttps://doi.org/10.1007/978-0-387-35672-3_5openalex-snapshot
Concrete Generic Functionals
inferred← citeshttps://doi.org/10.1007/978-1-4020-5587-4_11openalex-snapshot
Logic of Space-Time and Relativity Theory
inferred← citeshttps://doi.org/10.1007/978-1-4020-5587-4_3openalex-snapshot
Axioms, Algebras and Topology
inferred← citeshttps://doi.org/10.1007/978-1-4020-8926-8_16openalex-snapshot
Tarski’s Practice and Philosophy: Between Formalism and Pragmatism
inferred← citeshttps://doi.org/10.1007/978-1-4471-1486-4_5openalex-snapshot
Semantic Optimization of Queries in Deductive Object-Oriented Database
inferred← citeshttps://doi.org/10.1007/978-1-4471-3227-1_16openalex-snapshot
Comparing Two Different Approaches to Products in Abstract Relation Algebra
inferred← citeshttps://doi.org/10.1007/978-1-4471-3227-1_4openalex-snapshot
Relation Algebras for Reasoning about Time and Space
inferred← citeshttps://doi.org/10.1007/978-3-030-24536-8_7openalex-snapshot
Semantic Theory of Truth—Informal Aspects
inferred← citeshttps://doi.org/10.1007/978-3-030-39951-1_3openalex-snapshot
On Matrices and K-Relations
inferred← citeshttps://doi.org/10.1007/978-3-030-43520-2_13openalex-snapshot
Expressive Power and Succinctness of the Positive Calculus of Relations
inferred← citeshttps://doi.org/10.1007/978-3-030-64187-0_11openalex-snapshot
Undecidability of Algebras of Binary Relations
inferred← citeshttps://doi.org/10.1007/978-3-030-64187-0_15openalex-snapshot
Freeing Structural Realism from Model Theory
inferred← citeshttps://doi.org/10.1007/978-3-030-64187-0_9openalex-snapshot
On the Semilattice of Modal Operators and Decompositions of the Discriminator
inferred← citeshttps://doi.org/10.1007/978-3-030-71430-7_3openalex-snapshot
Tarskian Classical Relevant Logic
inferred← citeshttps://doi.org/10.1007/978-3-031-28083-2_12openalex-snapshot
Implication Algebras and Implication Semigroups of Binary Relations
inferred← citeshttps://doi.org/10.1007/978-3-031-28083-2_7openalex-snapshot
Dependences Between Domain Constructions in Heterogeneous Relation Algebras
inferred← citeshttps://doi.org/10.1007/978-3-031-36757-1_4openalex-snapshot
Enterprise Modeling with Conventions
inferred← citeshttps://doi.org/10.1007/978-3-031-44461-6_13openalex-snapshot
The Philosophy of Logic of John Corcoran
inferred← citeshttps://doi.org/10.1007/978-3-031-66673-5_4openalex-snapshot
On the Relational Basis of Early R/G Work
inferred← citeshttps://doi.org/10.1007/978-3-031-68279-7_13openalex-snapshot
Undecidability of the Positive Calculus of Relations with Transitive Closure and Difference: Hypothesis Elimination Using Graph Loops
inferred← citeshttps://doi.org/10.1007/978-3-031-94533-5_6openalex-snapshot
On Quantitative Solution Iteration in QAlloy
inferred← citeshttps://doi.org/10.1007/978-3-211-85432-7_5openalex-snapshot
Logics of Similarity and their Dual Tableaux A Survey
inferred← citeshttps://doi.org/10.1007/978-3-319-06251-8_11openalex-snapshot
Automated Verification of Relational While-Programs
inferred← citeshttps://doi.org/10.1007/978-3-319-17822-6_17openalex-snapshot
Declarative Compilation for Constraint Logic Programming
inferred← citeshttps://doi.org/10.1007/978-3-319-19797-5_12openalex-snapshot
Column-Wise Extendible Vector Expressions and the Relational Computation of Sets of Sets
inferred← citeshttps://doi.org/10.1007/978-3-319-24704-5_16openalex-snapshot
Investigating and Computing Bipartitions with Algebraic Means
inferred← citeshttps://doi.org/10.1007/978-3-319-24704-5_17openalex-snapshot
Tool-Based Verification of a Relational Vertex Coloring Program
inferred← citeshttps://doi.org/10.1007/978-3-319-24704-5_2openalex-snapshot
Connections between Relation Algebras and Cylindric Algebras
inferred← citeshttps://doi.org/10.1007/978-3-319-24704-5_9openalex-snapshot
Generalised N-ary Relations and Allegories
inferred← citeshttps://doi.org/10.1007/978-3-319-43144-4_29openalex-snapshot
Cardinalities of Finite Relations in Coq
inferred← citeshttps://doi.org/10.1007/978-3-319-65430-0_29openalex-snapshot
Tarski’s Influence on Computer Science
inferred← citeshttps://doi.org/10.1007/978-3-319-65430-0_30openalex-snapshot
The Absence of Multiple Universes of Discourse in the 1936 Tarski Consequence-Definition Paper
inferred← citeshttps://doi.org/10.1007/978-3-319-97879-6_1openalex-snapshot
Everything is a Relation: A Preview
inferred← citeshttps://doi.org/10.1007/978-3-319-97879-6_6openalex-snapshot
Reasoning on Relations, Modalities, and Sets
inferred← citeshttps://doi.org/10.1007/978-3-319-97879-6_7openalex-snapshot
Dual Tableau-Based Decision Procedures for Fragments of the Logic of Binary Relations
inferred← citeshttps://doi.org/10.1007/978-3-540-24615-2_5openalex-snapshot
An Environment for Specifying Properties of Dyadic Relations and Reasoning about Them I: Language Extension Mechanisms
inferred← citeshttps://doi.org/10.1007/978-3-540-30482-1_19openalex-snapshot
An Equational Calculus for Alloy
inferred← citeshttps://doi.org/10.1007/978-3-540-30570-5_8openalex-snapshot
First Order Paths in Ordered Trees
inferred← citeshttps://doi.org/10.1007/978-3-540-45236-2_37openalex-snapshot
Taking Alloy to the Movies
inferred← citeshttps://doi.org/10.1007/978-3-540-71070-7_5openalex-snapshot
On Automating the Calculus of Relations
inferred← citeshttps://doi.org/10.1007/978-3-540-79980-1_7openalex-snapshot
Calculating Invariants as Coreflexive Bisimulations
inferred← citeshttps://doi.org/10.1007/978-3-642-02843-4_14openalex-snapshot
A Study of a Positive Fragment of Path Queries: Expressiveness, Normal Form, and Minimization
inferred← citeshttps://doi.org/10.1007/978-3-642-03153-3_5openalex-snapshot
Extended Static Checking by Calculation Using the Pointfree Transform
inferred← citeshttps://doi.org/10.1007/978-3-642-03754-2_3openalex-snapshot
Logical Foundations of XML and XQuery
inferred← citeshttps://doi.org/10.1007/978-3-642-04639-1_23openalex-snapshot
Complements in Distributive Allegories
inferred← citeshttps://doi.org/10.1007/978-3-642-10452-7_11openalex-snapshot
An Integrated Formal Methods Tool-Chain and Its Application to Verifying a File System Model
inferred← citeshttps://doi.org/10.1007/978-3-642-13321-3_16openalex-snapshot
Matrices as Arrows!
inferred← citeshttps://doi.org/10.1007/978-3-642-14052-5_13openalex-snapshot
An Efficient Coq Tactic for Deciding Kleene Algebras
inferred← citeshttps://doi.org/10.1007/978-3-642-14322-9_14openalex-snapshot
The Algebra of Lexical Semantics
inferred← citeshttps://doi.org/10.1007/978-3-642-14808-8_20openalex-snapshot
Complete Calculi for Structured Specifications in Fork Algebra
inferred← citeshttps://doi.org/10.1007/978-3-642-21070-9_22openalex-snapshot
Programming from Galois Connections
inferred← citeshttps://doi.org/10.1007/978-3-642-21070-9_24openalex-snapshot
Splitting Atoms in Relational Algebras
inferred← citeshttps://doi.org/10.1007/978-3-642-28472-4_8openalex-snapshot
The Impact of Transitive Closure on the Boolean Expressiveness of Navigational Query Languages on Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-31223-6_40openalex-snapshot
A Graph Calculus for Proving Intuitionistic Relation Algebraic Equations
inferred← citeshttps://doi.org/10.1007/978-3-642-33314-9_17openalex-snapshot
Relation Algebras, Matrices, and Multi-valued Decision Diagrams
inferred← citeshttps://doi.org/10.1007/978-3-642-35025-2_5openalex-snapshot
Amalgamation, Interpolation and Epimorphisms in Algebraic Logic
inferred← citeshttps://doi.org/10.1007/978-3-662-21963-8_12openalex-snapshot
Decidability of the ∃*∀*-Class in the Membership Theory NWL
inferred← citeshttps://doi.org/10.1007/978-3-662-58771-3_11openalex-snapshot
The Undecidability of FO3 and the Calculus of Relations with Just One Binary Relation
inferred← citeshttps://doi.org/10.1007/978-3-7091-6045-9_27openalex-snapshot
Commentary on Didactics, Variables, Fluents
inferred← citeshttps://doi.org/10.1007/978-3-7908-1828-4_13openalex-snapshot
Proof Systems in Relation Algebra
inferred← citeshttps://doi.org/10.1007/978-3-7908-1828-4_14openalex-snapshot
Connections Between Cylindric Algebras and Relation Algebras
inferred← citeshttps://doi.org/10.1007/978-3-7908-1828-4_16openalex-snapshot
Beyond Modalities: Sufficiency and Mixed Algebras
inferred← citeshttps://doi.org/10.1007/978-3-7908-1828-4_7openalex-snapshot
Contact Relation Algebras
inferred← citeshttps://doi.org/10.1007/978-3-7908-1888-8_5openalex-snapshot
Rough Sets and Algebras of Relations
inferred← citeshttps://doi.org/10.1007/978-94-009-0349-4_16openalex-snapshot
Integrating Lists, Multisets, and Sets in a Logic Programming Framework
inferred← citeshttps://doi.org/10.1007/978-94-009-2047-7_5openalex-snapshot
The Logic of Relations
inferred← citeshttps://doi.org/10.1007/978-94-010-0526-5_3openalex-snapshot
A Representation of Relation Algebras Using Routley-Meyer Frames
inferred← citeshttps://doi.org/10.1007/978-94-011-1152-2_3openalex-snapshot
A Variable-Free Logic for Anaphora
inferred← citeshttps://doi.org/10.1007/978-94-017-0452-6_3openalex-snapshot
Algebraic Logic
inferred← citeshttps://doi.org/10.1007/978-94-017-2109-7_11openalex-snapshot
Binary Relations in the Social and Mathematical Sciences
inferred← citeshttps://doi.org/10.1007/bf00370681openalex-snapshot
The origin of relation algebras in the development and axiomatization of the calculus of relations
inferred← citeshttps://doi.org/10.1007/bf00370684openalex-snapshot
Algebraization of quantifier logics, an introductory overview
inferred← citeshttps://doi.org/10.1007/bf01049413openalex-snapshot
Taming logic
inferred← citeshttps://doi.org/10.1007/bf01089734openalex-snapshot
Finite mathematics
inferred← citeshttps://doi.org/10.1007/bf01181877openalex-snapshot
Some lattice models of bilinear logic
inferred← citeshttps://doi.org/10.1007/bf01191089openalex-snapshot
Free algebras in discriminator varieties
inferred← citeshttps://doi.org/10.1007/bf01195269openalex-snapshot
Isomorphic but not base-isomorphic base-minimal cylindric set algebras
inferred← citeshttps://doi.org/10.1007/bf01197185openalex-snapshot
The combinatorial degrees of proofs and equations
inferred← citeshttps://doi.org/10.1007/bf01221799openalex-snapshot
A perspective on the theory of relation algebras
inferred← citeshttps://doi.org/10.1007/bf01225472openalex-snapshot
The equational theory of union-free algebras of relations
inferred← citeshttps://doi.org/10.1007/bf02679816openalex-snapshot
On equational theories of varieties of anticommutative rings
inferred← citeshttps://doi.org/10.1007/bf03023831openalex-snapshot
A portrait of Alfred Tarski
inferred← citeshttps://doi.org/10.1007/bf03024832openalex-snapshot
Unifying threads in alfred tarski’s work
inferred← citeshttps://doi.org/10.1007/bfb0013986openalex-snapshot
Completeness through flatness in two-dimensional temporal logic
inferred← citeshttps://doi.org/10.1007/bfb0022252openalex-snapshot
Cut free formalization of logic with finitely many variables. Part I.
inferred← citeshttps://doi.org/10.1007/bfb0043075openalex-snapshot
Relatively free relation algebras
inferred← citeshttps://doi.org/10.1007/bfb0043078openalex-snapshot
On cylindric algebraic model theory
inferred← citeshttps://doi.org/10.1007/bfb0043079openalex-snapshot
Dynamic algebras as a well-behaved fragment of relation algebras
inferred← citeshttps://doi.org/10.1007/bfb0043086openalex-snapshot
Beth's and Craig's properties via epimorphisms and amalgamation in algebraic logic
inferred← citeshttps://doi.org/10.1007/bfb0043089openalex-snapshot
Noncommutative cylindric algebras and relativizations of cylindric algebras
inferred← citeshttps://doi.org/10.1007/pl00022469openalex-snapshot
Equational fragments of systems for arithmetic
inferred← citeshttps://doi.org/10.1007/s00012-004-1807-yopenalex-snapshot
On amalgamation of reducts of polyadic algebras
inferred← citeshttps://doi.org/10.1007/s00012-005-1916-2openalex-snapshot
Many-valued relation algebras
inferred← citeshttps://doi.org/10.1007/s00012-007-1999-zopenalex-snapshot
Connections between quasi-projective relation algebras and cylindric algebras
inferred← citeshttps://doi.org/10.1007/s00012-007-2055-8openalex-snapshot
Representable semilattice-ordered monoids
inferred← citeshttps://doi.org/10.1007/s00012-009-0022-2openalex-snapshot
Epimorphisms in cylindric algebras and definability in finite variable logic
inferred← citeshttps://doi.org/10.1007/s00012-010-0062-7openalex-snapshot
Some results about neat reducts
inferred← citeshttps://doi.org/10.1007/s00012-010-0068-1openalex-snapshot
Equationally distinct countable simple Q-relation algebras
inferred← citeshttps://doi.org/10.1007/s00012-012-0215-yopenalex-snapshot
Relation algebras as expanded FL-algebras
inferred← citeshttps://doi.org/10.1007/s00012-014-0270-7openalex-snapshot
Lattices of equivalence relations closed under the operations of relation algebras
inferred← citeshttps://doi.org/10.1007/s00012-014-0313-0openalex-snapshot
On Varieties of Groupoids of Relations with Operation of Binary Cylindrification
inferred← citeshttps://doi.org/10.1007/s00012-016-0367-2openalex-snapshot
Formalizing first-order logic in the equational theory of 3-dimensional diagonal-free cylindric algebras
inferred← citeshttps://doi.org/10.1007/s00165-016-0369-zopenalex-snapshot
Constraint logic programming with a relational machine
inferred← citeshttps://doi.org/10.1007/s001659970001openalex-snapshot
A Nitpick Analysis of Mobile IPv6
inferred← citeshttps://doi.org/10.1007/s00224-008-9151-9openalex-snapshot
Axiomatizing the Logical Core of XPath 2.0
inferred← citeshttps://doi.org/10.1007/s00233-006-0002-1openalex-snapshot
The Word Problem for Relatively Free Semigroups
inferred← citeshttps://doi.org/10.1007/s00233-025-10531-4openalex-snapshot
Minimal signatures with undecidability of representability by binary relations
inferred← citeshttps://doi.org/10.1007/s00236-009-0109-4openalex-snapshot
Embedding mappings and splittings with applications
inferred← citeshttps://doi.org/10.1007/s10462-004-5899-8openalex-snapshot
Relation Algebras and their Application in Temporal and Spatial Reasoning
inferred← citeshttps://doi.org/10.1007/s10472-013-9346-xopenalex-snapshot
The impact of transitive closure on the expressiveness of navigational query languages on unlabeled graphs
inferred← citeshttps://doi.org/10.1007/s10472-021-09760-4openalex-snapshot
On matrices and K-relations
inferred← citeshttps://doi.org/10.1007/s10703-010-0100-2openalex-snapshot
Pointfree expression and calculation: from quantification to temporal logic
inferred← citeshttps://doi.org/10.1007/s10817-006-9062-xopenalex-snapshot
The Calculus of Relations as a Foundation for Mathematics
inferred← citeshttps://doi.org/10.1007/s10817-012-9272-3openalex-snapshot
Set Graphs. III. Proof Pearl: Claw-Free Graphs Mirrored into Transitive Hereditarily Finite Sets
inferred← citeshttps://doi.org/10.1007/s10817-021-09599-8openalex-snapshot
Distilling the Requirements of Gödel’s Incompleteness Theorems with a Proof Assistant
inferred← citeshttps://doi.org/10.1007/s10992-006-9043-xopenalex-snapshot
On Fork Arrow Logic and its Expressive Power
inferred← citeshttps://doi.org/10.1007/s11225-009-9162-9openalex-snapshot
Weakly higher order cylindric algebras and finite axiomatization of the representables
inferred← citeshttps://doi.org/10.1007/s11225-016-9660-5openalex-snapshot
A Theory of Infinitary Relations Extending Zermelo’s Theory of Infinitary Propositions
inferred← citeshttps://doi.org/10.1007/s11225-023-10093-yopenalex-snapshot
Variations on the Kripke Trick
inferred← citeshttps://doi.org/10.1007/s11225-024-10125-1openalex-snapshot
Logic Families
inferred← citeshttps://doi.org/10.1007/s11229-005-3720-0openalex-snapshot
ON TARSKI?S ASSUMPTIONS
inferred← citeshttps://doi.org/10.1007/s11229-015-0689-1openalex-snapshot
Complexity of equational theory of relational algebras with standard projection elements
inferred← citeshttps://doi.org/10.1007/s11229-017-1447-3openalex-snapshot
Extensionality and logicality
inferred← citeshttps://doi.org/10.1007/s11229-025-05347-2openalex-snapshot
A quasi-set theory without atoms and its application to a quantum ontology of properties
inferred← citeshttps://doi.org/10.1007/s11787-014-0107-3openalex-snapshot
The Scope of Gödel’s First Incompleteness Theorem
inferred← citeshttps://doi.org/10.1007/s11787-022-00295-8openalex-snapshot
A Universal Algebraic Set Theory Built on Mereology with Applications
inferred← citeshttps://doi.org/10.1016/0004-3702(96)00004-5openalex-snapshot
On the relative expressiveness of description logics and predicate logics
inferred← citeshttps://doi.org/10.1016/0168-0072(87)90019-4openalex-snapshot
On varieties of cylindric algebras with applications to logic
inferred← citeshttps://doi.org/10.1016/0304-3975(95)00082-8openalex-snapshot
Relation-algebraic semantics
inferred← citeshttps://doi.org/10.1016/0747-7171(92)90013-topenalex-snapshot
A field guide to equational logic
inferred← citeshttps://doi.org/10.1016/0898-1221(92)90146-9openalex-snapshot
Subsumption computed algebraically
inferred← citeshttps://doi.org/10.1016/b978-0-444-51621-3.50008-6openalex-snapshot
Alternative Set Theories
inferred← citeshttps://doi.org/10.1016/j.aim.2019.01.014openalex-snapshot
The finitely axiomatizable complete theories of non-associative arrow frames
inferred← citeshttps://doi.org/10.1016/j.apal.2003.11.011openalex-snapshot
Finite, integral, and finite-dimensional relation algebras: a brief history
inferred← citeshttps://doi.org/10.1016/j.apal.2013.06.003openalex-snapshot
Relational dual tableau decision procedures and their applications to modal and intuitionistic logics
inferred← citeshttps://doi.org/10.1016/j.apal.2017.07.003openalex-snapshot
A computational glimpse at the Leibniz and Frege hierarchies
inferred← citeshttps://doi.org/10.1016/j.apal.2018.06.002openalex-snapshot
A representation theorem for measurable relation algebras
inferred← citeshttps://doi.org/10.1016/j.apal.2022.103100openalex-snapshot
Complexity in the interdefinability of timelike, lightlike and spacelike relatedness of Minkowski spacetime
inferred← citeshttps://doi.org/10.1016/j.apal.2026.103728openalex-snapshot
The relational quotient completion
inferred← citeshttps://doi.org/10.1016/j.apal.2026.103811openalex-snapshot
Superintuitionistic predicate logics of linear Kripke frames: undecidability with two individual variables
inferred← citeshttps://doi.org/10.1016/j.disc.2016.06.019openalex-snapshot
Cardinality of relations with applications
inferred← citeshttps://doi.org/10.1016/j.endm.2013.05.141openalex-snapshot
Sets of Transformations as Criteria of Diversity within Sets of Objects
inferred← citeshttps://doi.org/10.1016/j.entcs.2006.05.046openalex-snapshot
Reasoning with Graphs
inferred← citeshttps://doi.org/10.1016/j.ic.2008.11.004openalex-snapshot
On graph reasoning
inferred← citeshttps://doi.org/10.1016/j.ins.2014.11.031openalex-snapshot
Relative expressive power of navigational querying on graphs
inferred← citeshttps://doi.org/10.1016/j.is.2019.101467openalex-snapshot
Comparing the expressiveness of downward fragments of the relation algebra with transitive closure on trees
inferred← citeshttps://doi.org/10.1016/j.jal.2009.09.002openalex-snapshot
Complete axiomatizations for XPath fragments
inferred← citeshttps://doi.org/10.1016/j.jcss.2015.10.002openalex-snapshot
Structural characterizations of the navigational expressiveness of relation algebras on a tree
inferred← citeshttps://doi.org/10.1016/j.jlamp.2014.08.003openalex-snapshot
Combining relation algebra and data refinement to develop rectangle-based functional programs for reflexive–transitive closures
inferred← citeshttps://doi.org/10.1016/j.jlamp.2015.12.001openalex-snapshot
Cardinality of relations and relational approximation algorithms
inferred← citeshttps://doi.org/10.1016/j.jlamp.2016.01.001openalex-snapshot
Why mathematics needs engineering
inferred← citeshttps://doi.org/10.1016/j.jlamp.2017.04.001openalex-snapshot
Using relation-algebraic means and tool support for investigating and computing bipartitions
inferred← citeshttps://doi.org/10.1016/j.jlamp.2018.09.004openalex-snapshot
Cryptomorphic topological structures: A computational, relation-algebraic approach
inferred← citeshttps://doi.org/10.1016/j.jlamp.2022.100760openalex-snapshot
Expressive power and succinctness of the positive calculus of binary relations
inferred← citeshttps://doi.org/10.1016/j.jlap.2004.01.007openalex-snapshot
The converse of a stochastic relation
inferred← citeshttps://doi.org/10.1016/j.jlap.2005.04.005openalex-snapshot
Interpretability of first-order linear temporal logics in fork algebras
inferred← citeshttps://doi.org/10.1016/j.jlap.2011.04.007openalex-snapshot
Contact, closure, topology, and the linking of row and column types of relations
inferred← citeshttps://doi.org/10.1016/j.jlap.2012.05.003openalex-snapshot
Programming from Galois connections
inferred← citeshttps://doi.org/10.1016/j.jlap.2014.02.013openalex-snapshot
A relation-algebraic approach to the “Hoare logic” of functional dependencies
inferred← citeshttps://doi.org/10.1016/j.jmp.2005.10.001openalex-snapshot
All you ever wanted to know about meaningfulness
inferred← citeshttps://doi.org/10.1016/j.joems.2011.08.002openalex-snapshot
New perspectives in algebraic logic, from neat embeddings to Erdos graphs
inferred← citeshttps://doi.org/10.1016/j.jsc.2008.04.005openalex-snapshot
State space analysis of Petri nets with relation-algebraic methods
inferred← citeshttps://doi.org/10.1016/j.scico.2008.08.002openalex-snapshot
A note on proofs with graphs
inferred← citeshttps://doi.org/10.1016/j.scico.2012.07.012openalex-snapshot
Typing linear algebra: A biproduct-oriented approach
inferred← citeshttps://doi.org/10.1016/j.tcs.2003.09.001openalex-snapshot
ER modelling from first relational principles
inferred← citeshttps://doi.org/10.1016/j.tcs.2004.03.028openalex-snapshot
Three-variable statements of set-pairing
inferred← citeshttps://doi.org/10.1016/j.tcs.2006.03.023openalex-snapshot
Normal forms for binary relations
inferred← citeshttps://doi.org/10.1016/s0004-3702(03)00137-1openalex-snapshot
Composing cardinal direction relations
inferred← citeshttps://doi.org/10.1016/s0049-237x(03)80019-8openalex-snapshot
Bibliography
inferred← citeshttps://doi.org/10.1016/s0049-237x(08)70274-xopenalex-snapshot
Logical Partial Functions and Extensions of Equational Logic
inferred← citeshttps://doi.org/10.1016/s0168-0072(01)00054-9openalex-snapshot
Finite methods in 1-order formalisms
showing the first 200 of 398 · page through all 398
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.