scholarly journals SET THEORY MODEL FOR THE ASSESSMENT OF THE CONTAINER TERMINAL�S OPERATIONAL RESOURCES

Author(s):  
Aleksandr L. Kuznetsov ◽  
◽  
Anton D. Semenov ◽  
Victoria N. Shcherbakova-Slyusarenko ◽  
◽  
...  
Author(s):  
Neha Gupta ◽  
Ritu Prasad ◽  
Praneet Saurabh ◽  
Bhupendra Verma

Author(s):  
John P. Burgess

This article explores the role of logic in philosophical methodology, as well as its application in philosophy. The discussion gives a roughly equal coverage to the seven branches of logic: elementary logic, set theory, model theory, recursion theory, proof theory, extraclassical logics, and anticlassical logics. Mathematical logic comprises set theory, model theory, recursion theory, and proof theory. Philosophical logic in the relevant sense is divided into the study of extensions of classical logic, such as modal or temporal or deontic or conditional logics, and the study of alternatives to classical logic, such as intuitionistic or quantum or partial or paraconsistent logics. The nonclassical consists of the extraclassical and the anticlassical, although the distinction is not clearcut.


2020 ◽  
Author(s):  
Dan Constantin Radulescu

One presents a simple Set Theory Model (STM) of the valid categorical arguments (VCAs) - a proper superset of the valid (categorical) syllogisms (VS). The main STM initiator was George Boole, who worked with a “universe of discourse”, U, which contains the pairwise complementary sets, or categorical terms, S,S'(non-S),P,P'(non-P),M,M'(non-M), and is thus partitioned into eight subsets: SPM:= S∩P∩M, S'PM,...,S'P'M'. In STM all superfluous syllogistic figures are disregarded, and both the positive terms, S,P,M, and the negative terms, S',P',M', are allowed to appear in the pairs of categorical premises (PCPs) and their entailed logical consequences (LCs). This increases the number of distinct P (and S) premises from the six formulable via only positive terms, to eight, and the number of distinct PCPs from the 36 appearing in the Classic Categorical Syllogistic (CCS), to the 64 appearing in the STM. Out of the latter 64 PCPs, only 32 PCPs entail LCs and thus generate VCAs. The PCPs, VCAs, and the VS, split into four types. In short, one may say that each type contains eight VCAs, which can be re-written, via the term relabelings, p:= P↔P', s:=S↔S', m:=M↔M', and their compositions, ps, pm, sm, psm, as any other VCA of the same type. Thus the VCAs Barbara, Darapti, Darii and Disamis, can be chosen as type representatives for both VCAs and VS, and, via one of the above term relabelings, any VCA or VS can be re-written, without changing their PCP or LC contents, as either a Barbara, Darapti, Darii, or Disamis. Besides the VCAs and their precise LCs, (out of which the middle term was not eliminated), one discusses simple/biliteral VCA sorites, empty set constraints (ESC), “VCA distribution conservation”, and other Rules of Valid Categorical Arguments (RofVCA) which are “VCA generalized versions” of some of the Rules of Valid Syllogisms (RofVS). Both STM and CCS follow, for PCP classification purposes, the convention that the P term has to appear in the firstly listed premise. One compares the CCS, which defines the VS as PCPs formulable via only positive terms, whose entailed LCs are restricted to only the statements A(S,P), E(S,P), I(S,P), O(S,P), with the STM, whose VCAs also entail LCs of these other formats: A(P,S), E(S',P'), I(S',P'), O(P,S).


2019 ◽  
Author(s):  
Dan Constantin Radulescu

One presents the Set Theory Model (STM) of the valid categorical arguments (VCAs) as an improvement on the Classic Categorical Syllogistic (CCS) approach to the valid (categorical) syllogisms (VS) – a proper subset of the VCAs. The STM was initially developed by George Boole and Lewis Carroll, who worked with a “universe of discourse”, U, which contains the pairwise complementary sets, or categorical terms, S,S'(non-S),P,P'(non-P),M,M'(non-M), and is thus partitioned into 8 subsets: SPM:= S∩P∩M, S'PM,...,S'P'M'. In STM both the positive terms, S,P,M, and the negative terms, S',P',M', are allowed to appear in the pairs of categorical premises (PCPs) and their entailed logical consequences (LCs). One thus counts 64 distinct PCPs, out of which only 32 PCPs generate VCAs, and 32 PCPs do not entail any LC. By comparison, CCS admits PCPs worded only via the positive terms S,P,M, and accepts as VS LCs only the statements E(S,P), I(S,P), A(S,P), or O(S,P). It is easier to see on the VCA set, than on its VS proper subset, that there are only three distinct types of VCAs, (and of VS), and that all the VCAs of the same type are equivalent modulo the term relabelings p:= P↔P', s:=S↔S', m:=M↔M' and their compositions. Besides the VCAs and their LCs, one discusses “VCA sorites”, “VCA distribution conservation”, empty set constraints (ESC), and “VCA generalized versions” of the Rules of Valid Syllogisms (RofVS).


Sign in / Sign up

Export Citation Format

Share Document