MyWikiBiz, Author Your Legacy — Thursday December 26, 2024
Jump to navigationJump to search
42 bytes added
, 14:36, 26 May 2009
Line 1: |
Line 1: |
| '''''Zeroth order logic''''' is a term in popular use among practitioners for the common principles underlying the [[algebra of sets]], [[boolean algebra]], [[boolean function]]s, [[logical connective]]s, [[monadic predicate calculus]], [[propositional calculus]], and sentential logic. The term serves to mark a level of abstraction in which the more inessential differences among these subjects can be subsumed under the appropriate [[isomorphism]]s. | | '''''Zeroth order logic''''' is a term in popular use among practitioners for the common principles underlying the [[algebra of sets]], [[boolean algebra]], [[boolean function]]s, [[logical connective]]s, [[monadic predicate calculus]], [[propositional calculus]], and sentential logic. The term serves to mark a level of abstraction in which the more inessential differences among these subjects can be subsumed under the appropriate [[isomorphism]]s. |
| + | |
| + | ==Propositional forms on two variables== |
| | | |
| By way of initial orientation, Table 1 lists equivalent expressions for the sixteen functions of concrete type ''X'' × ''Y'' → '''B''' and abstract type '''B''' × '''B''' → '''B''' in a number of different languages for zeroth order logic. | | By way of initial orientation, Table 1 lists equivalent expressions for the sixteen functions of concrete type ''X'' × ''Y'' → '''B''' and abstract type '''B''' × '''B''' → '''B''' in a number of different languages for zeroth order logic. |