The following pages link to (Q4040000):
Displayed 50 items.
- Finite, integral, and finite-dimensional relation algebras: A brief history (Q598305) (← links)
- The \(k\)-variable property is stronger than H-dimension \(k\) (Q676186) (← links)
- A portrait of Alfred Tarski (Q809989) (← links)
- Composing cardinal direction relations (Q814537) (← links)
- Interpretability of first-order linear temporal logics in fork algebras (Q817582) (← links)
- The calculus of relations as a foundation for mathematics (Q877838) (← links)
- Weakly higher order cylindric algebras and finite axiomatization of the representables (Q1005971) (← links)
- Isomorphic but not base-isomorphic base-minimal cylindric set algebras (Q1089337) (← links)
- Some quantifiers require two-predicate scopes (Q1090330) (← links)
- On varieties of cylindric algebras with applications to logic (Q1098852) (← links)
- Algebraization of quantifier logics, an introductory overview (Q1189899) (← links)
- Discriminator varieties and symbolic computation (Q1190748) (← links)
- A field guide to equational logic (Q1201350) (← links)
- Subsumption computed algebraically (Q1202639) (← links)
- Some sufficient conditions for the representability of relation algebras (Q1249576) (← links)
- Modal languages and bounded fragments of predicate logic (Q1267082) (← links)
- Unifying threads in Alfred Tarski's work (Q1286341) (← links)
- A perspective on the theory of relation algebras (Q1327468) (← links)
- Relation-algebraic semantics (Q1350513) (← links)
- Parallel constructions of maximal path sets and applications to short superstrings (Q1366535) (← links)
- Complexity of equations valid in algebras of relations. I: Strong non-finitizability (Q1377625) (← links)
- A short proof of representability of fork algebras (Q1389659) (← links)
- A calculational approach to mathematical induction (Q1391737) (← links)
- Squares in fork arrow logic (Q1402582) (← links)
- A proof system for contact relation algebras (Q1576385) (← links)
- Finite mathematics. (Q1578768) (← links)
- The converse of a stochastic relation (Q1764800) (← links)
- Compiling dyadic first-order specifications into map algebra (Q1870581) (← links)
- ER modelling from first relational principles (Q1884937) (← links)
- Three-variable statements of set-pairing (Q1885036) (← links)
- The equational theory of union-free algebras of relations (Q1894553) (← links)
- Some lattice models of bilinear logic (Q1906000) (← links)
- A finitely axiomatized formalization of predicate calculus with equality (Q1906674) (← links)
- Taming logic (Q1909607) (← links)
- The combinatorial degrees of proofs and equations (Q1918969) (← links)
- Monomorphic characterization of \(n\)-ary direct products (Q1961870) (← links)
- On equational theories of varieties of anticommutative rings (Q1966192) (← links)
- On Tarski's assumptions (Q2386111) (← links)
- On fork arrow logic and its expressive power (Q2454871) (← links)
- Normal forms for binary relations (Q2503327) (← links)
- State space analysis of Petri nets with relation-algebraic methods (Q2518607) (← links)
- Representability is not decidable for finite relation algebras (Q2701663) (← links)
- The Neat Embedding Problem and the Number of Variables Required in Proofs (Q3204457) (← links)
- Addition and multiplication of sets (Q3423150) (← links)
- On Automating the Calculus of Relations (Q3541686) (← links)
- What are logical notions? (Q3758801) (← links)
- Pair-Dense Relation Algebras (Q3985845) (← links)
- Primitive recursion, equality, and a universal set (Q4322431) (← links)
- (Q4415070) (← links)
- Binary Relations and Permutation Groups (Q4835524) (← links)