The following pages link to Martin W. Bunder (Q591019):
Displayed 50 items.
- Scott's models and illative combinatory logic (Q1234673) (← links)
- Generalised restricted generality (Q1240223) (← links)
- \(\land\)-elimination in illative combinatory logic (Q1252225) (← links)
- Significance and illative combinatory logics (Q1252226) (← links)
- Deduction theorems in significance logics (Q1252227) (← links)
- A more relevant relevance logic (Q1252228) (← links)
- \(\Lambda\)-elimination in illative combinatory logic (Q1257463) (← links)
- A conservative extension of a formal arithmetic (Q1264136) (← links)
- Completeness of two systems of illative combinatory logic for first-order propositional and predicate calculus (Q1267843) (← links)
- BCK and BCI logics, condensed detachment and the 2-property (Q1309333) (← links)
- Set-theoretical and other elementary models of the \(\lambda\)-calculus (Q1314361) (← links)
- Some examples of non-existent combinators (Q1314364) (← links)
- On a property of BCK-identities (Q1327482) (← links)
- Combinatory abstraction using \({\mathbf B}\), \({\mathbf B}^ \prime\) and friends (Q1346635) (← links)
- Lambda terms definable as combinators (Q1349878) (← links)
- The ``relevance'' of intersection and union types (Q1381437) (← links)
- A conjecture on numeral systems (Q1381438) (← links)
- Proof finding algorithms for implicational logics (Q1575928) (← links)
- A generalized attack on RSA type cryptosystems (Q1680536) (← links)
- Some results on extensionality in lambda calculus (Q1765154) (← links)
- Combining classical logic, paraconsistency and relevance (Q1775868) (← links)
- Combinator logics (Q1826366) (← links)
- Semantics for dual and symmetric combinatory calculi (Q1826434) (← links)
- Analytic combinatory calculi and the elimination of transitivity (Q1879319) (← links)
- Variants of the basic calculus of constructions (Q1885480) (← links)
- A simplified form of condensed detachment (Q1903086) (← links)
- The shortest possible length of the longest implicational axiom (Q1914373) (← links)
- A reduction rule for Peirce formula (Q1919985) (← links)
- On the harmonic continued fractions (Q2319931) (← links)
- Formal metatheory of the lambda calculus using Stoughton's substitution (Q2358702) (← links)
- On binary reflected Gray codes and functions (Q2477394) (← links)
- Typing in reflective combinatory logic (Q2498910) (← links)
- A paradox in illative combinatory logic (Q2536053) (← links)
- A generalised Kleene-Rosser paradox for a system containing the combinator K (Q2539864) (← links)
- A deduction theorem for restricted generality (Q2539865) (← links)
- The finite model property for BCI and related systems (Q2563452) (← links)
- Equivalences between pure type systems and systems of illative combinatory logic (Q2565990) (← links)
- Remarks on applicative theories (Q2566067) (← links)
- An upper bound for reduction sequences in the typed \(\lambda\)-calculus (Q2639840) (← links)
- Inductive types and type constraints in the second-order lambda calculus (Q2639842) (← links)
- Combinatory logic and the semantics of substructural logics (Q2642518) (← links)
- Expedited Broda-Damas bracket abstraction (Q2710613) (← links)
- A New Attack on Three Variants of the RSA Cryptosystem (Q2817817) (← links)
- (Q2874755) (← links)
- A weak absolute consistency proof for some systems of illative combinatory logic (Q3043111) (← links)
- Some improvements to Turner's algorithm for bracket abstraction (Q3199391) (← links)
- (Q3220556) (← links)
- (Q3221967) (← links)
- (Q3222161) (← links)
- (Q3222844) (← links)