Publication:4040000
From MaRDI portal
zbMath0654.03036MaRDI QIDQ4040000
Publication date: 5 June 1993
03-02: Research exposition (monographs, survey articles) pertaining to mathematical logic and foundations
03E30: Axiomatics of classical set theory and its fragments
Related Items
Unnamed Item, Primitive recursion, equality, and a universal set, Binary Relations and Permutation Groups, Cylindric modal logic, Solvable set/hyperset contexts: I. Some decision procedures for the pure, finite case, The axiom of elementary sets on the edge of Peircean expressibility, Goals and benchmarks for automated map reasoning, Free algebras in discriminator varieties, Completeness of a relational calculus for program schemes, A relation-algebraic approach to the region connection calculus, 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, Finite, integral, and finite-dimensional relation algebras: A brief history, The \(k\)-variable property is stronger than H-dimension \(k\), A portrait of Alfred Tarski, Composing cardinal direction relations, Interpretability of first-order linear temporal logics in fork algebras, The calculus of relations as a foundation for mathematics, Weakly higher order cylindric algebras and finite axiomatization of the representables, 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., The converse of a stochastic relation, 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, Monomorphic characterization of \(n\)-ary direct products, On equational theories of varieties of anticommutative rings, On Tarski's assumptions, On fork arrow logic and its expressive power, Normal forms for binary relations, State space analysis of Petri nets with relation-algebraic methods, Representability is not decidable for finite relation algebras, The Neat Embedding Problem and the Number of Variables Required in Proofs, Addition and multiplication of sets, On Automating the Calculus of Relations, What are logical notions?, Pair-Dense Relation Algebras
