| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Bruce Bates, Martin W. Bunder, Keith P. Tognetti |
Child's addition in the Stern-Brocot tree.  |
Eur. J. Comb.  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Bruce Bates, Martin W. Bunder, Keith P. Tognetti |
Linking the Calkin-Wilf and Stern-Brocot trees. |
Eur. J. Comb. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Bruce Bates, Martin W. Bunder, Keith P. Tognetti |
Locating terms in the Stern-Brocot tree. |
Eur. J. Comb. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin W. Bunder, R. M. Rizkalla |
Proof-finding Algorithms for Classical and Subclassical Propositional Logics. |
Notre Dame Journal of Formal Logic |
2009 |
DBLP BibTeX RDF |
|
| 1 | Martin W. Bunder, Keith P. Tognetti, Glen E. Wheeler |
On binary reflected Gray codes and functions. |
Discrete Mathematics |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin W. Bunder, Wil Dekkers |
Are there Hilbert-style Pure Type Systems? |
Logical Methods in Computer Science |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin W. Bunder, Mohua Banerjee, Mihir K. Chakraborty |
Some Rough Consequence Logics and their Interrelations. |
T. Rough Sets |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin W. Bunder |
The Inhabitation Problem for Intersection Types. |
CATS |
2008 |
DBLP BibTeX RDF |
|
| 1 | Martin W. Bunder, Wil Dekkers |
Are there Hilbert-style Pure Type Systems? |
CoRR |
2007 |
DBLP BibTeX RDF |
|
| 1 | Martin W. Bunder, W. J. M. Dekkers |
Equivalences between Pure Type Systems and Systems of Illative Combinatory Logic. |
Notre Dame Journal of Formal Logic |
2005 |
DBLP BibTeX RDF |
|
| 1 | Jianyong Huang, Jennifer Seberry, Willy Susilo, Martin W. Bunder |
Security Analysis of Michael: The IEEE 802.11i Message Integrity Code. |
EUC Workshops |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin W. Bunder, Jonathan P. Seldin |
Variants of the basic calculus of constructions. |
J. Applied Logic |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin W. Bunder |
Intersection types for lambda-terms and combinators and their logics. |
Logic Journal of the IGPL |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin W. Bunder |
A Classification of Intersection Type Systems. |
J. Symb. Log. |
2002 |
DBLP BibTeX RDF |
|
| 1 | Martin W. Bunder, Keith P. Tognetti |
On the self matching properties of [j tau]. |
Discrete Mathematics |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin W. Bunder, Wil Dekkers |
Pure Type Systems with More Liberal Rules. |
J. Symb. Log. |
2001 |
DBLP BibTeX RDF |
|
| 1 | Martin W. Bunder |
Proof finding algorithms for implicational logics. |
Theor. Comput. Sci. |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin W. Bunder |
Expedited Broda-Damas Bracket Abstraction. |
J. Symb. Log. |
2000 |
DBLP BibTeX RDF |
|
| 1 | Wil Dekkers, Martin W. Bunder, Henk Barendregt |
Completeness of the Propositions-as-Types Interpretation of Intuitionistic Logic into Illative Combinatory Logic. |
J. Symb. Log. |
1998 |
DBLP BibTeX RDF |
|
| 1 | Wil Dekkers, Martin W. Bunder, Henk Barendregt |
Completeness of two systems of illative combinatory logic for first-order propositional and predicate calculus. |
Arch. Math. Log. |
1998 |
DBLP DOI BibTeX RDF |
Mathematics Subject Classification:03B40 |
| 1 | Martin W. Bunder |
Lambda Terms Definable as Combinators. |
Theor. Comput. Sci. |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin W. Bunder, J. Roger Hindley |
Two beta-Equal lambda-I-Terms with no Types in Common. |
Theor. Comput. Sci. |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Norman D. Megill, Martin W. Bunder |
Weaker D-Complete Logics. |
Logic Journal of the IGPL |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin W. Bunder |
A Simplified Form of Condensed Detachment. |
Journal of Logic, Language and Information |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | P. Trigg, J. Roger Hindley, Martin W. Bunder |
Combinatory Abstraction Bsing B, B' and Friends. |
Theor. Comput. Sci. |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Henk Barendregt, Martin W. Bunder, Wil Dekkers |
Systems of Illative Combinatory Logic Complete for First-Order Propositional and Predicate Calculus. |
J. Symb. Log. |
1993 |
DBLP BibTeX RDF |
|
| 1 | Robert K. Meyer, Martin W. Bunder, Lawrence Powers |
Implementing the `Fool's Model' of Combinatory Logic. |
J. Autom. Reasoning |
1991 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin W. Bunder |
Some Improvements to Turner's Algorithm for Bracket Abstraction. |
J. Symb. Log. |
1990 |
DBLP BibTeX RDF |
|
| 1 | Martin W. Bunder, J. Roger Hindley, Jonathan P. Seldin |
On Adding (xi) to Weak Equality in Combinatory Logic. |
J. Symb. Log. |
1989 |
DBLP BibTeX RDF |
|
| 1 | Martin W. Bunder |
Some Consistency Proofs and a Characterization of Inconsistency Proofs in Illative Combinatory Logic. |
J. Symb. Log. |
1987 |
DBLP BibTeX RDF |
|
| 1 | Martin W. Bunder |
Possible Forms of Evaluation or Reduction in Martin-Löf Type Theory. |
Theor. Comput. Sci. |
1985 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin W. Bunder |
An Extension of Klop's Counterexample to the Church-Rosser Property to lambda-Calculus with other Ordered Pair Combinators. |
Theor. Comput. Sci. |
1985 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin W. Bunder |
A Weak Absolute Consistency Proof for Some Systems of Illative Combinatory Logic. |
J. Symb. Log. |
1983 |
DBLP BibTeX RDF |
|
| 1 | Martin W. Bunder, Jonathan P. Seldin |
Some Anomalies in Fitch's System QD. |
J. Symb. Log. |
1978 |
DBLP BibTeX RDF |
|
| 1 | Martin W. Bunder, Robert K. Meyer |
On the Inconsistency of Systems Similar to F * 21. |
J. Symb. Log. |
1978 |
DBLP BibTeX RDF |
|
| 1 | Martin W. Bunder |
Consistency Notions in Illative Combinatory Logic. |
J. Symb. Log. |
1977 |
DBLP BibTeX RDF |
|
| 1 | Martin W. Bunder |
The Inconsistency of F * 21. |
J. Symb. Log. |
1976 |
DBLP BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")