首页/论文/0902.1950

arXiv 0902.19502009-02math.LOmath.CO

The Logic of Partitions: Introduction to the Dual of the Logic of Subsets

David Ellerman

英文摘要：

Modern categorical logic as well as the Kripke and topological models of intuitionistic logic suggest that the interpretation of ordinary "propositional" logic should in general be the logic of subsets of a given universe set. Partitions on a set are dual to subsets of a set in the sense of the category-theoretic duality of epimorphisms and monomorphisms--which is reflected in the duality between quotient objects and subobjects throughout algebra. If "propositional" logic is thus seen as the logic of subsets of a universe set, then the question naturally arises of a dual logic of partitions on a universe set. This paper is an introduction to that logic of partitions dual to classical subset logic. The paper goes from basic concepts up through the correctness and completeness theorems for a tableau system of partition logic.

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

阅读原文

阅读 PDF ↗

arXiv 页面 ↗HTML 原文 ↗

本文内容

英文摘要相关论文

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

继续探索

相关论文

Negation and Implication in Partition Logic

The Boolean logic of subsets, usually presented as `propositional logic,' is considered as being "classical" while intuitionistic logic and the many sublogics and off-shoots are "non-classical." But there is another mathematical logic, the logic of partitions, that is at the same mathmatical level as Boolean subset logic since subsets and quotient sets (partitions or equivalence relations) are dual to one another in the category-theoretic sense. Our purpose here is to explore the notions of negation and implication in that other mathematical logic of partitions.

2020-07-10math.LO

Counting Distinctions: On the Conceptual Foundations of Shannon's Information Theory

Categorical logic has shown that modern logic is essentially the logic of subsets (or "subobjects"). Partitions are dual to subsets so there is a dual logic of partitions where a "distinction" [an ordered pair of distinct elements (u,u') from the universe U ] is dual to an "element". An element being in a subset is analogous to a partition p on U making a distinction, i.e., if u and u' were in different blocks of p. Subset logic leads to finite probability theory by taking the (Laplacian) probability as the normalized size of each subset-event of a finite universe. The analogous step in the lo…

2009-02-11cs.ITcs.LOmath.IT

Information as Distinctions: New Foundations for Information Theory

The logical basis for information theory is the newly developed logic of partitions that is dual to the usual Boolean logic of subsets. The key concept is a "distinction" of a partition, an ordered pair of elements in distinct blocks of the partition. The logical concept of entropy based on partition logic is the normalized counting measure of the set of distinctions of a partition on a finite set--just as the usual logical notion of probability based on the Boolean logic of subsets is the normalized counting measure of the subsets (events). Thus logical entropy is a measure on the set of orde…

2013-01-26cs.ITmath.ITmath.LO

An Analysis of Ruspini Partitions in Gödel Logic

By a Ruspini partition we mean a finite family of fuzzy sets $\{f_1, \ldots, f_n\}$, $f_i : [0,1] \to [0,1]$, such that $\sum_{i=1}^n f_i(x)=1$ for all $x \in [0,1]$, where $[0,1]$ denotes the real unit interval. We analyze such partitions in the language of Gödel logic. Our first main result identifies the precise degree to which the Ruspini condition is expressible in this language, and yields inter alia a constructive procedure to axiomatize a given Ruspini partition by a theory in Gödel logic. Our second main result extends this analysis to Ruspini partitions fulfilling the natural additio…

2014-01-21cs.LOmath.LO

The Objective Indefiniteness Interpretation of Quantum Mechanics

The common-sense view of reality is expressed logically in Boolean subset logic (each element is either definitely in or not in a subset, i.e., either definitely has or does not have a property). But quantum mechanics does not agree with this "properties all the way down" picture of micro-reality. Are there other coherent alternative views of reality? A logic of partitions, dual to the Boolean logic of subsets (partitions are dual to subsets), was recently developed along with a logical version of information theory. In view of the subset-partition duality, partition logic is the alternative t…

2013-01-23cs.ITmath.ITmath.LO

Subset models for justification logic

We introduce a new semantics for justification logic based on subset relations. Instead of using the established and more symbolic interpretation of justifications, we model justifications as sets of possible worlds. We introduce a new justification logic that is sound and complete with respect to our semantics. Moreover, we present another variant of our semantics that corresponds to traditional justification logic. These types of models offer us a versatile tool to work with justifications, e.g.~by extending them with a probability measure to capture uncertain justifications. Following this …

2020-08-18math.LO

更多相关论文收起更多论文

EXPSPACE-Completeness of the Logics K4xS5 and S4xS5 and the Logic of Subset Spaces, Part 1: ESPACE-Algorithms

It is known that the satisfiability problems of the product logics K4xS5 and S4xS5 and of the logic SSL of subset spaces are in N2EXPTIME. We improve this upper bound for the complexity of these problems by presenting ESPACE-algorithms for these problems. In another paper we show that these problems are EXPSPACE-hard. This shows that all three problems are EXPSPACE-complete.

2019-08-09cs.CCcs.LOmath.LO

EXPSPACE-Completeness of the Logics K4xS5 and S4xS5 and the Logic of Subset Spaces, Part 2: EXPSPACE-Hardness

It is known that the satisfiability problems of the product logics K4xS5 and S4xS5 are NEXPTIME-hard and that the satisfiability problem of the logic SSL of subset spaces is PSPACE-hard. We improve these lower bounds for the complexity of these problems by showing that all three problems are EXPSPACE-hard under logspace reduction. In another paper we show that these problems are in ESPACE. This shows that all three problems are EXPSPACE-complete.

2019-08-09cs.CCcs.LOmath.LO

Partitioning subsets of generalised scattered orders

In 1956, 48 years after Hausdorff provided a comprehensive account on ordered sets and defined the notion of a scattered order, Erdős and Rado founded the partition calculus in a seminal paper. The present paper gives an account of investigations into generalisations of scattered linear orders and their partition relations for both singletons and pairs. It provides analogues of the Milner-Rado paradox for these orders instead of ordinals. For infinite, regular $κ$, we investigate the extent to which the classes of $κ$-scattered, weakly $κ$-scattered, and $κ$-saturated linear orders of size $κ$…

2018-05-22math.LO

Boolean and ortho fuzzy subset logics

Constructing a fuzzy subset logic L with Boolean properties is notoriously difficult because under a handful of "reasonable" conditions, we have the following three debilitating constraints: (1) Bellman and Giertz in 1973 showed that if L is distributive, then it must be idempotent. (2) Dubois and Padre in 1980 showed that if L has the excluded middle or the non-contradiction property or both, then it must be non-idempotent. (3) Bellman and Giertz also demonstrated in 1973 that even if L is idempotent, then the only choice available for the (meet,join) logic operator pair is the (min,max) oper…

2015-08-26math.ACmath.LOmath.RA

Ultrafilter spaces on the semilattice of partitions

The Stone-Cech compactification of the natural numbers bN, or equivalently, the space of ultrafilters on the subsets of omega, is a well-studied space with interesting properties. If one replaces the subsets of omega by partitions of omega, one can define corresponding, non-homeomorphic spaces of partition ultrafilters. It will be shown that these spaces still have some of the nice properties of bN, even though none is homeomorphic to bN. Further, in a particular space, the minimal height of a tree pi-base and P-points are investigated.

2001-09-23math.LO

On lambda strongly homogeneity existence for cofinality logics

Let C subset Reg be a non-empty class (of regular cardinal). Then the logic L(Q^{cf}_C) has additional nice properties: it has homogeneous model existence property.

2009-02-03math.LO

仿射模态命题逻辑

Affine modal propositional logic

Tarbiat Modares University（塔比尔·莫达雷斯大学）

研究仿射模态命题逻辑，通过用下半连续包络算子取代内部算子，证明了该逻辑的完备性和仿射紧致性定理。

2026-09-17math.LO

分区通用性与鸽巢基定理

Partition genericity and pigeonhole basis theorems

本文提出分区通用性概念，证明余超免疫集与 Kurtz 随机集均具有该性质，并由此回答 Kjos-Hanssen 和 Liu 的问题，统一推出多个鸽巢基定理。

2022-04-06math.LO

Second order intuitionistic propositional logic of the real line is decidable

It is known that the set of tautologies of second order intuitionistic propositional logic, $\mathrm{IPC} 2$, is undecidable. Here, we prove that the sets of formulas of $\mathrm{IPC} 2$ which are true in the algebra of open subsets of reals or rationals are decidable.

2016-12-21math.LO

Infra-topologies revisited: logic and clarification of basic notions

In this paper we adhere to the definition of infra-topological space as it was introduced by Al-Odhari. Namely, we speak about families of subsets which contain empty set and the whole universe X, being at the same time closed under finite intersections (but not necessarily under arbitrary or even finite unions). This slight modification allows us to distinguish between new classes of subsets (infra-open, ps-infra-open and i-genuine). Analogous notions are discussed in the language of closures. The class of minimal infra-open sets is studied too, as well as the idea of generalized infra-spaces…

2021-01-06math.LO

Truth-relevant Logic, Propositional Calculus

The thesis of this paper is that truth-relevant logic is a better foundation for mathematics than classical logic. It is a system proposed by Richard Diaz in 1981. In a certain sense t-relevant logic is based on Kleene strong tables. These define a system with three values: true, false, unknown. It turns out that there exist tautologies with the following property: there exists a proper subset of propositional variables (t-relevant variables) such that for all combinations true/false the tautology will be true, that is, the rest of the variables (redundant variables) occurring in the tautology…

2023-02-12math.LO

Vaught's Two-Cardinal Theorem and Quasi-Minimality in Continuous Logic

We prove the following continuous analogue of Vaught's Two-Cardinal Theorem: if for some $κ>λ\geq \aleph_0$, a continuous theory $T$ has a model with density character $κ$ which has a definable subset of density character $λ$, then $T$ has a model with density character $\aleph_1$ which has a separable definable subset. We also show that if we assume that $T$ is $ω$-stable, then if $T$ has a model of density character $\aleph_1$ with a separable definable set, then for any uncountable $κ$ we can find a model of $T$ with density character $κ$ which has a separable definable subset. In order to …

2021-10-12math.LO

Follow the Math!: The mathematics of quantum mechanics as the mathematics of set partitions linearized to (Hilbert) vector spaces

The purpose of this paper is to show that the mathematics of quantum mechanics (QM) is the mathematics of set partitions (which specify indefiniteness and definiteness) linearized to vector spaces, particularly in Hilbert spaces. That is, the math of QM is the Hilbert space version of the math to describe objective indefiniteness that at the set level is the math of partitions. The key analytical concepts are definiteness versus indefiniteness, distinctions versus indistinctions, and distinguishability versus indistinguishability. The key machinery to go from indefinite to more definite states…

2022-07-31math.LOquant-ph

`Ultrafilters Relaxed' -- Species of Families of Subsets

An assortments of `species' of families of subsets of a set and some of their properties are investigated, with an eye on the logic and limit role they may play as `relaxed parallels' to ultrafilters.

2021-11-12math.GNmath.LO