From mboxrd@z Thu Jan 1 00:00:00 1970 X-Msuck: nntp://news.gmane.io/gmane.science.mathematics.categories/3043 Path: news.gmane.org!not-for-mail From: Peter Freyd Newsgroups: gmane.science.mathematics.categories Subject: intuitionism and disjunction Date: Sun, 26 Feb 2006 11:18:45 -0500 (EST) Message-ID: <200602261618.k1QGIjNW003204@saul.cis.upenn.edu> NNTP-Posting-Host: main.gmane.org X-Trace: ger.gmane.org 1241019062 7015 80.91.229.2 (29 Apr 2009 15:31:02 GMT) X-Complaints-To: usenet@ger.gmane.org NNTP-Posting-Date: Wed, 29 Apr 2009 15:31:02 +0000 (UTC) To: categories@mta.ca Original-X-From: rrosebru@mta.ca Sun Feb 26 22:11:13 2006 -0400 Return-path: Envelope-to: categories-list@mta.ca Delivery-date: Sun, 26 Feb 2006 22:11:13 -0400 Original-Received: from Majordom by mailserv.mta.ca with local (Exim 4.52) id 1FDXlX-00065e-CO for categories-list@mta.ca; Sun, 26 Feb 2006 22:05:35 -0400 Original-Sender: cat-dist@mta.ca Precedence: bulk X-Keywords: X-UID: 26 Original-Lines: 40 Xref: news.gmane.org gmane.science.mathematics.categories:3043 Archived-At: Paul Levy writes ...a model of intuitionistic logic is a *bi*cartesian closed category. I see no reason to regard disjunction as more "peripheral" to intuitionistic logic than implication. (And, likewise, no reason to regard sum types as more peripheral to simple type theory than function types.) Does anybody disagree? The original intuitionists did, of course, see such reasons. But for those who don't care about such issues as the nature of mathematical existence there's this reason: if by a *bi*cartesian closed category one were to mean a ccc category whose dual is also ccc then one would be stuck with that fact that all *bi*cartesian closed categories are just pre-ordered sets. The status of disjunction and sum types in the presence of function types is, indeed, significantly different from the status of conjunction and products types. Let me take the occasion to record a factoid I don't think I ever had an excuse to record before (and don't really have one now). Define the notion of a Heyting semi-lattice (HSL) by removing disjunction and bottom from the definition of Heyting algebra. Define a _linear_ HSL as one that satisfies the further equation ((x -> y) -> z) ^ ((y -> x) -> z) = z e.g. any linearly ordered set with top (indeed, every linear HSL is representable as a sub HSL of a product of linear ones). In a linear HSL one may construct disjunction as ((x -> y) -> y) ^ ((y -> x) -> x) The factoid of interest is this sort-of converse: the only HSL varieties in which every member is a lattice are varieties of linear HSLs.