scientific article; zbMATH DE number 193143
From MaRDI portal
Publication:4040000
Recommendations
Cited in
(only showing first 100 items - show all)- Weakly higher order cylindric algebras and finite axiomatization of the representables
- Epimorphisms in cylindric algebras and definability in finite variable logic
- Isomorphic but not base-isomorphic base-minimal cylindric set algebras
- Some quantifiers require two-predicate scopes
- On varieties of cylindric algebras with applications to logic
- Algebraization of quantifier logics, an introductory overview
- Discriminator varieties and symbolic computation
- A field guide to equational logic
- Subsumption computed algebraically
- Some sufficient conditions for the representability of relation algebras
- Modal languages and bounded fragments of predicate logic
- Unifying threads in Alfred Tarski's work
- A perspective on the theory of relation algebras
- Relation-algebraic semantics
- Parallel constructions of maximal path sets and applications to short superstrings
- Complexity of equations valid in algebras of relations. I: Strong non-finitizability
- A short proof of representability of fork algebras
- A calculational approach to mathematical induction
- Squares in fork arrow logic
- A proof system for contact relation algebras
- Finite mathematics.
- Cryptomorphic topological structures: a computational, relation-algebraic approach
- A computational glimpse at the Leibniz and Frege hierarchies
- The finitely axiomatizable complete theories of non-associative arrow frames
- The converse of a stochastic relation
- A representation theorem for measurable relation algebras
- Compiling dyadic first-order specifications into map algebra
- ER modelling from first relational principles
- Three-variable statements of set-pairing
- The equational theory of union-free algebras of relations
- Some lattice models of bilinear logic
- A finitely axiomatized formalization of predicate calculus with equality
- Taming logic
- The combinatorial degrees of proofs and equations
- Programming from Galois connections
- Relation algebras as expanded FL-algebras
- Monomorphic characterization of n-ary direct products
- On equational theories of varieties of anticommutative rings
- Distilling the requirements of Gödel's incompleteness theorems with a proof assistant
- Complexity in the interdefinability of timelike, lightlike and spacelike relatedness of Minkowski spacetime
- Expressive power and succinctness of the positive calculus of binary relations
- A universal algebraic set theory built on mereology with applications
- The scope of Gödel's first incompleteness theorem
- The impact of transitive closure on the expressiveness of navigational query languages on unlabeled graphs
- On varieties of groupoids of relations with operation of binary cylindrification.
- Axiomatizing the logical core of XPath 2.0
- Modalities for an allegorical conceptual data model
- Weak \(n\)-ary relational products in allegories
- Combining relation algebra and data refinement to develop rectangle-based functional programs for reflexive-transitive closures
- Set graphs. III: Proof pearl: Claw-free graphs mirrored into transitive hereditarily finite sets
- Using relation-algebraic means and tool support for investigating and computing bipartitions
- Why mathematics needs engineering
- On Tarski's assumptions
- The axiom scheme of acyclic comprehension
- Lattices of equivalence relations closed under the operations of relation algebras
- On fork arrow logic and its expressive power
- Normal forms for binary relations
- State space analysis of Petri nets with relation-algebraic methods
- On the relative expressiveness of description logics and predicate logics
- Extensionality and logicality
- Computational complexity of theories of a binary predicate with a small number of variables
- Representability is not decidable for finite relation algebras
- Formalizing first-order logic in the equational theory of 3-dimensional diagonal-free cylindric algebras
- Existential-import mathematics
- Cardinalities of Finite Relations in Coq
- A theory of infinitary relations extending Zermelo's theory of infinitary propositions
- A graphical representation of relational formulae with complementation
- Relation Algebras, Matrices, and Multi-valued Decision Diagrams
- Column-wise extendible vector expressions and the relational computation of sets of sets
- Declarative compilation for constraint logic programming
- To found or not to found? That is the question!
- Weak representations of relation algebras and relational bases
- The Neat Embedding Problem and the Number of Variables Required in Proofs
- On the positive calculus of relations with transitive closure
- Nonrepresentable relation algebras from groups
- Addition and multiplication of sets
- On Automating the Calculus of Relations
- RELEVANCE LOGIC AND THE CALCULUS OF RELATIONS
- Weakly associative relation algebras with projections
- Logical Foundations of XML and XQuery
- Omitting types for algebraizable extensions of first order logic
- An efficient relational deductive system for propositional non-classical logics
- A Completeness Theorem for Trigonometric Identities and Various Results on Exponential Functions
- What are logical notions?
- Computing and visualizing Banks sets of dominance relations using relation algebra and RelView
- Relational dual tableau decision procedures and their applications to modal and intuitionistic logics
- Pair-Dense Relation Algebras
- scientific article; zbMATH DE number 175751 (Why is no real title available?)
- A relation-algebraic approach to the ``Hoare logic of functional dependencies
- Primitive recursion, equality, and a universal set
- scientific article; zbMATH DE number 1953886 (Why is no real title available?)
- New perspectives in algebraic logic, from neat embeddings to Erdős graphs
- Tarski's influence on computer science
- The absence of multiple universes of discourse in the 1936 Tarski consequence-definition paper
- The variety of coset relation algebras
- Binary Relations and Permutation Groups
- Cylindric modal logic
- Solvable set/hyperset contexts: I. Some decision procedures for the pure, finite case
- A completeness result for relation algebra with binders
- Reasoning with graphs
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4040000)
