Martin W. Bunder

According to our database, Martin W. Bunder authored at least 65 papers between 1970 and 2019.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2019

Alternative Solutions to Linear Recurrence Equations.

Martin W. Bunder

Integers, 2019

2018

Cryptanalysis of RSA-type cryptosystems based on Lucas sequences, Gaussian integers and elliptic curves.

Martin W. Bunder, Abderrahmane Nitaj, Willy Susilo, Joseph Tonien

J. Inf. Secur. Appl., 2018

2017

A generalized attack on RSA type cryptosystems.

Martin W. Bunder, Abderrahmane Nitaj, Willy Susilo, Joseph Tonien

Theor. Comput. Sci., 2017

2016

A New Attack on Three Variants of the RSA Cryptosystem.

Martin W. Bunder, Abderrahmane Nitaj, Willy Susilo, Joseph Tonien

Proceedings of the Information Security and Privacy - 21st Australasian Conference, 2016

2012

Child's addition in the Stern-Brocot tree.

Bruce Bates, Martin W. Bunder, Keith P. Tognetti

Eur. J. Comb., 2012

2010

Linking the Calkin-Wilf and Stern-Brocot trees.

Bruce Bates, Martin W. Bunder, Keith P. Tognetti

Eur. J. Comb., 2010

Locating terms in the Stern-Brocot tree.

Bruce Bates, Martin W. Bunder, Keith P. Tognetti

Eur. J. Comb., 2010

2009

Proof-finding Algorithms for Classical and Subclassical Propositional Logics.

Martin W. Bunder, R. M. Rizkalla

Notre Dame J. Formal Log., 2009

2008

Some Rough Consequence Logics and their Interrelations.

Martin W. Bunder, Mohua Banerjee, Mihir K. Chakraborty

Trans. Rough Sets, 2008

Are there Hilbert-style Pure Type Systems?

Martin W. Bunder, Wil Dekkers

Log. Methods Comput. Sci., 2008

On binary reflected Gray codes and functions.

Martin W. Bunder, Keith P. Tognetti, Glen E. Wheeler

Discret. Math., 2008

The Inhabitation Problem for Intersection Types.

Martin W. Bunder

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.

Martin W. Bunder, W. J. M. Dekkers

Notre Dame J. Formal Log., 2005

Security Analysis of Michael: The IEEE 802.11i Message Integrity Code.

Jianyong Huang, Jennifer Seberry, Willy Susilo, Martin W. Bunder

Proceedings of the Embedded and Ubiquitous Computing - EUC 2005 Workshops, 2005

2004

Variants of the basic calculus of constructions.

Martin W. Bunder, Jonathan P. Seldin

J. Appl. Log., 2004

2002

A Classification of Intersection Type Systems.

Martin W. Bunder

J. Symb. Log., 2002

Intersection types for lambda-terms and combinators and their logics.

Martin W. Bunder

Log. J. IGPL, 2002

2001

Pure Type Systems with More Liberal Rules.

Martin W. Bunder, Wil Dekkers

J. Symb. Log., 2001

On the self matching properties of [j tau].

Martin W. Bunder, Keith P. Tognetti

Discret. Math., 2001

2000

Proof finding algorithms for implicational logics.

Martin W. Bunder

Theor. Comput. Sci., 2000

Expedited Broda-Damas Bracket Abstraction.

Martin W. Bunder

J. Symb. Log., 2000

1998

Completeness of the Propositions-as-Types Interpretation of Intuitionistic Logic into Illative Combinatory Logic.

Wil Dekkers, Martin W. Bunder, Henk Barendregt

J. Symb. Log., 1998

Completeness of two systems of illative combinatory logic for first-order propositional and predicate calculus.

Wil Dekkers, Martin W. Bunder, Henk Barendregt

Arch. Math. Log., 1998

1996

Two beta-Equal lambda-I-Terms with no Types in Common.

Martin W. Bunder, J. Roger Hindley

Theor. Comput. Sci., 1996

Lambda Terms Definable as Combinators.

Martin W. Bunder

Theor. Comput. Sci., 1996

Weaker D-Complete Logics.

Norman D. Megill, Martin W. Bunder

Log. J. IGPL, 1996

1995

A Simplified Form of Condensed Detachment.

Martin W. Bunder

J. Log. Lang. Inf., 1995

1994

Combinatory Abstraction Bsing B, B' and Friends.

P. Trigg, J. Roger Hindley, Martin W. Bunder

Theor. Comput. Sci., 1994

1993

Systems of Illative Combinatory Logic Complete for First-Order Propositional and Predicate Calculus.

Henk Barendregt, Martin W. Bunder, Wil Dekkers

