<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom">
  <channel>
    <title>Classifying Sheffer Functions on csimpson</title>
    <link>/tags/classifying-sheffer-functions/</link>
    <description>Recent content in Classifying Sheffer Functions on csimpson</description>
    <generator>Hugo</generator>
    <language>en</language>
    <lastBuildDate>Fri, 28 Nov 2025 00:00:00 -0800</lastBuildDate>
    <atom:link href="/tags/classifying-sheffer-functions/index.xml" rel="self" type="application/rss+xml" />
    <item>
      <title>Classifying Sheffer Functions</title>
      <link>/posts/classifying_pt1/</link>
      <pubDate>Fri, 28 Nov 2025 00:00:00 -0800</pubDate>
      <guid>/posts/classifying_pt1/</guid>
      <description>&lt;p&gt;In the series &lt;em&gt;&lt;strong&gt;Universal Boolean Functions&lt;/strong&gt;&lt;/em&gt;, we looked at sets of Boolean functions that have the property that they can form any other Boolean function when we compose them together with projections. We paid special attention to &lt;em&gt;&lt;strong&gt;Sheffer&lt;/strong&gt;&lt;/em&gt; functions, which have the property that iterated composition of them with projections can form any Boolean function, or to put it another way if \(f\) is Sheffer, the set \(\{f\}\) is universal.&lt;/p&gt;</description>
    </item>
  </channel>
</rss>
