Martin W. Bunder

发表

On the Inconsistency of Systems Similar to F * 21

Robert K. Meyer, Martin W. Bunder, M. Bunder, 1978, Journal of Symbolic Logic (JSL).

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

Martin W. Bunder, 1985, Theor. Comput. Sci..

A one axiom set theory based on higher order predicate calculus

Martin W. Bunder, 1983, Arch. Math. Log..

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

Martin W. Bunder, 1976, Notre Dame J. Formal Log..

Proof finding algorithms for implicational logics

Martin W. Bunder, 2000, Theor. Comput. Sci..

A paradox in illative combinatory logic

Martin W. Bunder, 1970, Notre Dame J. Formal Log..

Propositional and predicate calculuses based on combinatory logic

Martin W. Bunder, 1974, Notre Dame J. Formal Log..

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

Martin W. Bunder, 1983, J. Symb. Log..

A simplified form of condensed detachment

Martin W. Bunder, 1995, J. Log. Lang. Inf..

Various systems of set theory based on combinatory logic

Martin W. Bunder, 1974, Notre Dame J. Formal Log..

On the self matching properties of [j tau]

Martin W. Bunder, Keith P. Tognetti, 2001, Discret. Math..

Alternative Solutions to Linear Recurrence Equations

Martin W. Bunder, 2019, Integers.

Some consistency proofs and a characterization of inconsistency proofs in illative combinatory logic

Martin W. Bunder, M. Bunder, 1987, The Journal of Symbolic Logic.

Some improvements to Turner's algorithm for bracket abstraction

Martin W. Bunder, M. Bunder, 1990, Journal of Symbolic Logic.

Locating terms in the Stern-Brocot tree

Martin W. Bunder, Keith P. Tognetti, Bruce Bates, 2010, Eur. J. Comb..

Λ-elimination in illative combinatory logic

Martin W. Bunder, 1979, Notre Dame J. Formal Log..

Variable binding term operators in λ-calculus

Martin W. Bunder, 1979, Notre Dame J. Formal Log..

Intersection types for lambda-terms and combinators and their logics

Martin W. Bunder, 2002, Log. J. IGPL.

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

Jennifer Seberry, Willy Susilo, Jianyong Huang, 2005, EUC Workshops.

Alternative forms of propositional calculus for a given deduction theorem

Martin W. Bunder, 1979, Notre Dame J. Formal Log..

Consistency Notions in Illative Combinatory Logic

Martin W. Bunder, 1977, J. Symb. Log..

Equivalences between Pure Type Systems and Systems of Illative Combinatory Logic

Martin W. Bunder, W. J. M. Dekkers, M. Bunder, 2005, Notre Dame J. Formal Log..

Combinators, Proofs and Implicational Logics

Martin W. Bunder, 2002 .

Linking the Calkin-Wilf and Stern-Brocot trees

Martin W. Bunder, Keith P. Tognetti, Bruce Bates, 2010, Eur. J. Comb..

Are there Hilbert-style Pure Type Systems?

Wil Dekkers, Martin W. Bunder, 2008, Log. Methods Comput. Sci..

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

Willy Susilo, Martin W. Bunder, Abderrahmane Nitaj, 2018, J. Inf. Secur. Appl..

Scott's models and illative combinatory logic

Martin W. Bunder, 1979, Notre Dame J. Formal Log..

Completeness of the propositions-as-types interpretation of intuitionistic logic into illative combinatory logic

Hendrik Pieter Barendregt, Wil Dekkers, Martin W. Bunder, 1998, Journal of Symbolic Logic.

Equality in

Martin W. Bunder, 1978, Math. Log. Q..

Predicate calculus and naive set theory in pure combinatory logic

Martin W. Bunder, 1981, Arch. Math. Log..

Category theory based on combinatory logic

Martin W. Bunder, 1984, Arch. Math. Log..

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

Hendrik Pieter Barendregt, Wil Dekkers, Martin W. Bunder, 1998, Arch. Math. Log..

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

Martin W. Bunder, J. Roger Hindley, M. Bunder, 1996, Theor. Comput. Sci..

Some Anomalies in Fitch's System QD

Martin W. Bunder, Jonathan P. Seldin, 1978, J. Symb. Log..

Variants of the basic calculus of constructions

Martin W. Bunder, Jonathan P. Seldin, M. Bunder, 2004, J. Appl. Log..

The Inhabitation Problem for Intersection Types

Martin W. Bunder, 2008, CATS.

Combinatory abstraction using B, 6' and friends*

Martin W. Bunder, J. Roger Hindley, Peter Trigg, 1994 .

Deduction theorems in significance logics

Martin W. Bunder, 1979, Notre Dame J. Formal Log..

Weaker D-Complete Logics

Martin W. Bunder, Norman D. Megill, 1996, Log. J. IGPL.