J. Symb. Log., 1993

1991

Implementing the 'Fool's Model' of Combinatory Logic.

Robert K. Meyer, Martin W. Bunder, Lawrence Powers

J. Autom. Reason., 1991

1990

Some Improvements to Turner's Algorithm for Bracket Abstraction.

Martin W. Bunder

J. Symb. Log., 1990

1989

On Adding (xi) to Weak Equality in Combinatory Logic.

Martin W. Bunder, J. Roger Hindley, Jonathan P. Seldin

J. Symb. Log., 1989

1988

Arithmetic based on the Church numerals in illative combinatory logic.

Martin W. Bunder

Stud Logica, 1988

1987

Some Consistency Proofs and a Characterization of Inconsistency Proofs in Illative Combinatory Logic.

Martin W. Bunder

J. Symb. Log., 1987

Some generalizations to two systems of set theory based on combinatory logic.

Martin W. Bunder

Arch. Math. Log., 1987

1985

Possible Forms of Evaluation or Reduction in Martin-Löf Type Theory.

Martin W. Bunder

Theor. Comput. Sci., 1985

An Extension of Klop's Counterexample to the Church-Rosser Property to lambda-Calculus with other Ordered Pair Combinators.

Martin W. Bunder

Theor. Comput. Sci., 1985

1984

Category theory based on combinatory logic.

Martin W. Bunder

Arch. Math. Log., 1984

1983

A Weak Absolute Consistency Proof for Some Systems of Illative Combinatory Logic.

Martin W. Bunder

J. Symb. Log., 1983

Set theory in predicate calculus with equality.

Martin W. Bunder

Arch. Math. Log., 1983

A one axiom set theory based on higher order predicate calculus.

Martin W. Bunder

Arch. Math. Log., 1983

Predicate calculus of arbitrarily high finite order.

Martin W. Bunder

Arch. Math. Log., 1983

1982

Illative combinatory logic without equality as a primitive predicate.

Martin W. Bunder

Notre Dame J. Formal Log., 1982

Some Results in Aczel-Feferman Logic and Set Theory.

Martin W. Bunder

Math. Log. Q., 1982

1981

Predicate calculus and naive set theory in pure combinatory logic.

Martin W. Bunder

Arch. Math. Log., 1981

1980

Significance and illative combinatory logics.

Martin W. Bunder

Notre Dame J. Formal Log., 1980

1979

Variable binding term operators in λ-calculus.

Martin W. Bunder

Notre Dame J. Formal Log., 1979

A more relevant relevance logic.

Martin W. Bunder

Notre Dame J. Formal Log., 1979

Deduction theorems in significance logics.

Martin W. Bunder

Notre Dame J. Formal Log., 1979

Λ-elimination in illative combinatory logic.

Martin W. Bunder

Notre Dame J. Formal Log., 1979

Generalized restricted generality.

Martin W. Bunder

Notre Dame J. Formal Log., 1979

Alternative forms of propositional calculus for a given deduction theorem.

Martin W. Bunder

Notre Dame J. Formal Log., 1979

Scott's models and illative combinatory logic.

Martin W. Bunder

Notre Dame J. Formal Log., 1979

On the equivalence of systems of rules and systems of axioms in illative combinatory logic.

Martin W. Bunder

Notre Dame J. Formal Log., 1979

1978

Equality in.

Martin W. Bunder

Math. Log. Q., 1978

Some Anomalies in Fitch's System QD.

Martin W. Bunder, Jonathan P. Seldin

J. Symb. Log., 1978

On the Inconsistency of Systems Similar to F ^* ₂₁.

Martin W. Bunder, Robert K. Meyer

J. Symb. Log., 1978

1977

Consistency Notions in Illative Combinatory Logic.

Martin W. Bunder

J. Symb. Log., 1977

1976

Some notes on: "A deduction theorem for restricted generality".

Martin W. Bunder

Notre Dame J. Formal Log., 1976

The Inconsistency of F ^* ₂₁.

Martin W. Bunder

J. Symb. Log., 1976

1974

Various systems of set theory based on combinatory logic.

Martin W. Bunder

Notre Dame J. Formal Log., 1974

Propositional and predicate calculuses based on combinatory logic.

Martin W. Bunder

Notre Dame J. Formal Log., 1974

1973

A deduction theorem for restricted generality.

Martin W. Bunder

Notre Dame J. Formal Log., 1973

A generalised Kleene-Rosser paradox for a system containing the combinator K.

Martin W. Bunder

Notre Dame J. Formal Log., 1973

1970

A paradox in illative combinatory logic.

Martin W. Bunder

Notre Dame J. Formal Log., 1970