Martin W. Bunder - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 65 from 65

2019

Alternative Solutions to Linear Recurrence EquationsMartin W. Bunder. int, 19, 2019. [doi]

2018

Cryptanalysis of RSA-type cryptosystems based on Lucas sequences, Gaussian integers and elliptic curvesMartin W. Bunder, Abderrahmane Nitaj, Willy Susilo, Joseph Tonien. istr, 40:193-198, 2018. [doi]

2017

A generalized attack on RSA type cryptosystemsMartin W. Bunder, Abderrahmane Nitaj, Willy Susilo, Joseph Tonien. iacr, 2017:1076, 2017. [doi]

A generalized attack on RSA type cryptosystemsMartin W. Bunder, Abderrahmane Nitaj, Willy Susilo, Joseph Tonien. TCS, 704:74-81, 2017. [doi]

2016

A New Attack on Three Variants of the RSA CryptosystemMartin W. Bunder, Abderrahmane Nitaj, Willy Susilo, Joseph Tonien. acisp 2016: 258-268 [doi]

2012

Child's addition in the Stern-Brocot treeBruce Bates, Martin W. Bunder, Keith P. Tognetti. ejc, 33(2):148-167, 2012. [doi]

2010

Linking the Calkin-Wilf and Stern-Brocot treesBruce Bates, Martin W. Bunder, Keith P. Tognetti. ejc, 31(7):1637-1661, 2010. [doi]

Locating terms in the Stern-Brocot treeBruce Bates, Martin W. Bunder, Keith P. Tognetti. ejc, 31(3):1020-1033, 2010. [doi]

2009

Proof-finding Algorithms for Classical and Subclassical Propositional LogicsMartin W. Bunder, R. M. Rizkalla. ndjfl, 50(3):261-273, 2009. [doi]

2008

2005

Equivalences between Pure Type Systems and Systems of Illative Combinatory LogicMartin W. Bunder, W. J. M. Dekkers. ndjfl, 46(2):181-205, 2005. [doi]

Security Analysis of Michael: The IEEE 802.11i Message Integrity CodeJianyong Huang, Jennifer Seberry, Willy Susilo, Martin W. Bunder. euc 2005: 423-432 [doi]

2004

Variants of the basic calculus of constructionsMartin W. Bunder, Jonathan P. Seldin. japll, 2(2):191-217, 2004. [doi]

2002

A Classification of Intersection Type SystemsMartin W. Bunder. JSYML, 67(1):353-368, 2002.

Intersection types for lambda-terms and combinators and their logicsMartin W. Bunder. igpl, 10(4):357-378, 2002. [doi]

2001

Pure Type Systems with More Liberal RulesMartin W. Bunder, Wil Dekkers. JSYML, 66(4):1561-1580, 2001.

On the self matching properties of [j tau]Martin W. Bunder, Keith P. Tognetti. DM, 241(1-3):139-151, 2001. [doi]

2000

Proof finding algorithms for implicational logicsMartin W. Bunder. TCS, 232(1-2):165-186, 2000. [doi]

Expedited Broda-Damas Bracket AbstractionMartin W. Bunder. JSYML, 65(4):1850-1857, 2000.

1998

Completeness of the Propositions-as-Types Interpretation of Intuitionistic Logic into Illative Combinatory LogicWil Dekkers, Martin W. Bunder, Henk Barendregt. JSYML, 63(3):869-890, 1998.

Completeness of two systems of illative combinatory logic for first-order propositional and predicate calculusWil Dekkers, Martin W. Bunder, Henk Barendregt. AML, 37(5-6):327-341, 1998. [doi]

1996

Lambda Terms Definable as CombinatorsMartin W. Bunder. TCS, 169(1):3-21, 1996. [doi]

Two beta-Equal lambda-I-Terms with no Types in CommonMartin W. Bunder, J. Roger Hindley. TCS, 155(1):265-266, 1996. [doi]

Weaker D-Complete LogicsNorman D. Megill, Martin W. Bunder. igpl, 4(2):215-225, 1996. [doi]

1995

A Simplified Form of Condensed DetachmentMartin W. Bunder. jolli, 4(2):169-173, 1995.

1994

Combinatory Abstraction Bsing B, B and FriendsP. Trigg, J. Roger Hindley, Martin W. Bunder. TCS, 135(2):405-422, 1994.

1993

Systems of Illative Combinatory Logic Complete for First-Order Propositional and Predicate CalculusHenk Barendregt, Martin W. Bunder, Wil Dekkers. JSYML, 58(3):769-788, 1993.

1991

Implementing the Fool s Model of Combinatory LogicRobert K. Meyer, Martin W. Bunder, Lawrence Powers. JAR, 7(4):597-630, 1991.