Some Rough Consequence Logics and their Interrelations

Mohua Banerjee, Mihir K. Chakraborty, Martin W. Bunder, 2008, Trans. Rough Sets.

Lambda Terms Definable as Combinators

Martin W. Bunder, M. Bunder, 1996, Theor. Comput. Sci..

A New Attack on Three Variants of the RSA Cryptosystem

Willy Susilo, Martin W. Bunder, Abderrahmane Nitaj, 2016, ACISP.

Predicate calculus of arbitrarily high finite order

Martin W. Bunder, 1983, Arch. Math. Log..

Pure type systems with more liberal rules

Wil Dekkers, Martin W. Bunder, M. Bunder, 2001, Journal of Symbolic Logic.

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

Martin W. Bunder, M. Bunder, 1979, Notre Dame J. Formal Log..

Expedited Broda-Damas Bracket Abstraction

Martin W. Bunder, 2000, J. Symb. Log..

Significance and illative combinatory logics

Martin W. Bunder, M. Bunder, 1980, Notre Dame J. Formal Log..

A Classification of Intersection Type Systems

Martin W. Bunder, 2002, J. Symb. Log..

A deduction theorem for restricted generality

Martin W. Bunder, M. Bunder, 1973, Notre Dame J. Formal Log..

Set theory in predicate calculus with equality

Martin W. Bunder, M. Bunder, 1983, Arch. Math. Log..

Classical versions of BCI, BCK and BCIW logics

Martin W. Bunder, John Slaney, 1994 .

A more relevant relevance logic

Martin W. Bunder, 1979, Notre Dame J. Formal Log..

Generalized restricted generality

Martin W. Bunder, 1979, Notre Dame J. Formal Log..

Proof-finding Algorithms for Classical and Subclassical Propositional Logics

Martin W. Bunder, R. M. Rizkalla, 2009, Notre Dame J. Formal Log..

Combinatory Abstraction Bsing B, B' and Friends

Martin W. Bunder, J. Roger Hindley, P. Trigg, 1994, Theor. Comput. Sci..

The Inconsistency of F * 21

Martin W. Bunder, 1976, J. Symb. Log..

On binary reflected Gray codes and functions

Martin W. Bunder, Keith P. Tognetti, Glen E. Wheeler, 2008, Discret. Math..

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

Martin W. Bunder, 1973, Notre Dame J. Formal Log..

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

Martin W. Bunder, 1987, Arch. Math. Log..

Child's addition in the Stern-Brocot tree

Martin W. Bunder, Keith P. Tognetti, Bruce Bates, 2012, Eur. J. Comb..

Illative combinatory logic without equality as a primitive predicate

Martin W. Bunder, M. Bunder, 1982, Notre Dame J. Formal Log..

Implementing the ‘Fool's model’ of combinatory logic

Robert K. Meyer, Martin W. Bunder, Lawrence Powers, 1991, Journal of Automated Reasoning.

A generalized attack on RSA type cryptosystems

Willy Susilo, Martin W. Bunder, Abderrahmane Nitaj, 2017, Theor. Comput. Sci..

On Adding (xi) to Weak Equality in Combinatory Logic

Martin W. Bunder, J. Roger Hindley, Jonathan P. Seldin, 1989, J. Symb. Log..

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

Martin W. Bunder, M. Bunder, 1985, Theor. Comput. Sci..

Systems of illative combinatory logic complete for first-order propositional and predicate calculus

Hendrik Pieter Barendregt, Wil Dekkers, Martin W. Bunder, 1993, Journal of Symbolic Logic.

On the inconsistency of systems similar to

Robert K. Meyer, Martin W. Bunder, 1978 .

Some definitions of negation leading to paraconsistent logics

Martin W. Bunder, 1984 .

The inconsistency of

Martin W. Bunder, M. Bunder, M. Bunder, 1976, Journal of Symbolic Logic.

Linkages between the Gauss map and the Stern- Brocot tree

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

On the harmonic continued fractions

Peter Nickolas, Martin W. Bunder, Joseph Tonien, 2019, The Ramanujan Journal.

On adding (ξ) to weak equality in combinatory logic

Martin W. Bunder, J. Roger Hindley, Jonathan P. Seldin, 1989, Journal of Symbolic Logic.

Continued fractions and the Gauss map.

Martin W. Bunder, Bruce Bates, M. Bunder, 2005 .

A new improved attack on RSA

Martin W. Bunder, Joseph Tonien, 2016 .

THE ZECKENDORF REPRESENTATION AND THE GOLDEN SEQUENCE

Martin W. Bunder, M. Bunder, Keith Tognetti, 1991 .

A new attack on the RSA cryptosystem based on continued fractions

Martin W. Bunder, Joseph Tonien, M. Bunder, 2017 .