Bergmann syntax

Logical System
8/1/26

The 'bergmann' system

The Bergmann, Moor, and Nelson book uses ∼,  &, ∨, ⊃, ≡ as its sentential connectives. Sentence letters are upper-case A, B, C, etc. possibly with subscripts. Parentheses can be used (primarily for disambiguation). So, for example, ~(A&B) is a sentential formula. 

Predicates are upper-case A, B, C, etc. possibly with subscripts. Constants are lower case [a-v], possibly with subscripts. Variables are lower case [w-z], possibly with subscripts. So, a simple unary predicate formula might be Aa; a binary one Bgf, a ternary one Hwxa etc. 

Quantifiers are written in parentheses, as is the scope of a quantified (sub) expression.  So the argument. Socrates is a man, All men are mortal, therefore, Socrates is mortal might be symbolized

Ms, (∀x)(Mx⊃M₂x) ∴ M₂s