• Journal of the Korea Society for Simulation
• /
• v.29 no.2
• /
• pp.63-72
• /
• 2020

Tank, which is a representative ground weapon system, is one of the most important weapon systems in each country. For the cost-effective acquisition of a tank based on scientific analysis, the operational concept and effectiveness should be studied based on engagement simulation technology. Besides physical capabilities including maneuver and communication, logical models including decision-making of a tank commander should be developed systematically. This paper describes a method to model a tank for engagement simulation based on Base System Model(BSM), which is the standard architecture of the weapon system model in AddSIM, an integrated engagement simulation software. In particular, a method is proposed to develop logical models by hierarchical and modular approach based on human decision-making model. The proposed method applies a mathematical formalism called DEVS(Discrete EVent system Specification) formalism. It is expected that the proposed method is widely used to study the operational concept and analyze the effectiveness of tanks in the Korean military in the future.

• The Journal of the Korea Contents Association
• /
• v.19 no.2
• /
• pp.591-604
• /
• 2019

This study examines the process of internalization and elaboration of the logic of competition in the post-IMF era through the genealogy of the survival program. Post-IMF is based on disaster reality, which reveals a specific emotional structure related to the competition, if the narrative of overcoming the IMF event finds narrative models that can be sufficiently reconciled between communityism and individual success. This study also examines the process of disaster preparedness through survival form and narrative structure embedded in such form. Thus, this study reconstructed the diachronic change to track the change of the survival program and the subsequent narrative change. Relative to the time of the healing-mentor, the survival program seems to be declining, but rather seems to have created a new transition through the logic of self-development contained in the healing-mentoring discourse. this logic leads to be ghettoized hierarchy of preferences. Now, the survival program is to perform fantastic surrogate satisfaction by delegating competition to a narrow self-directed area rather than to a big empathy within the community.

• Korean Journal of Logic
• /
• v.17 no.1
• /
• pp.33-70
• /
• 2014

We still do not know against what histocial/philosophical background and motivation was Tarski's definition of logical consequence introduced, even if it has had such a strong influence. In view of the centrality of the notion of logical consequence in logic and philosophy of logic, it is rather shocking. There must be various intertwined reasons to blame for this uncomfortable situation. There has been remarkable progress achieved recently on the history of analytic philosophy and modern logic. In view of the recent developments of the controversies involved, however, we will have to wait years to resolve all this uneasiness. In this gloomy situation, Douglas Patterson's recent study of Tarski's philosophy of language and logic seems to have the potential to turn out to be a ground breaking achievement. [Patterson (2012)] This article aims at reporting the state-of-the-art in this problem area, and fathoming the future directions of research by examining critically some unclear components of Patterson's study.

• Korean Journal of Logic
• /
• v.13 no.2
• /
• pp.167-201
• /
• 2010

This paper aims to scrutinize the possibility of mereology as philosophically satisfiable metalogic. Motivation for this is straightforward. As I see, a traditional approach to metalogic presented in the name of mathematical logic posits the existence of mathematical entities such as sets, functions, models, etc. to give definitions of logical concepts like logical consequence. As a result, whenever logic is used in any individual sciences, this set-theoretical metalogic cannot but add these mathematical entities to the domain of them. This fact makes this approach contradict to the ontological conservativeness of logic. Mereology, however, has been alleged to be ontologically innocent, while it is a formal system very similar to set theory. So it may well be that some people thought of mereology as a good substitute for set theoretic metalanguage and concepts for ontologically neutral metalogic. Unfortunately, when we look into argument for the ontological innocence of mereology, we can find that mereological entities such as mereological sums or fusions are not ontologically neutral. Thus we can conclude that mereological approach to metalogic is not promising at all.

• Journal for History of Mathematics
• /
• v.22 no.4
• /
• pp.129-144
• /
• 2009

The purpose of this study is what exactly De Morgan contributed to abstract algebra and mathematical logic. He recognised the purely symbolic nature of algebra and was aware of the existence of algebras other than ordinary algebra. He madealgebra as a science by introducing the ordered field and made the base for abstract algebra. He was one of the reformer of classical mathematical logic. Looking into De Morgan's works, we made it clear that the developments of algebra and mathematical logic in 19C.

