2009
DOI: 10.2139/ssrn.1368796
|View full text |Cite
|
Sign up to set email alerts
|

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

Abstract: 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… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
71
0

Year Published

2013
2013
2021
2021

Publication Types

Select...
6
1

Relationship

4
3

Authors

Journals

citations
Cited by 30 publications
(71 citation statements)
references
References 22 publications
0
71
0
Order By: Relevance
“…The existence of a finite countermodel for any non-tautology in subset logic is trivial but the corresponding finite model property for partition logic is also an open question. The existing correctness and completeness proofs for partition logic [9] use semantic tableaus (adapted to deal with partitions rather than propositions). But a Hilbert-style axiom system for partition tautologies together with a proof of completeness is not currently known (all to the author's knowledge).…”
Section: Discussionmentioning
confidence: 99%
See 1 more Smart Citation
“…The existence of a finite countermodel for any non-tautology in subset logic is trivial but the corresponding finite model property for partition logic is also an open question. The existing correctness and completeness proofs for partition logic [9] use semantic tableaus (adapted to deal with partitions rather than propositions). But a Hilbert-style axiom system for partition tautologies together with a proof of completeness is not currently known (all to the author's knowledge).…”
Section: Discussionmentioning
confidence: 99%
“…The point was to show that the 15 functions, and thus all their further combinations, could be defined in terms of the four primitive operations of join, meet, implication and nand. 9 The fourteen non-zero operations occur in natural pairs: ⇒ and , ⇐ and , ≡ and ≡, ∨ and ∨, and ∧ and | in addition to σ and ¬σ , and τ and ¬τ . Except in the case of the join ∨ (and, of course, σ and τ ), the second operation in the pair is not the negation of the first.…”
Section: Distributing Interior Across Intersections Gives Partition Cnfmentioning
confidence: 99%
“…In partition logic on sets ( [4], [5]), the set partition operations (e.g., join, meet, and implication) on the partitions on a given universe set U can be represented as subset operations on certain subsets of U U , i.e., on certain binary relations on U . For a set partition = fB 1 ; :::; B m g on U , a distinction or dit of is an ordered pair (u; u 0 ) 2 U U of elements in distinct blocks of .…”
Section: Exploiting Duality In Quantum Partition Logicmentioning
confidence: 99%
“…The simplest is that the join of partitions which corresponds to the union of ditsets: for set partitions and on U , dit ( _ ) = dit ( ) [ dit ( ). For the meet and implication operations, we need to use the re ‡exive-symmetric-transitive closure operation on subsets of U U where for S U U , the RST-closure cl (S) is the equivalence relation that is the intersection of all the equivalence relations containing S. 4 Then the interior, int (S), is the complement of the closure of the complement, i.e., int (S) = cl (S c ) c (where () c is the set complement operation). Then the other operations on partition relations isomorphic to the partition operations are:…”
Section: Exploiting Duality In Quantum Partition Logicmentioning
confidence: 99%
See 1 more Smart Citation