1990

Some Improvements to Turner s Algorithm for Bracket AbstractionMartin W. Bunder. JSYML, 55(2):656-669, 1990.

1989

On Adding (xi) to Weak Equality in Combinatory LogicMartin W. Bunder, J. Roger Hindley, Jonathan P. Seldin. JSYML, 54(2):590-607, 1989.

1988

Arithmetic based on the Church numerals in illative combinatory logicMartin W. Bunder. sLogica, 47(2):129-143, 1988. [doi]

1987

Some Consistency Proofs and a Characterization of Inconsistency Proofs in Illative Combinatory LogicMartin W. Bunder. JSYML, 52(1):89-110, 1987.

Some generalizations to two systems of set theory based on combinatory logicMartin W. Bunder. AML, 26(1):5-12, 1987. [doi]

1985

An Extension of Klop s Counterexample to the Church-Rosser Property to lambda-Calculus with other Ordered Pair CombinatorsMartin W. Bunder. TCS, 39:337-342, 1985.

Possible Forms of Evaluation or Reduction in Martin-Löf Type TheoryMartin W. Bunder. TCS, 41:113-120, 1985.

1984

Category theory based on combinatory logicMartin W. Bunder. AML, 24(1):1-16, 1984. [doi]

1983

A Weak Absolute Consistency Proof for Some Systems of Illative Combinatory LogicMartin W. Bunder. JSYML, 48(3):771-776, 1983.

Predicate calculus of arbitrarily high finite orderMartin W. Bunder. AML, 23(1):1-10, 1983. [doi]

A one axiom set theory based on higher order predicate calculusMartin W. Bunder. AML, 23(1):99-107, 1983. [doi]

Set theory in predicate calculus with equalityMartin W. Bunder. AML, 23(1):109-113, 1983. [doi]

1982

Illative combinatory logic without equality as a primitive predicateMartin W. Bunder. ndjfl, 23(1):62-70, 1982. [doi]

Some Results in Aczel-Feferman Logic and Set TheoryMartin W. Bunder. mlq, 28(19):269-276, 1982. [doi]

1981

Predicate calculus and naive set theory in pure combinatory logicMartin W. Bunder. AML, 21(1):169-177, 1981. [doi]

1980

Significance and illative combinatory logicsMartin W. Bunder. ndjfl, 21(2):380-384, 1980. [doi]

1979

On the equivalence of systems of rules and systems of axioms in illative combinatory logicMartin W. Bunder. ndjfl, 20(3):603-608, 1979. [doi]

Λ-elimination in illative combinatory logicMartin W. Bunder. ndjfl, 20(3):628-630, 1979. [doi]

Scott's models and illative combinatory logicMartin W. Bunder. ndjfl, 20(3):609-612, 1979. [doi]

Variable binding term operators in λ-calculusMartin W. Bunder. ndjfl, 20(4):876-878, 1979. [doi]

Deduction theorems in significance logicsMartin W. Bunder. ndjfl, 20(3):695-700, 1979. [doi]

A more relevant relevance logicMartin W. Bunder. ndjfl, 20(3):701-704, 1979. [doi]

Alternative forms of propositional calculus for a given deduction theoremMartin W. Bunder. ndjfl, 20(3):613-619, 1979. [doi]

Generalized restricted generalityMartin W. Bunder. ndjfl, 20(3):620-624, 1979. [doi]

1978

Some Anomalies in Fitch s System QDMartin W. Bunder, Jonathan P. Seldin. JSYML, 43(2):247-249, 1978.

Equality inMartin W. Bunder. mlq, 24(8):125-127, 1978. [doi]

1977

Consistency Notions in Illative Combinatory LogicMartin W. Bunder. JSYML, 42(4):527-529, 1977.

1976

The Inconsistency of F :::*::: ::21::Martin W. Bunder. JSYML, 41(2):467-468, 1976.

Some notes on: "A deduction theorem for restricted generality"Martin W. Bunder. ndjfl, 17(1):153-154, 1976. [doi]

1974

Propositional and predicate calculuses based on combinatory logicMartin W. Bunder. ndjfl, 15(1):25-34, 1974. [doi]

Various systems of set theory based on combinatory logicMartin W. Bunder. ndjfl, 15(2):192-206, 1974. [doi]

1973

A generalised Kleene-Rosser paradox for a system containing the combinator KMartin W. Bunder. ndjfl, 14(1):53-54, 1973. [doi]

A deduction theorem for restricted generalityMartin W. Bunder. ndjfl, 14(3):341-346, 1973. [doi]

1970

A paradox in illative combinatory logicMartin W. Bunder. ndjfl, 11(4):467-470, 1970. [doi]

Sign in or sign up to see more results.

runs on WebDSL