• Korean Journal of Optics and Photonics
• /
• v.13 no.1
• /
• pp.84-87
• /
• 2002

By using SOA (Semiconductor Optical Amplifier), all-optical XOR gate has been demonstrated at 5 Gb/s in RZ format. Firstly, Boolean AB-and Boolean AB have been obtained. Then, Boolean AB and Boolean AB have been combined to achieve the all-optical XOR gate, which has Boolean logic of AB+AB.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.22 no.2
• /
• pp.25-30
• /
• 1985

This paper proposes an algorithm to simplify Boolean functions into near minimal sum-of-products for Programmable Logic Arrays. In contrast to the conventional procedures, where the execution time depends on the number of variables, the execution time by this procedure depends on the degree of consensus of base minterms. Thus as the number of variables is increased, the difference of CPU time becomes larger using this new Procedure than using other procedures and consequently the executable range of input function increasing. The algorithm has been implemented on CYEER 170-740 and it's results were compared with those using Arvalo's algorithm.

• Proceedings of the Korean Information Science Society Conference
• /
• 2000.10a
• /
• pp.184-186
• /
• 2000

이 연구에서는 텍스트 문서를 웹에서 HTML 문서 형태로 효율적으로 검색할 수 있는 변환 시스템을 개발하였다. 웹상에 사용자가 원하는 부분만을 HTML 문서 형태로 제공하도록 문서의 논리적인 구조를 파악하며 그 구조에 대한 정보와 각 논리 단위에 해당하는 부분의 범위 정보를 저장할 수 있도록 관계형 데이터베이스 스키마를 개발하였다. 개발한 시스템은 문서의 목차 테이블을 자동으로 구축하고 목차 테이블의 각 항목에 하이퍼링크를 설정한다. 문서를 웹에서 검색하기 위한 첫 화면은 목차 테이블이며, 그 중 한 항목이 클릭되면 그 항목의 내용이 제공되고, 만약 그 하위에 속하는 항목들이 있다면 그들에 대한 링크를 역시 제공한다. 이러한 방법으로 한 문서의 전체를 그 논리 구조에 따라 사용자가 원하는 대로 검색할 수 있다. 이 시스템은 멀티미디어 타입의 문서를 하이퍼미디어 문서 형식으로 변환할 수 있도록 확장하여 보완 개발될 수 있고, 장래에 전자 출판과 전자 도서관에 응용될 수 있다.

• Korean Journal of Logic
• /
• v.14 no.3
• /
• pp.101-137
• /
• 2011

Based on his analysis of judgement forms in intuitionistic type theory, Martin-L$\ddot{o}$f claims that the usual logical laws and interesting mathematical judgements are synthetic, not analytic. He further claims that the logic of analytic judgements is decidable and complete, while the logic of synthetic judgements is undecidable and incomplete. The aim of this article is to clarify and examine his claims. In section 1, I explain and give some comments on the monomorphic version of intuitionistic type theory. In section 2, after clarifying Martin-L$\ddot{o}$f's distinction between analytic and synthetic judgements, I examine some possible objections to it and evaluate the thesis that the usual logical laws and interesting mathematical judgements are synthetic. In section 3, I clarify and examine the thesis that the logic of analytic judgements is decidable and complete, while the logic of synthetic judgements is undecidable and incomplete.

• ETRI Journal
• /
• v.9 no.1
• /
• pp.25-30
• /
• 1987

EDAS_P 시스팀을 이루고 있는 8개의 tool 중 symbol의 모양을 정의하는 SYMED_P, 전자회로도를 입력시키는 SCHED_P, 그리고 논리 검증결과를 그림으로 표현하는 WAVGR_P는 graphics 기술을 이용하여 정보를 취급한다. 본고에서는 그림으로 정보를 표현하는데 필요한 기술을 발췌식으로 선별하여 소개하였으며, 그림정보를 표현하는 형식 및 정보의 종류를 설명한다.