On the existence of n but not n + 1 easy combinators

DOI10.1017/S0960129598002825zbMATH Open0939.03015OpenAlexW2162268423MaRDI QIDQ4704761

Rick Statman

Publication date: 29 June 2000

Published in: Mathematical Structures in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s0960129598002825

zbMATH Keywords

easy combinators

Mathematics Subject Classification ID

Combinatory logic and lambda calculus (03B40)

Recommendations

• Combinatorics at \(\aleph_\omega\) 👍 👎
• Characterizations and Existence of Easy Sets without Hard Subsets 👍 👎
• A Combinatorial Generalization of a Putnam Problem 👍 👎
• A counterexample to the “composition conjecture" 👍 👎
• On an extension of a recurrent relation from combinatorics 👍 👎
• A combinatorial version of the Svenonius theorem on definability 👍 👎
• Completeness Results for Counting Problems with Easy Decision 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎

This page was built for publication: On the existence of n but not n + 1 easy combinators

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4704761)