Changes

MyWikiBiz, Author Your Legacy — Sunday April 28, 2024
Jump to navigationJump to search
Line 269: Line 269:  
For more information about this syntax for propositional calculus, see the entries on [[minimal negation operator]]s, [[zeroth order logic]], and [[Directory:Jon_Awbrey/Papers/Differential_Propositional_Calculus#Appendix_1|Table A1 in Appendix 1]].
 
For more information about this syntax for propositional calculus, see the entries on [[minimal negation operator]]s, [[zeroth order logic]], and [[Directory:Jon_Awbrey/Papers/Differential_Propositional_Calculus#Appendix_1|Table A1 in Appendix 1]].
   −
==Formal development==
+
==3. Formal Development==
    
The preceding discussion outlined the ideas leading to the differential extension of propositional logic.  The next task is to lay out the concepts and terminology that are needed to describe various orders of differential propositional calculi.
 
The preceding discussion outlined the ideas leading to the differential extension of propositional logic.  The next task is to lay out the concepts and terminology that are needed to describe various orders of differential propositional calculi.
   −
===Elementary notions===
+
===3.1. Elementary Notions===
    
Logical description of a universe of discourse begins with a set of logical signs.  For the sake of simplicity in a first approach, assume that these logical signs are collected in the form of a finite alphabet, <math>\mathfrak{A} = \lbrace\!</math>&nbsp;“<math>a_1\!</math>”&nbsp;<math>, \ldots,\!</math>&nbsp;“<math>a_n\!</math>”&nbsp;<math>\rbrace.\!</math>  Each of these signs is interpreted as denoting a logical feature, for instance, a property that objects in the universe of discourse may have or a proposition about objects in the universe of discourse.  Corresponding to the alphabet <math>\mathfrak{A}</math> there is then a set of logical features, <math>\mathcal{A} = \{ a_1, \ldots, a_n \}.</math>
 
Logical description of a universe of discourse begins with a set of logical signs.  For the sake of simplicity in a first approach, assume that these logical signs are collected in the form of a finite alphabet, <math>\mathfrak{A} = \lbrace\!</math>&nbsp;“<math>a_1\!</math>”&nbsp;<math>, \ldots,\!</math>&nbsp;“<math>a_n\!</math>”&nbsp;<math>\rbrace.\!</math>  Each of these signs is interpreted as denoting a logical feature, for instance, a property that objects in the universe of discourse may have or a proposition about objects in the universe of discourse.  Corresponding to the alphabet <math>\mathfrak{A}</math> there is then a set of logical features, <math>\mathcal{A} = \{ a_1, \ldots, a_n \}.</math>
Line 350: Line 350:  
<br>
 
<br>
   −
===Special classes of propositions===
+
===3.2. Special Classes of Propositions===
    
A ''basic proposition'', ''coordinate proposition'', or ''simple proposition'' in the universe of discourse <math>[a_1, \ldots, a_n]</math> is one of the propositions in the set <math>\{ a_1, \ldots, a_n \}.</math>
 
A ''basic proposition'', ''coordinate proposition'', or ''simple proposition'' in the universe of discourse <math>[a_1, \ldots, a_n]</math> is one of the propositions in the set <math>\{ a_1, \ldots, a_n \}.</math>
Line 368: Line 368:  
Finally, it is important to note that all of the above distinctions are relative to the choice of a particular logical basis <math>\mathcal{A} = \{ a_1, \ldots, a_n \}.</math>  For example, a singular proposition with respect to the basis <math>\mathcal{A}</math> will not remain singular if <math>\mathcal{A}</math> is extended by a number of new and independent features.  Even if one keeps to the original set of pairwise options <math>\{ a_i \} \cup \{ (a_i) \}</math> to pick out a new basis, the sets of linear propositions and positive propositions are both determined by the choice of basic propositions, and this whole determination is tantamount to the purely conventional choice of a cell as origin.
 
Finally, it is important to note that all of the above distinctions are relative to the choice of a particular logical basis <math>\mathcal{A} = \{ a_1, \ldots, a_n \}.</math>  For example, a singular proposition with respect to the basis <math>\mathcal{A}</math> will not remain singular if <math>\mathcal{A}</math> is extended by a number of new and independent features.  Even if one keeps to the original set of pairwise options <math>\{ a_i \} \cup \{ (a_i) \}</math> to pick out a new basis, the sets of linear propositions and positive propositions are both determined by the choice of basic propositions, and this whole determination is tantamount to the purely conventional choice of a cell as origin.
   −
===Differential extensions===
+
===3.3. Differential Extensions===
    
An initial universe of discourse, <math>A^\circ,</math> supplies the groundwork for any number of further extensions, beginning with the ''first order differential extension'', <math>\operatorname{E}A^\circ.</math>  The construction of <math>\operatorname{E}A^\circ</math> can be described in the following stages:
 
An initial universe of discourse, <math>A^\circ,</math> supplies the groundwork for any number of further extensions, beginning with the ''first order differential extension'', <math>\operatorname{E}A^\circ.</math>  The construction of <math>\operatorname{E}A^\circ</math> can be described in the following stages:
12,080

edits

Navigation menu