The following pages link to Martin W. Bunder (Q591019):
Displaying 50 items.
- (Q221610) (redirect page) (← links)
- A decidable theory of type assignment (Q365669) (← links)
- A general characterization of the variable-sharing property by means of logical matrices (Q435241) (← links)
- Monotone hulls for \(\mathcal N \cap\mathcal M\) (Q484561) (← links)
- Compositional Z: confluence proofs for permutative conversion (Q514511) (← links)
- (Q587942) (redirect page) (← links)
- Ternary relations and relevant semantics (Q598309) (← links)
- First-order da Costa logic (Q631523) (← links)
- Child's addition in the Stern-Brocot tree (Q657999) (← links)
- Two beta-equal lambda-I-terms with no types in common (Q672135) (← links)
- Linking the Calkin-Wilf and Stern-Brocot trees (Q709233) (← links)
- A completeness result for the simply typed \(\lambda \mu \)-calculus (Q732057) (← links)
- Unique representations of integers using increasing sequences (Q741673) (← links)
- (Q791511) (redirect page) (← links)
- Deduction theorems for weak implicational logics (Q791512) (← links)
- Weak completeness of type assignment in \(\lambda\)-calculus models: A generalization of Hindley's result (Q809993) (← links)
- Systems of combinatory logic related to Quine's `New Foundations' (Q809994) (← links)
- Types of I-free hereditary right maximal terms (Q812102) (← links)
- Admissibility of cut in LC with fixed point combinator (Q817697) (← links)
- An admissible semantics for propositionally quantified relevant logics (Q848213) (← links)
- Relevant restricted quantification (Q853811) (← links)
- Parameter-free polymorphic types (Q958481) (← links)
- A Routley-Meyer type semantics for relevant logics including \(\text B_{\text r}\) plus the disjunctive syllogism (Q965858) (← links)
- Extensionality and restriction in naive set theory (Q965901) (← links)
- Locating terms in the Stern-Brocot tree (Q966153) (← links)
- Strong normalizability of typed lambda-calculi for substructural logics (Q1001367) (← links)
- The basic constructive logic for a weak sense of consistency (Q1006487) (← links)
- The basic constructive logic for negation-consistency (Q1006496) (← links)
- Proof-finding algorithms for classical and subclassical propositional logics (Q1049689) (← links)
- Some definitions of negation leading to paraconsistent logics (Q1062973) (← links)
- An extension of Klop's counterexample to the Church-Rosser property to \(\lambda\)-calculus with other ordered pair combinators (Q1080843) (← links)
- Possible forms of evaluation or reduction in Martin-Löf type theory (Q1087865) (← links)
- Every countable poset is embeddable in the poset of unsolvable terms (Q1098834) (← links)
- Reducibility of types in typed lambda calculus. Comment on a paper by Richard Statman (Q1104311) (← links)
- One-step recurrent terms in \(\lambda\)-\(\beta\)-calculus (Q1104313) (← links)
- Strictness analysis of the untyped \(\lambda\)-calculus (Q1114667) (← links)
- The word problem for Smullyan's lark combinator is decidable (Q1114668) (← links)
- Arithmetic based on the Church numerals in illative combinatory logic (Q1115414) (← links)
- BCK-combinators and linear \(\lambda\)-terms have types (Q1119620) (← links)
- Illative combinatory logic without equality as a primitive predicate (Q1148305) (← links)
- Minimally inconsistent LP (Q1181492) (← links)
- Implementing the `Fool's model' of combinatory logic (Q1181718) (← links)
- Finite type structures within combinatory algebras (Q1182485) (← links)
- Polymorphism and apartness (Q1182690) (← links)
- Intersection types for combinatory logic (Q1199823) (← links)
- Hierarchical semantics for relevant logics (Q1206806) (← links)
- Principal types of BCK-lambda-terms (Q1208417) (← links)
- Some notes on 'A deduction theorem for restricted generality' (Q1211498) (← links)
- Alternative forms of propositional calculus for a given deduction theorem (Q1234670) (← links)
- On the equivalence of systems of rules and systems of axioms in illative combinatory logic (Q1234672) (← links)
