scientific article
From MaRDI portal
Publication:4040000
zbMath0654.03036MaRDI QIDQ4040000
Publication date: 5 June 1993
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Research exposition (monographs, survey articles) pertaining to mathematical logic and foundations (03-02) Axiomatics of classical set theory and its fragments (03E30)
Related Items
An equational logic sampler, Unnamed Item, RELEVANCE LOGICS AND RELATION ALGEBRAS, Binary Relations and Permutation Groups, Cylindric modal logic, What are logical notions?, Expressive Power and Succinctness of the Positive Calculus of Relations, FIRST-ORDER AXIOMATISATIONS OF REPRESENTABLE RELATION ALGEBRAS NEED FORMULAS OF UNBOUNDED QUANTIFIER DEPTH, Seurat games on Stockmeyer graphs, Бинарный предикат, транзитивное замыкание, две-три переменные: сыграем в домино?, Primitive recursion, equality, and a universal set, Dependences between domain constructions in heterogeneous relation algebras, Implication algebras and implication semigroups of binary relations, ON TARSKI’S AXIOMATIC FOUNDATIONS OF THE CALCULUS OF RELATIONS, Tarski’s Influence on Computer Science, The Absence of Multiple Universes of Discourse in the 1936 Tarski Consequence-Definition Paper, Solvable set/hyperset contexts: I. Some decision procedures for the pure, finite case, THE VARIETY OF COSET RELATION ALGEBRAS, TWO-VARIABLE LOGIC HAS WEAK, BUT NOT STRONG, BETH DEFINABILITY, The axiom of elementary sets on the edge of Peircean expressibility, Pair-Dense Relation Algebras, A Completeness Result for Relation Algebra with Binders, Reasoning with Graphs, Goals and benchmarks for automated map reasoning, An Agg Application Supporting Visual Reasoning1, Free algebras in discriminator varieties, Layered map reasoning, Completeness of a relational calculus for program schemes, A relation-algebraic approach to the region connection calculus, Extended Static Checking by Calculation Using the Pointfree Transform, Unnamed Item, Unnamed Item, Relation algebras from cylindric algebras. I, Relation algebras from cylindric algebras. II, Finite methods in 1-order formalisms, Cylindric structures and dependencies in relational databases, Cardinality of relations and relational approximation algorithms, Weakly associative relation algebras with projections, On matrices and \(K\)-relations, 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, RALL: Machine-supported proofs for relation algebra, Logic and Sets, On the Semilattice of Modal Operators and Decompositions of the Discriminator, Undecidability of Algebras of Binary Relations, Freeing Structural Realism from Model Theory, Tarskian Classical Relevant Logic, Implicative filters in quasi-ordered residuated systems, Weak implicative filters in quasi-ordered residuated systems, Procedures of Leibnizian infinitesimal calculus: an account in three modern frameworks, Complexity in the interdefinability of timelike, lightlike and spacelike relatedness of Minkowski spacetime, A perspective on the theory of relation algebras, Using relation-algebraic means and tool support for investigating and computing bipartitions, Formalizing first-order logic in the equational theory of 3-dimensional diagonal-free cylindric algebras, A graphical representation of relational formulae with complementation, A theory of infinitary relations extending Zermelo's theory of infinitary propositions, ER modelling from first relational principles, Three-variable statements of set-pairing, Isomorphic but not base-isomorphic base-minimal cylindric set algebras, Some quantifiers require two-predicate scopes, Cryptomorphic topological structures: a computational, relation-algebraic approach, Why mathematics needs engineering, Weak representations of relation algebras and relational bases, Expressive power and succinctness of the positive calculus of binary relations, Unnamed Item, The equational theory of union-free algebras of relations, Relation-algebraic semantics, On varieties of cylindric algebras with applications to logic, On Tarski's assumptions, Relation Algebras, Matrices, and Multi-valued Decision Diagrams, Some lattice models of bilinear logic, A finitely axiomatized formalization of predicate calculus with equality, Parallel constructions of maximal path sets and applications to short superstrings, Taming logic, A universal algebraic set theory built on mereology with applications, Finite, integral, and finite-dimensional relation algebras: A brief history, Complexity of equations valid in algebras of relations. I: Strong non-finitizability, The combinatorial degrees of proofs and equations, The calculus of relations as a foundation for mathematics, Column-Wise Extendible Vector Expressions and the Relational Computation of Sets of Sets, A computational glimpse at the Leibniz and Frege hierarchies, Equationally distinct countable simple {\textsf{Q}}-relation algebras, 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, A short proof of representability of fork algebras, On the relative expressiveness of description logics and predicate logics, A calculational approach to mathematical induction, Declarative Compilation for Constraint Logic Programming, Programming from Galois connections, A relation-algebraic approach to the ``Hoare logic of functional dependencies, Relation algebras as expanded FL-algebras, Structural characterizations of the navigational expressiveness of relation algebras on a tree, Squares in fork arrow logic, Pointfree expression and calculation: From quantification to temporal logic, 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, New perspectives in algebraic logic, from neat embeddings to Erdős graphs, The axiom scheme of acyclic comprehension, Monomorphic characterization of \(n\)-ary direct products, To found or not to found? That is the question!, On equational theories of varieties of anticommutative rings, Lattices of equivalence relations closed under the operations of relation algebras, On Automating the Calculus of Relations, On fork arrow logic and its expressive power, The finitely axiomatizable complete theories of non-associative arrow frames, RELEVANCE LOGIC AND THE CALCULUS OF RELATIONS, Algebraization of quantifier logics, an introductory overview, The \(k\)-variable property is stronger than H-dimension \(k\), Discriminator varieties and symbolic computation, Constraint logic programming with a relational machine, Complexity of equational theory of relational algebras with standard projection elements, A field guide to equational logic, Subsumption computed algebraically, Relative expressive power of navigational querying on graphs, 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., Embedding mappings and splittings with applications, The converse of a stochastic relation, Contact, closure, topology, and the linking of row and column types of relations, Complete axiomatizations for XPath fragments, Axiomatizing the logical core of XPath 2.0, Normal forms for binary relations, Some results about neat reducts, EXISTENTIAL-IMPORT MATHEMATICS, A representation theorem for measurable relation algebras, On graph reasoning, Some sufficient conditions for the representability of relation algebras, Weakly higher order cylindric algebras and finite axiomatization of the representables, Cardinality of relations with applications, State space analysis of Petri nets with relation-algebraic methods, The Neat Embedding Problem and the Number of Variables Required in Proofs, Distilling the requirements of Gödel's incompleteness theorems with a proof assistant, Modal languages and bounded fragments of predicate logic, NONREPRESENTABLE RELATION ALGEBRAS FROM GROUPS, Cardinalities of Finite Relations in Coq, Unifying threads in Alfred Tarski's work, A proof system for contact relation algebras, Finite mathematics., Epimorphisms in cylindric algebras and definability in finite variable logic, Addition and multiplication of sets, 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, A portrait of Alfred Tarski, Set graphs. III: Proof pearl: Claw-free graphs mirrored into transitive hereditarily finite sets, Composing cardinal direction relations, Compiling dyadic first-order specifications into map algebra, Interpretability of first-order linear temporal logics in fork algebras
