According to our database
1,
Martin W. Bunder
authored at least 65 papers
between 1970 and 2019.
Collaborative distances:
2019
Alternative Solutions to Linear Recurrence Equations.
Integers, 2019
2018
Cryptanalysis of RSA-type cryptosystems based on Lucas sequences, Gaussian integers and elliptic curves.
J. Inf. Secur. Appl., 2018
2017
A generalized attack on RSA type cryptosystems.
Theor. Comput. Sci., 2017
2016
A New Attack on Three Variants of the RSA Cryptosystem.
Proceedings of the Information Security and Privacy - 21st Australasian Conference, 2016
2012
Child's addition in the Stern-Brocot tree.
Eur. J. Comb., 2012
2010
Linking the Calkin-Wilf and Stern-Brocot trees.
Eur. J. Comb., 2010
Locating terms in the Stern-Brocot tree.
Eur. J. Comb., 2010
2009
Proof-finding Algorithms for Classical and Subclassical Propositional Logics.
Notre Dame J. Formal Log., 2009
2008
Some Rough Consequence Logics and their Interrelations.
Trans. Rough Sets, 2008
Are there Hilbert-style Pure Type Systems?
Log. Methods Comput. Sci., 2008
On binary reflected Gray codes and functions.
Discret. Math., 2008
The Inhabitation Problem for Intersection Types.
Proceedings of the Theory of Computing 2008. Proc. Fourteenth Computing: The Australasian Theory Symposium (CATS 2008), 2008
2005
Equivalences between Pure Type Systems and Systems of Illative Combinatory Logic.
Notre Dame J. Formal Log., 2005
Security Analysis of Michael: The IEEE 802.11i Message Integrity Code.
Proceedings of the Embedded and Ubiquitous Computing - EUC 2005 Workshops, 2005
2004
Variants of the basic calculus of constructions.
J. Appl. Log., 2004
2002
A Classification of Intersection Type Systems.
J. Symb. Log., 2002
Intersection types for lambda-terms and combinators and their logics.
Log. J. IGPL, 2002
2001
Pure Type Systems with More Liberal Rules.
J. Symb. Log., 2001
On the self matching properties of [j tau].
Discret. Math., 2001
2000
Proof finding algorithms for implicational logics.
Theor. Comput. Sci., 2000
Expedited Broda-Damas Bracket Abstraction.
J. Symb. Log., 2000
1998
Completeness of the Propositions-as-Types Interpretation of Intuitionistic Logic into Illative Combinatory Logic.
J. Symb. Log., 1998
Completeness of two systems of illative combinatory logic for first-order propositional and predicate calculus.
Arch. Math. Log., 1998
1996
Two beta-Equal lambda-I-Terms with no Types in Common.
Theor. Comput. Sci., 1996
Lambda Terms Definable as Combinators.
Theor. Comput. Sci., 1996
Weaker D-Complete Logics.
Log. J. IGPL, 1996
1995
A Simplified Form of Condensed Detachment.
J. Log. Lang. Inf., 1995
1994
Combinatory Abstraction Bsing B, B' and Friends.
Theor. Comput. Sci., 1994
1993
Systems of Illative Combinatory Logic Complete for First-Order Propositional and Predicate Calculus.
J. Symb. Log., 1993
1991
Implementing the 'Fool's Model' of Combinatory Logic.
J. Autom. Reason., 1991
1990
Some Improvements to Turner's Algorithm for Bracket Abstraction.
J. Symb. Log., 1990
1989
On Adding (xi) to Weak Equality in Combinatory Logic.
J. Symb. Log., 1989
1988
Arithmetic based on the Church numerals in illative combinatory logic.
Stud Logica, 1988
1987
Some Consistency Proofs and a Characterization of Inconsistency Proofs in Illative Combinatory Logic.
J. Symb. Log., 1987
Some generalizations to two systems of set theory based on combinatory logic.
Arch. Math. Log., 1987
1985
Possible Forms of Evaluation or Reduction in Martin-Löf Type Theory.
Theor. Comput. Sci., 1985
An Extension of Klop's Counterexample to the Church-Rosser Property to lambda-Calculus with other Ordered Pair Combinators.
Theor. Comput. Sci., 1985
1984
Category theory based on combinatory logic.
Arch. Math. Log., 1984
1983
A Weak Absolute Consistency Proof for Some Systems of Illative Combinatory Logic.
J. Symb. Log., 1983
Set theory in predicate calculus with equality.
Arch. Math. Log., 1983
A one axiom set theory based on higher order predicate calculus.
Arch. Math. Log., 1983
Predicate calculus of arbitrarily high finite order.
Arch. Math. Log., 1983
1982
Illative combinatory logic without equality as a primitive predicate.
Notre Dame J. Formal Log., 1982
Some Results in Aczel-Feferman Logic and Set Theory.
Math. Log. Q., 1982
1981
Predicate calculus and naive set theory in pure combinatory logic.
Arch. Math. Log., 1981
1980
Significance and illative combinatory logics.
Notre Dame J. Formal Log., 1980
1979
Variable binding term operators in λ-calculus.
Notre Dame J. Formal Log., 1979
A more relevant relevance logic.
Notre Dame J. Formal Log., 1979
Deduction theorems in significance logics.
Notre Dame J. Formal Log., 1979
Λ-elimination in illative combinatory logic.
Notre Dame J. Formal Log., 1979
Generalized restricted generality.
Notre Dame J. Formal Log., 1979
Alternative forms of propositional calculus for a given deduction theorem.
Notre Dame J. Formal Log., 1979
Scott's models and illative combinatory logic.
Notre Dame J. Formal Log., 1979
On the equivalence of systems of rules and systems of axioms in illative combinatory logic.
Notre Dame J. Formal Log., 1979
1978
Some Anomalies in Fitch's System QD.
J. Symb. Log., 1978
On the Inconsistency of Systems Similar to F <sup>*</sup> <sub> 21</sub>.
J. Symb. Log., 1978
1977
Consistency Notions in Illative Combinatory Logic.
J. Symb. Log., 1977
1976
Some notes on: "A deduction theorem for restricted generality".
Notre Dame J. Formal Log., 1976
The Inconsistency of F <sup>*</sup> <sub>21</sub>.
J. Symb. Log., 1976
1974
Various systems of set theory based on combinatory logic.
Notre Dame J. Formal Log., 1974
Propositional and predicate calculuses based on combinatory logic.
Notre Dame J. Formal Log., 1974
1973
A deduction theorem for restricted generality.
Notre Dame J. Formal Log., 1973
A generalised Kleene-Rosser paradox for a system containing the combinator K.
Notre Dame J. Formal Log., 1973
1970
A paradox in illative combinatory logic.
Notre Dame J. Formal Log., 1970
