Martin W. Bunder - Citegraph

Author Info

Name	Affiliation	Papers
MARTIN W. BUNDER	Department of Mathematics and Applied Statistics, University of Wollongong, Wollongong NSW 2522, Australia	31
Collaborators	Citations	PageRank
20	64	16.78
Referers	Referees	References
62	68	72

Publications (31 rows)

Collaborators (20 rows)

Referers (62 rows)

Referees (68 rows)

Title	Citations	PageRank	Year
A generalized attack on RSA type cryptosystems.	2	0.47	2017
A New Attack on Three Variants of the RSA Cryptosystem.	4	0.52	2016
Proof-finding Algorithms for Classical and Subclassical Propositional Logics	0	0.34	2009
Some rough consequence logics and their interrelations	9	0.59	2008
On binary reflected Gray codes and functions	1	0.97	2008
Are there Hilbert-style Pure Type Systems?	0	0.34	2007
Equivalences between Pure Type Systems and Systems of Illative Combinatory Logic	2	0.54	2005
Intersection types for lambda-terms and combinators and their logics	2	0.40	2002
A Classification of Intersection Type Systems	0	0.34	2002
On the self matching properties of [j tau]	0	0.34	2001
Pure Type Systems with More Liberal Rules	3	0.46	2001
Expedited Broda-Damas Bracket Abstraction	0	0.34	2000
Completeness of two systems of illative combinatory logic for first-order propositional and predicate calculus	6	0.61	1998
Completeness of the Propositions-as-Types Interpretation of Intuitionistic Logic into Illative Combinatory Logic.	5	0.82	1998
Weaker D-Complete Logics	1	0.38	1996
A Simplified Form of Condensed Detachment	0	0.34	1995
Combinatory Abstraction Using B, B' And Friends	0	0.34	1994
Systems of Illative Combinatory Logic Complete for First-Order Propositional and Predicate Calculus	8	1.76	1993
Implementing the ‘Fool's model’ of combinatory logic	7	1.03	1991
Some Improvements To Turners Algorithm For Bracket Abstraction	6	0.58	1990
On Adding (xi) to Weak Equality in Combinatory Logic	0	0.34	1989
Some Consistency Proofs and a Characterization of Inconsistency Proofs in Illative Combinatory Logic	1	0.40	1987
An Extension of Klop's Counterexample to the Church-Rosser Property to lambda-Calculus with other Ordered Pair Combinators	1	0.90	1985
A Weak Absolute Consistency Proof for Some Systems of Illative Combinatory Logic	4	1.05	1983
Λ-elimination in illative combinatory logic.	0	0.34	1979
On the Inconsistency of Systems Similar to F * 21	0	0.34	1978
Some Anomalies in Fitch's System QD	0	0.34	1978
Consistency Notions In Illative Combinatory Logic	2	0.59	1977
The Inconsistency of F * 21	0	0.34	1976
Some notes on: "A deduction theorem for restricted generality".	0	0.34	1976
A generalised Kleene-Rosser paradox for a system containing the combinator K.	0	0.34	1973