Martin W. Bunder

71 papers Journal 68Unranked 3

Year	Rank	Type	Title / Venue / Authors
2022	J	`jnl`	BCI-Algebras and Related Logics. Australas. J. Log. Martin W. Bunder
2019	J	`jnl`	Alternative Solutions to Linear Recurrence Equations. Integers Martin W. Bunder
2018	J	`jnl`	Cryptanalysis of RSA-type cryptosystems based on Lucas sequences, Gaussian integers and elliptic curves. J. Inf. Secur. Appl. Martin W. Bunder, Abderrahmane Nitaj, Willy Susilo, Joseph Tonien
2017	J	`jnl`	A generalized attack on RSA type cryptosystems. IACR Cryptol. ePrint Arch. Martin W. Bunder, Abderrahmane Nitaj, Willy Susilo, Joseph Tonien
2017	J	`jnl`	A generalized attack on RSA type cryptosystems. Theor. Comput. Sci. Martin W. Bunder, Abderrahmane Nitaj, Willy Susilo, Joseph Tonien
2016	—	`conf`	A New Attack on Three Variants of the RSA Cryptosystem. ACISP (2) Martin W. Bunder, Abderrahmane Nitaj, Willy Susilo, Joseph Tonien
2015	J	`jnl`	Rough Consequence and other Modal Logics. Australas. J. Log. Martin W. Bunder
2012	J	`jnl`	Child's addition in the Stern-Brocot tree. Eur. J. Comb. Bruce Bates, Martin W. Bunder, Keith P. Tognetti
2010	J	`jnl`	Linking the Calkin-Wilf and Stern-Brocot trees. Eur. J. Comb. Bruce Bates, Martin W. Bunder, Keith P. Tognetti
2010	J	`jnl`	Locating terms in the Stern-Brocot tree. Eur. J. Comb. Bruce Bates, Martin W. Bunder, Keith P. Tognetti
2010	J	`jnl`	The D-Completeness of T→. Australas. J. Log. Robert K. Meyer, Martin W. Bunder
2009	J	`jnl`	Proof-finding Algorithms for Classical and Subclassical Propositional Logics. Notre Dame J. Formal Log. Martin W. Bunder, R. M. Rizkalla
2008	J	`jnl`	Are there Hilbert-style Pure Type Systems? Log. Methods Comput. Sci. Martin W. Bunder, Wil Dekkers
2008	J	`jnl`	On binary reflected Gray codes and functions. Discret. Math. Martin W. Bunder, Keith P. Tognetti, Glen E. Wheeler
2008	J	`jnl`	Some Rough Consequence Logics and their Interrelations. Trans. Rough Sets Martin W. Bunder, Mohua Banerjee, Mihir K. Chakraborty
2008	—	`conf`	The Inhabitation Problem for Intersection Types. CATS Martin W. Bunder
2007	J	`jnl`	Are there Hilbert-style Pure Type Systems? CoRR Martin W. Bunder, Wil Dekkers
2005	J	`jnl`	Equivalences between Pure Type Systems and Systems of Illative Combinatory Logic. Notre Dame J. Formal Log. Martin W. Bunder, W. J. M. Dekkers
2005	—	`conf`	Security Analysis of Michael: The IEEE 802.11i Message Integrity Code. EUC Workshops Jianyong Huang, Jennifer Seberry, Willy Susilo, Martin W. Bunder
2004	J	`jnl`	Variants of the basic calculus of constructions. J. Appl. Log. Martin W. Bunder, Jonathan P. Seldin
2003	J	`jnl`	Intersection Type Systems and Logics Related to the Meyer-Routley System B+. Australas. J. Log. Martin W. Bunder
2002	J	`jnl`	A Classification of Intersection Type Systems. J. Symb. Log. Martin W. Bunder
2002	J	`jnl`	Intersection types for lambda-terms and combinators and their logics. Log. J. IGPL Martin W. Bunder
2001	J	`jnl`	On the self matching properties of [j tau]. Discret. Math. Martin W. Bunder, Keith P. Tognetti
2001	J	`jnl`	Pure Type Systems with More Liberal Rules. J. Symb. Log. Martin W. Bunder, Wil Dekkers
2000	J	`jnl`	Expedited Broda-Damas Bracket Abstraction. J. Symb. Log. Martin W. Bunder
2000	J	`jnl`	Proof finding algorithms for implicational logics. Theor. Comput. Sci. Martin W. Bunder
1998	J	`jnl`	Completeness of the Propositions-as-Types Interpretation of Intuitionistic Logic into Illative Combinatory Logic. J. Symb. Log. Wil Dekkers, Martin W. Bunder, Henk Barendregt
1998	J	`jnl`	Completeness of two systems of illative combinatory logic for first-order propositional and predicate calculus. Arch. Math. Log. Wil Dekkers, Martin W. Bunder, Henk Barendregt
1996	J	`jnl`	Lambda Terms Definable as Combinators. Theor. Comput. Sci. Martin W. Bunder
1996	J	`jnl`	Two beta-Equal lambda-I-Terms with no Types in Common. Theor. Comput. Sci. Martin W. Bunder, J. Roger Hindley
1996	J	`jnl`	Weaker D-Complete Logics. Log. J. IGPL Norman D. Megill, Martin W. Bunder
1995	J	`jnl`	A Simplified Form of Condensed Detachment. J. Log. Lang. Inf. Martin W. Bunder
1994	J	`jnl`	Combinatory Abstraction Bsing B, B' and Friends. Theor. Comput. Sci. P. Trigg, J. Roger Hindley, Martin W. Bunder
1993	J	`jnl`	Systems of Illative Combinatory Logic Complete for First-Order Propositional and Predicate Calculus. J. Symb. Log. Henk Barendregt, Martin W. Bunder, Wil Dekkers
1991	J	`jnl`	Implementing the 'Fool's Model' of Combinatory Logic. J. Autom. Reason. Robert K. Meyer, Martin W. Bunder, Lawrence Powers
1990	J	`jnl`	Some Improvements to Turner's Algorithm for Bracket Abstraction. J. Symb. Log. Martin W. Bunder
1989	J	`jnl`	On Adding (xi) to Weak Equality in Combinatory Logic. J. Symb. Log. Martin W. Bunder, J. Roger Hindley, Jonathan P. Seldin
1988	J	`jnl`	Arithmetic based on the Church numerals in illative combinatory logic. Stud Logica Martin W. Bunder
1987	J	`jnl`	Some Consistency Proofs and a Characterization of Inconsistency Proofs in Illative Combinatory Logic. J. Symb. Log. Martin W. Bunder
1987	J	`jnl`	Some generalizations to two systems of set theory based on combinatory logic. Arch. Math. Log. Martin W. Bunder
1985	J	`jnl`	An Extension of Klop's Counterexample to the Church-Rosser Property to lambda-Calculus with other Ordered Pair Combinators. Theor. Comput. Sci. Martin W. Bunder
1985	J	`jnl`	Possible Forms of Evaluation or Reduction in Martin-Löf Type Theory. Theor. Comput. Sci. Martin W. Bunder
1984	J	`jnl`	Category theory based on combinatory logic. Arch. Math. Log. Martin W. Bunder
1983	J	`jnl`	A Weak Absolute Consistency Proof for Some Systems of Illative Combinatory Logic. J. Symb. Log. Martin W. Bunder
1983	J	`jnl`	A one axiom set theory based on higher order predicate calculus. Arch. Math. Log. Martin W. Bunder
1983	J	`jnl`	Predicate calculus of arbitrarily high finite order. Arch. Math. Log. Martin W. Bunder
1983	J	`jnl`	Set theory in predicate calculus with equality. Arch. Math. Log. Martin W. Bunder
1982	J	`jnl`	Illative combinatory logic without equality as a primitive predicate. Notre Dame J. Formal Log. Martin W. Bunder
1982	J	`jnl`	Some Results in Aczel-Feferman Logic and Set Theory. Math. Log. Q. Martin W. Bunder
1981	J	`jnl`	Predicate calculus and naive set theory in pure combinatory logic. Arch. Math. Log. Martin W. Bunder
1980	J	`jnl`	Significance and illative combinatory logics. Notre Dame J. Formal Log. Martin W. Bunder
1979	J	`jnl`	A more relevant relevance logic. Notre Dame J. Formal Log. Martin W. Bunder
1979	J	`jnl`	Alternative forms of propositional calculus for a given deduction theorem. Notre Dame J. Formal Log. Martin W. Bunder
1979	J	`jnl`	Deduction theorems in significance logics. Notre Dame J. Formal Log. Martin W. Bunder
1979	J	`jnl`	Generalized restricted generality. Notre Dame J. Formal Log. Martin W. Bunder
1979	J	`jnl`	On the equivalence of systems of rules and systems of axioms in illative combinatory logic. Notre Dame J. Formal Log. Martin W. Bunder
1979	J	`jnl`	Scott's models and illative combinatory logic. Notre Dame J. Formal Log. Martin W. Bunder
1979	J	`jnl`	Variable binding term operators in λ-calculus. Notre Dame J. Formal Log. Martin W. Bunder
1979	J	`jnl`	Λ-elimination in illative combinatory logic. Notre Dame J. Formal Log. Martin W. Bunder
1978	J	`jnl`	Equality in. Math. Log. Q. Martin W. Bunder
1978	J	`jnl`	On the Inconsistency of Systems Similar to F J. Symb. Log. Martin W. Bunder, Robert K. Meyer
1978	J	`jnl`	Some Anomalies in Fitch's System QD. J. Symb. Log. Martin W. Bunder, Jonathan P. Seldin
1977	J	`jnl`	Consistency Notions in Illative Combinatory Logic. J. Symb. Log. Martin W. Bunder
1976	J	`jnl`	Some notes on: "A deduction theorem for restricted generality". Notre Dame J. Formal Log. Martin W. Bunder
1976	J	`jnl`	The Inconsistency of F J. Symb. Log. Martin W. Bunder
1974	J	`jnl`	Propositional and predicate calculuses based on combinatory logic. Notre Dame J. Formal Log. Martin W. Bunder
1974	J	`jnl`	Various systems of set theory based on combinatory logic. Notre Dame J. Formal Log. Martin W. Bunder
1973	J	`jnl`	A deduction theorem for restricted generality. Notre Dame J. Formal Log. Martin W. Bunder
1973	J	`jnl`	A generalised Kleene-Rosser paradox for a system containing the combinator K. Notre Dame J. Formal Log. Martin W. Bunder
1970	J	`jnl`	A paradox in illative combinatory logic. Notre Dame J. Formal Log. Martin W. Bunder