진릿값 관계연산자를 통한 형이상학적 being의 JTB-급 정식화

This paper receives a pair of people S and proposition P as input and outputs the true value (T/U) and the relationship operators (*) and (/) Through it, 'know' and 'unknow' are formalized with the conditions of JTB (justification, true, and faith). (*)'S being is the JTB success condition It is defined as G as an intersection (AND), and the being of (/) is defined as N as a female set (negation). Justification serm J(S,P) is embodied as the truth value function L(S,P) judged through the existence of evidence E, and the area of the metaphysical proposition It defines the metaphysical knowledge-being G_M by introducing the display classifier Meta(P). Finally, formalization Examine category errors (realization) and semantic dependence problems that may occur in the process.