default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMartin W. Bunder
Person information
- affiliation: University of Wollongong, NSW, Australia
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2019
[j62]Martin W. Bunder:
Alternative Solutions to Linear Recurrence Equations. Integers 19: A65 (2019)- 2018
- [j61]Martin W. Bunder, Abderrahmane Nitaj, Willy Susilo
, Joseph Tonien:
Cryptanalysis of RSA-type cryptosystems based on Lucas sequences, Gaussian integers and elliptic curves. J. Inf. Secur. Appl. 40: 193-198 (2018) - 2017
- [j60]Martin W. Bunder, Abderrahmane Nitaj, Willy Susilo, Joseph Tonien:
A generalized attack on RSA type cryptosystems. Theor. Comput. Sci. 704: 74-81 (2017) - [i2]Martin W. Bunder, Abderrahmane Nitaj, Willy Susilo, Joseph Tonien:
A generalized attack on RSA type cryptosystems. IACR Cryptol. ePrint Arch. 2017: 1076 (2017) - 2016
- [c3]Martin W. Bunder, Abderrahmane Nitaj, Willy Susilo, Joseph Tonien:
A New Attack on Three Variants of the RSA Cryptosystem. ACISP (2) 2016: 258-268 - 2012
- [j59]Bruce Bates, Martin W. Bunder, Keith P. Tognetti:
Child's addition in the Stern-Brocot tree. Eur. J. Comb. 33(2): 148-167 (2012) - 2010
- [j58]Bruce Bates, Martin W. Bunder, Keith P. Tognetti:
Locating terms in the Stern-Brocot tree. Eur. J. Comb. 31(3): 1020-1033 (2010) - [j57]Bruce Bates, Martin W. Bunder, Keith P. Tognetti:
Linking the Calkin-Wilf and Stern-Brocot trees. Eur. J. Comb. 31(7): 1637-1661 (2010)
2000 – 2009
- 2009
- [j56]Martin W. Bunder, R. M. Rizkalla:
Proof-finding Algorithms for Classical and Subclassical Propositional Logics. Notre Dame J. Formal Log. 50(3): 261-273 (2009) - 2008
- [j55]Martin W. Bunder, Keith P. Tognetti, Glen E. Wheeler:
On binary reflected Gray codes and functions. Discret. Math. 308(9): 1690-1700 (2008) - [j54]Martin W. Bunder, Wil Dekkers:
Are there Hilbert-style Pure Type Systems? Log. Methods Comput. Sci. 4(1) (2008) - [j53]Martin W. Bunder, Mohua Banerjee, Mihir K. Chakraborty:
Some Rough Consequence Logics and their Interrelations. Trans. Rough Sets 8: 1-20 (2008) - [c2]Martin W. Bunder:
The Inhabitation Problem for Intersection Types. CATS 2008: 7-14 - 2007
- [i1]Martin W. Bunder, Wil Dekkers:
Are there Hilbert-style Pure Type Systems? CoRR abs/0707.0890 (2007) - 2005
- [j52]Martin W. Bunder, W. J. M. Dekkers:
Equivalences between Pure Type Systems and Systems of Illative Combinatory Logic. Notre Dame J. Formal Log. 46(2): 181-205 (2005) - [c1]Jianyong Huang, Jennifer Seberry, Willy Susilo, Martin W. Bunder:
Security Analysis of Michael: The IEEE 802.11i Message Integrity Code. EUC Workshops 2005: 423-432 - 2004
- [j51]Martin W. Bunder, Jonathan P. Seldin:
Variants of the basic calculus of constructions. J. Appl. Log. 2(2): 191-217 (2004) - 2002
- [j50]Martin W. Bunder:
Intersection types for lambda-terms and combinators and their logics. Log. J. IGPL 10(4): 357-378 (2002) - [j49]Martin W. Bunder:
A Classification of Intersection Type Systems. J. Symb. Log. 67(1): 353-368 (2002) - 2001
- [j48]Martin W. Bunder, Keith P. Tognetti:
On the self matching properties of [j tau]. Discret. Math. 241(1-3): 139-151 (2001) - [j47]Martin W. Bunder, Wil Dekkers:
Pure Type Systems with More Liberal Rules. J. Symb. Log. 66(4): 1561-1580 (2001) - 2000
- [j46]Martin W. Bunder:
Expedited Broda-Damas Bracket Abstraction. J. Symb. Log. 65(4): 1850-1857 (2000) - [j45]Martin W. Bunder:
Proof finding algorithms for implicational logics. Theor. Comput. Sci. 232(1-2): 165-186 (2000)
1990 – 1999
- 1998
- [j44]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. 37(5-6): 327-341 (1998) - [j43]Wil Dekkers, Martin W. Bunder, Henk Barendregt:
Completeness of the Propositions-as-Types Interpretation of Intuitionistic Logic into Illative Combinatory Logic. J. Symb. Log. 63(3): 869-890 (1998) - 1996
- [j42]Norman D. Megill, Martin W. Bunder:
Weaker D-Complete Logics. Log. J. IGPL 4(2): 215-225 (1996) - [j41]Martin W. Bunder, J. Roger Hindley:
Two beta-Equal lambda-I-Terms with no Types in Common. Theor. Comput. Sci. 155(1): 265-266 (1996) - [j40]Martin W. Bunder:
Lambda Terms Definable as Combinators. Theor. Comput. Sci. 169(1): 3-21 (1996) - 1995
- [j39]Martin W. Bunder:
A Simplified Form of Condensed Detachment. J. Log. Lang. Inf. 4(2): 169-173 (1995) - 1994
- [j38]P. Trigg, J. Roger Hindley, Martin W. Bunder:
Combinatory Abstraction Bsing B, B' and Friends. Theor. Comput. Sci. 135(2): 405-422 (1994) - 1993
- [j37]Henk Barendregt, Martin W. Bunder, Wil Dekkers:
Systems of Illative Combinatory Logic Complete for First-Order Propositional and Predicate Calculus. J. Symb. Log. 58(3): 769-788 (1993) - 1991
- [j36]Robert K. Meyer, Martin W. Bunder, Lawrence Powers:
Implementing the 'Fool's Model' of Combinatory Logic. J. Autom. Reason. 7(4): 597-630 (1991) - 1990
- [j35]Martin W. Bunder:
Some Improvements to Turner's Algorithm for Bracket Abstraction. J. Symb. Log. 55(2): 656-669 (1990)
1980 – 1989
- 1989
- [j34]Martin W. Bunder, J. Roger Hindley, Jonathan P. Seldin:
On Adding (xi) to Weak Equality in Combinatory Logic. J. Symb. Log. 54(2): 590-607 (1989) - 1988
- [j33]Martin W. Bunder:
Arithmetic based on the Church numerals in illative combinatory logic. Stud Logica 47(2): 129-143 (1988) - 1987
- [j32]Martin W. Bunder:
Some generalizations to two systems of set theory based on combinatory logic. Arch. Math. Log. 26(1): 5-12 (1987) - [j31]Martin W. Bunder:
Some Consistency Proofs and a Characterization of Inconsistency Proofs in Illative Combinatory Logic. J. Symb. Log. 52(1): 89-110 (1987) - 1985
- [j30]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. 39: 337-342 (1985) - [j29]Martin W. Bunder:
Possible Forms of Evaluation or Reduction in Martin-Löf Type Theory. Theor. Comput. Sci. 41: 113-120 (1985) - 1984
- [j28]Martin W. Bunder:
Category theory based on combinatory logic. Arch. Math. Log. 24(1): 1-16 (1984) - 1983
- [j27]Martin W. Bunder:
Predicate calculus of arbitrarily high finite order. Arch. Math. Log. 23(1): 1-10 (1983) - [j26]Martin W. Bunder:
A one axiom set theory based on higher order predicate calculus. Arch. Math. Log. 23(1): 99-107 (1983) - [j25]Martin W. Bunder:
Set theory in predicate calculus with equality. Arch. Math. Log. 23(1): 109-113 (1983) - [j24]Martin W. Bunder:
A Weak Absolute Consistency Proof for Some Systems of Illative Combinatory Logic. J. Symb. Log. 48(3): 771-776 (1983) - 1982
- [j23]Martin W. Bunder:
Some Results in Aczel-Feferman Logic and Set Theory. Math. Log. Q. 28(19): 269-276 (1982) - [j22]Martin W. Bunder:
Illative combinatory logic without equality as a primitive predicate. Notre Dame J. Formal Log. 23(1): 62-70 (1982) - 1981
- [j21]Martin W. Bunder:
Predicate calculus and naive set theory in pure combinatory logic. Arch. Math. Log. 21(1): 169-177 (1981) - 1980
- [j20]Martin W. Bunder:
Significance and illative combinatory logics. Notre Dame J. Formal Log. 21(2): 380-384 (1980)
1970 – 1979
- 1979
- [j19]Martin W. Bunder:
On the equivalence of systems of rules and systems of axioms in illative combinatory logic. Notre Dame J. Formal Log. 20(3): 603-608 (1979) - [j18]Martin W. Bunder:
Scott's models and illative combinatory logic. Notre Dame J. Formal Log. 20(3): 609-612 (1979) - [j17]Martin W. Bunder:
Alternative forms of propositional calculus for a given deduction theorem. Notre Dame J. Formal Log. 20(3): 613-619 (1979) - [j16]Martin W. Bunder:
Generalized restricted generality. Notre Dame J. Formal Log. 20(3): 620-624 (1979) - [j15]Martin W. Bunder:
Λ-elimination in illative combinatory logic. Notre Dame J. Formal Log. 20(3): 628-630 (1979) - [j14]Martin W. Bunder:
Deduction theorems in significance logics. Notre Dame J. Formal Log. 20(3): 695-700 (1979) - [j13]Martin W. Bunder:
A more relevant relevance logic. Notre Dame J. Formal Log. 20(3): 701-704 (1979) - [j12]Martin W. Bunder:
Variable binding term operators in λ-calculus. Notre Dame J. Formal Log. 20(4): 876-878 (1979) - 1978
- [j11]Martin W. Bunder, Robert K. Meyer:
On the Inconsistency of Systems Similar to F * 21. J. Symb. Log. 43(1): 1-2 (1978) - [j10]Martin W. Bunder, Jonathan P. Seldin:
Some Anomalies in Fitch's System QD. J. Symb. Log. 43(2): 247-249 (1978) - [j9]Martin W. Bunder:
Equality in. Math. Log. Q. 24(8): 125-127 (1978) - 1977
- [j8]Martin W. Bunder:
Consistency Notions in Illative Combinatory Logic. J. Symb. Log. 42(4): 527-529 (1977) - 1976
- [j7]Martin W. Bunder:
The Inconsistency of F * 21. J. Symb. Log. 41(2): 467-468 (1976) - [j6]Martin W. Bunder:
Some notes on: "A deduction theorem for restricted generality". Notre Dame J. Formal Log. 17(1): 153-154 (1976) - 1974
- [j5]Martin W. Bunder:
Propositional and predicate calculuses based on combinatory logic. Notre Dame J. Formal Log. 15(1): 25-34 (1974) - [j4]Martin W. Bunder:
Various systems of set theory based on combinatory logic. Notre Dame J. Formal Log. 15(2): 192-206 (1974) - 1973
- [j3]Martin W. Bunder:
A generalised Kleene-Rosser paradox for a system containing the combinator K. Notre Dame J. Formal Log. 14(1): 53-54 (1973) - [j2]Martin W. Bunder:
A deduction theorem for restricted generality. Notre Dame J. Formal Log. 14(3): 341-346 (1973) - 1970
- [j1]Martin W. Bunder:
A paradox in illative combinatory logic. Notre Dame J. Formal Log. 11(4): 467-470 (1970)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-21 00:10 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
