Boundary algebra: a simple notation for boolean algebra and the truth functors. Philip Meguire Technical Report University of Canterbury, 2007. bibtex*:PhilipMeguireBoundaryalgebrasimple2007abstract bibtex Boundary algebra [BA] is a simpler notation for Spencer-Brown’s (1969) primary algebra [pa], the Boolean algebra 2, and the truth functors. The primary arithmetic [PA] consists of the atoms ‘()’ and the blank page, concatenation, and enclosure between ‘(‘ and ‘)’, denoting the primitive notion of distinction. Inserting letters denoting the presence or absence of () into a PA formula yields a BA formula. The BA axioms are "()()=()" (A1), and "(()) [=?] may be written or erased at will” (A2). Repeated application of these axioms to a PA formula yields a member of B= (),? called its simplification. (a) has two intended interpretations: (a) ? a? (Boolean algebra 2), and (a) ? a (sentential logic). BA is self-dual: () ? 1 [dually 0] so that B is the carrier for 2, ab ? a?b [a?b], and (a)b [(a(b))] ? a=b, so that ?=() [()=?] follows trivially and B is a poset. The BA basis abc= bca (Dilworth 1938), a(ab)= a(b), and a()=() (Bricken 2002) facilitates clausal reasoning and proof by calculation. BA also simplifies normal forms and Quine’s (1982) truth value analysis. () ? true [false] yields boundary logic.
@techreport{philip_meguire_boundary_2007,
title = {Boundary algebra: a simple notation for boolean algebra and the truth functors},
abstract = {Boundary algebra [BA] is a simpler notation for Spencer-Brown’s (1969) primary algebra [pa], the Boolean algebra 2, and the truth functors. The primary arithmetic [PA] consists of the atoms ‘()’ and the blank page, concatenation, and enclosure between ‘(‘ and ‘)’, denoting the primitive notion of distinction. Inserting letters denoting the presence or absence of () into a PA formula yields a BA formula. The BA axioms are "()()=()" (A1), and "(()) [=?] may be written or erased at will” (A2). Repeated application of these axioms to a PA formula yields a member of B= (),? called its simplification. (a) has two intended interpretations: (a) ? a? (Boolean algebra 2), and (a) ? a (sentential logic). BA is self-dual: () ? 1 [dually 0] so that B is the carrier for 2, ab ? a?b [a?b], and (a)b [(a(b))] ? a=b, so that ?=() [()=?] follows trivially and B is a poset. The BA basis abc= bca (Dilworth 1938), a(ab)= a(b), and a()=() (Bricken 2002) facilitates clausal reasoning and proof by calculation. BA also simplifies normal forms and Quine’s (1982) truth value analysis. () ? true [false] yields boundary logic.},
institution = {University of Canterbury},
author = {{Philip Meguire}},
year = {2007},
note = {bibtex*:PhilipMeguireBoundaryalgebrasimple2007},
keywords = {gráficos existenciais, lógica boundary, álgebra booleana},
}
Downloads: 0
{"_id":"WKxeMoHtGFoPMZ2G3","bibbaseid":"philipmeguire-boundaryalgebraasimplenotationforbooleanalgebraandthetruthfunctors-2007","author_short":["Philip Meguire"],"bibdata":{"bibtype":"techreport","type":"techreport","title":"Boundary algebra: a simple notation for boolean algebra and the truth functors","abstract":"Boundary algebra [BA] is a simpler notation for Spencer-Brown’s (1969) primary algebra [pa], the Boolean algebra 2, and the truth functors. The primary arithmetic [PA] consists of the atoms ‘()’ and the blank page, concatenation, and enclosure between ‘(‘ and ‘)’, denoting the primitive notion of distinction. Inserting letters denoting the presence or absence of () into a PA formula yields a BA formula. The BA axioms are \"()()=()\" (A1), and \"(()) [=?] may be written or erased at will” (A2). Repeated application of these axioms to a PA formula yields a member of B= (),? called its simplification. (a) has two intended interpretations: (a) ? a? (Boolean algebra 2), and (a) ? a (sentential logic). BA is self-dual: () ? 1 [dually 0] so that B is the carrier for 2, ab ? a?b [a?b], and (a)b [(a(b))] ? a=b, so that ?=() [()=?] follows trivially and B is a poset. The BA basis abc= bca (Dilworth 1938), a(ab)= a(b), and a()=() (Bricken 2002) facilitates clausal reasoning and proof by calculation. BA also simplifies normal forms and Quine’s (1982) truth value analysis. () ? true [false] yields boundary logic.","institution":"University of Canterbury","author":[{"firstnames":[],"propositions":[],"lastnames":["Philip Meguire"],"suffixes":[]}],"year":"2007","note":"bibtex*:PhilipMeguireBoundaryalgebrasimple2007","keywords":"gráficos existenciais, lógica boundary, álgebra booleana","bibtex":"@techreport{philip_meguire_boundary_2007,\n\ttitle = {Boundary algebra: a simple notation for boolean algebra and the truth functors},\n\tabstract = {Boundary algebra [BA] is a simpler notation for Spencer-Brown’s (1969) primary algebra [pa], the Boolean algebra 2, and the truth functors. The primary arithmetic [PA] consists of the atoms ‘()’ and the blank page, concatenation, and enclosure between ‘(‘ and ‘)’, denoting the primitive notion of distinction. Inserting letters denoting the presence or absence of () into a PA formula yields a BA formula. The BA axioms are \"()()=()\" (A1), and \"(()) [=?] may be written or erased at will” (A2). Repeated application of these axioms to a PA formula yields a member of B= (),? called its simplification. (a) has two intended interpretations: (a) ? a? (Boolean algebra 2), and (a) ? a (sentential logic). BA is self-dual: () ? 1 [dually 0] so that B is the carrier for 2, ab ? a?b [a?b], and (a)b [(a(b))] ? a=b, so that ?=() [()=?] follows trivially and B is a poset. The BA basis abc= bca (Dilworth 1938), a(ab)= a(b), and a()=() (Bricken 2002) facilitates clausal reasoning and proof by calculation. BA also simplifies normal forms and Quine’s (1982) truth value analysis. () ? true [false] yields boundary logic.},\n\tinstitution = {University of Canterbury},\n\tauthor = {{Philip Meguire}},\n\tyear = {2007},\n\tnote = {bibtex*:PhilipMeguireBoundaryalgebrasimple2007},\n\tkeywords = {gráficos existenciais, lógica boundary, álgebra booleana},\n}\n\n","author_short":["Philip Meguire"],"key":"philip_meguire_boundary_2007","id":"philip_meguire_boundary_2007","bibbaseid":"philipmeguire-boundaryalgebraasimplenotationforbooleanalgebraandthetruthfunctors-2007","role":"author","urls":{},"keyword":["gráficos existenciais","lógica boundary","álgebra booleana"],"metadata":{"authorlinks":{}},"html":""},"bibtype":"techreport","biburl":"https://bibbase.org/zotero/brunocpt","dataSources":["9N7FyBLqJ5Q2Suqzs"],"keywords":["gráficos existenciais","lógica boundary","álgebra booleana"],"search_terms":["boundary","algebra","simple","notation","boolean","algebra","truth","functors","philip meguire"],"title":"Boundary algebra: a simple notation for boolean algebra and the truth functors","year":2007}