The linear logic connectives ⊕ and & are called additive, ⊗ and ⅋ are called multiplicative, and ! and ? are called expontential.

Modal Logic and Science Fiction johndcook.com/blog/2022/01/2…

QED at the end of the proof comes from the Latin quod erat demonstrandum, 'which is what had to be proven'. It is also a command in Coq.

de Bruijn numbering is a way to avoid having to work modulo α-equivalence in lambda calculus. en.wikipedia.org/wiki/De_Bruijn…

Computational trinitarianism ncatlab.org/nlab/show/comp…

The American Aristotle aeon.co/essays/charles…

DNF-SAT is in P, but putting a SAT problem into DNF takes exponential time.

History of modal logic homepages.mcs.vuw.ac.nz/~rob/papers/mo… [pdf]

Proofs of false statements johndcook.com/blog/2008/02/0…

Heyting algebra : intuitionistic logic :: Boolean algebra : classical logic

A brief history of logic cs.rice.edu/~vardi/comp409… [pdf]

Yes

A Boolean formula can be rewritten in conjunctive normal form (CNF) in linear time.

The satisfiability problem (SAT) is trivial for formulas in disjunctive normal form (DNF): just evaluate each clause separately.

Post's lattice en.wikipedia.org/wiki/Post%27s_…

A modal logic is monotone if □(p∧q) → □p.

'It requires a very unusual mind to undertake the analysis of the obvious.' -- Alfred North Whitehead

Temporal and polymodal logics johndcook.com/blog/2022/01/2…

The linear logic connectives ⊕, ⊗, and ! have positive polarity. The connectives &, ⅋, and ? have negative polarity.

Logic in physical form youtu.be/txH3K3shIWs