The following pages link to Equational Bases for If–Then–Else (Q3801055):
Displaying 12 items.
- Adas and the equational theory of if-then-else (Q690107) (← links)
- Data types over multiple-valued logics (Q752687) (← links)
- A transformational characterization of if-then-else (Q913480) (← links)
- Discriminator varieties and symbolic computation (Q1190748) (← links)
- Reduction of Hilbert-type proof systems to the if-then-else equational logic (Q1428985) (← links)
- Monoids of non-halting programs with tests (Q1646607) (← links)
- Monoids with tests and the algebra of possibly non-halting programs (Q2258843) (← links)
- On algebraic specifications of computable algebras with the discriminator technique (Q3358246) (← links)
- (Q3801512) (← links)
- Boolean product representations of algebras via binary polynomials (Q4586422) (← links)
- Axiomatization of <tt>if-then-else</tt> over possibly non-halting programs and tests (Q5269894) (← links)
- SEMIGROUPS WITH if–then–else AND HALTING PROGRAMS (Q5850783) (← links)
