Multi-Task Learning tries to improve the learning process of different tasks by solving them simultaneously. A popular Multi-Task Learning formulation for SVM is to combine common and task-specific parts. Other approaches rely on using a Graph Laplacian regularizer. Here we propose a combination of these two approaches that can be applied to L1, L2 and LS-SVMs. We also propose an algorithm to iteratively learn the graph adjacency matrix used in the Laplacian regularization. We test our proposal with synthetic and real problems, both in regression and classification settings. When the task structure is present, we show that our model is able to detect it, which leads to better results, and we also show it to be competitive even when this structure is not present.
{"title":"Adaptive graph Laplacian MTL L1, L2 and LS-SVMs","authors":"Carlos Ruiz, Carlos M Alaíz, José R Dorronsoro","doi":"10.1093/jigpal/jzae025","DOIUrl":"https://doi.org/10.1093/jigpal/jzae025","url":null,"abstract":"Multi-Task Learning tries to improve the learning process of different tasks by solving them simultaneously. A popular Multi-Task Learning formulation for SVM is to combine common and task-specific parts. Other approaches rely on using a Graph Laplacian regularizer. Here we propose a combination of these two approaches that can be applied to L1, L2 and LS-SVMs. We also propose an algorithm to iteratively learn the graph adjacency matrix used in the Laplacian regularization. We test our proposal with synthetic and real problems, both in regression and classification settings. When the task structure is present, we show that our model is able to detect it, which leads to better results, and we also show it to be competitive even when this structure is not present.","PeriodicalId":51114,"journal":{"name":"Logic Journal of the IGPL","volume":"22 1","pages":""},"PeriodicalIF":1.0,"publicationDate":"2024-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140314616","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Álvaro Michelena, María Teresa García Ordás, José Aveleira-Mata, David Yeregui Marcos del Blanco, Míriam Timiraos Díaz, Francisco Zayas-Gato, Esteban Jove, José-Luis Casteleiro-Roca, Héctor Quintián, Héctor Alaiz-Moretón, José Luis Calvo-Rolle
This paper aims to enhance security in IoT device networks through a visual tool that utilizes three projection techniques, including Beta Hebbian Learning (BHL), t-distributed Stochastic Neighbor Embedding (t-SNE) and ISOMAP, in order to facilitate the identification of network attacks by human experts. This work research begins with the creation of a testing environment with IoT devices and web clients, simulating attacks over Message Queuing Telemetry Transport (MQTT) for recording all relevant traffic information. The unsupervised algorithms chosen provide a set of projections that enable human experts to visually identify most attacks in real-time, making it a powerful tool that can be implemented in IoT environments easily.
{"title":"Beta Hebbian Learning for intrusion detection in networks with MQTT Protocols for IoT devices","authors":"Álvaro Michelena, María Teresa García Ordás, José Aveleira-Mata, David Yeregui Marcos del Blanco, Míriam Timiraos Díaz, Francisco Zayas-Gato, Esteban Jove, José-Luis Casteleiro-Roca, Héctor Quintián, Héctor Alaiz-Moretón, José Luis Calvo-Rolle","doi":"10.1093/jigpal/jzae013","DOIUrl":"https://doi.org/10.1093/jigpal/jzae013","url":null,"abstract":"This paper aims to enhance security in IoT device networks through a visual tool that utilizes three projection techniques, including Beta Hebbian Learning (BHL), t-distributed Stochastic Neighbor Embedding (t-SNE) and ISOMAP, in order to facilitate the identification of network attacks by human experts. This work research begins with the creation of a testing environment with IoT devices and web clients, simulating attacks over Message Queuing Telemetry Transport (MQTT) for recording all relevant traffic information. The unsupervised algorithms chosen provide a set of projections that enable human experts to visually identify most attacks in real-time, making it a powerful tool that can be implemented in IoT environments easily.","PeriodicalId":51114,"journal":{"name":"Logic Journal of the IGPL","volume":"45 1","pages":""},"PeriodicalIF":1.0,"publicationDate":"2024-03-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140204109","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
This paper proposes an innovative approach to achieving real-time polymorphic behavior detection, and its direct application to blockchain-focused smart-contracts. We devise a method based on a non-deterministic finite state machine to perform approximate pattern-matching, using a look-ahead mechanism implemented through a concept similar to that of a sliding window, and using threshold-based similarity checking at every state in the automaton. We introduce and formalize our approach, discuss the challenges we faced and then test it in a real-world environment. The experimental results obtained showed a significant speed-up of our approach, as compared to the classic similarity measures used commonly in such scenarios.
{"title":"Realtime polymorphic malicious behavior detection in blockchain-based smart contracts","authors":"Darius Galiş, Ciprian Pungilă, Viorel Negru","doi":"10.1093/jigpal/jzae016","DOIUrl":"https://doi.org/10.1093/jigpal/jzae016","url":null,"abstract":"This paper proposes an innovative approach to achieving real-time polymorphic behavior detection, and its direct application to blockchain-focused smart-contracts. We devise a method based on a non-deterministic finite state machine to perform approximate pattern-matching, using a look-ahead mechanism implemented through a concept similar to that of a sliding window, and using threshold-based similarity checking at every state in the automaton. We introduce and formalize our approach, discuss the challenges we faced and then test it in a real-world environment. The experimental results obtained showed a significant speed-up of our approach, as compared to the classic similarity measures used commonly in such scenarios.","PeriodicalId":51114,"journal":{"name":"Logic Journal of the IGPL","volume":"8 1","pages":""},"PeriodicalIF":1.0,"publicationDate":"2024-03-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140204107","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
In the present study, inspired by the studies in the literature, we consider Min matrix and its Hadamard exponential matrix family whose elements are Chebyshev polynomials of the first kind. Afterwards, we examine their various linear algebraic properties and obtain some inequalities. Furthermore, we shed light on the results we obtained to boost the clarity of our paper with the illustrative examples. In addition to all these, we give two MATLAB-R2023a codes that compute the Min matrix and the Hadamard exponential matrix with Chebyshev polynomials of the first kind entries, as well as calculate some matrix norms.
在本研究中，受文献研究的启发，我们考虑了 Min 矩阵及其哈达玛指数矩阵族，它们的元素是切比雪夫多项式的第一种。随后，我们研究了它们的各种线性代数性质，并得到了一些不等式。此外，我们还通过举例说明来阐明我们所获得的结果，以提高论文的清晰度。除此之外，我们还给出了两个 MATLAB-R2023a 代码，用于计算带有切比雪夫多项式第一类项的 Min 矩阵和 Hadamard 指数矩阵，以及计算一些矩阵规范。
{"title":"Some results for min matrices associated with Chebyshev polynomials","authors":"Fatih Yilmaz, Samet Arpaci, Aybüke Ertaş","doi":"10.1093/jigpal/jzae028","DOIUrl":"https://doi.org/10.1093/jigpal/jzae028","url":null,"abstract":"In the present study, inspired by the studies in the literature, we consider Min matrix and its Hadamard exponential matrix family whose elements are Chebyshev polynomials of the first kind. Afterwards, we examine their various linear algebraic properties and obtain some inequalities. Furthermore, we shed light on the results we obtained to boost the clarity of our paper with the illustrative examples. In addition to all these, we give two MATLAB-R2023a codes that compute the Min matrix and the Hadamard exponential matrix with Chebyshev polynomials of the first kind entries, as well as calculate some matrix norms.","PeriodicalId":51114,"journal":{"name":"Logic Journal of the IGPL","volume":"67 1","pages":""},"PeriodicalIF":1.0,"publicationDate":"2024-03-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140204291","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Oscar Llorente-Vazquez, Igor Santos-Grueiro, Iker Pastor-Lopez, Pablo Garcia Bringas
Software vulnerabilities are the root cause for a multitude of security problems in computer systems. Owing to their efficiency and tight control over low-level system resources, the C and C++ programming languages are extensively used for a myriad of purposes, from implementing operating system kernels to user-space applications. However, insufficient or improper memory management frequently leads to invalid memory accesses, eventually resulting in memory corruption vulnerabilities. These vulnerabilities are used as a foothold for elaborated attacks that bypass existing defense methods. In this paper, we summarise the main memory safety violation types (i.e. memory errors), and analyse how they are exploited by attackers and the main mitigation methods proposed in the research community. We further systematise the most relevant techniques with regards to memory corruption identification in current programs.
软件漏洞是计算机系统中众多安全问题的根源。由于 C 和 C++ 编程语言的高效性和对底层系统资源的严格控制，它们被广泛应用于从操作系统内核到用户空间应用程序等众多领域。然而，内存管理不足或不当经常导致无效内存访问，最终造成内存损坏漏洞。这些漏洞被用作精心设计的攻击的立足点，从而绕过现有的防御方法。在本文中，我们总结了主要的内存安全违规类型（即内存错误），分析了攻击者如何利用这些漏洞以及研究界提出的主要缓解方法。我们将进一步系统化当前程序中与内存损坏识别相关的最重要技术。
{"title":"Detection, exploitation and mitigation of memory errors","authors":"Oscar Llorente-Vazquez, Igor Santos-Grueiro, Iker Pastor-Lopez, Pablo Garcia Bringas","doi":"10.1093/jigpal/jzae008","DOIUrl":"https://doi.org/10.1093/jigpal/jzae008","url":null,"abstract":"Software vulnerabilities are the root cause for a multitude of security problems in computer systems. Owing to their efficiency and tight control over low-level system resources, the C and C++ programming languages are extensively used for a myriad of purposes, from implementing operating system kernels to user-space applications. However, insufficient or improper memory management frequently leads to invalid memory accesses, eventually resulting in memory corruption vulnerabilities. These vulnerabilities are used as a foothold for elaborated attacks that bypass existing defense methods. In this paper, we summarise the main memory safety violation types (i.e. memory errors), and analyse how they are exploited by attackers and the main mitigation methods proposed in the research community. We further systematise the most relevant techniques with regards to memory corruption identification in current programs.","PeriodicalId":51114,"journal":{"name":"Logic Journal of the IGPL","volume":"19 1","pages":""},"PeriodicalIF":1.0,"publicationDate":"2024-03-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140150136","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Context: Predicting security and trust vulnerabilities and issues is crucial for IoT interconnected systems and ecosystems, especially when integrating new, third-party or open-source components. Objective: One way to ensure timely predictions is by using a smart monitoring framework to continuously verify functional and non-functional property violations during the executions of the systems and their components. Method: This paper presents a set of guidelines for the Smart Monitoring Framework definition and its application process. Results and Conclusion: The paper provides the reference architecture of the Smart Monitoring Framework and its possible implementation to promptly detect suspicious behavior or property violations. The paper also illustrates how the provided implementation satisfies the defined guidelines by design.
{"title":"Towards enhanced monitoring framework with smart predictions","authors":"Antonello Calabrò, Said Daoudagh, Eda Marchetti","doi":"10.1093/jigpal/jzae010","DOIUrl":"https://doi.org/10.1093/jigpal/jzae010","url":null,"abstract":"Context: Predicting security and trust vulnerabilities and issues is crucial for IoT interconnected systems and ecosystems, especially when integrating new, third-party or open-source components. Objective: One way to ensure timely predictions is by using a smart monitoring framework to continuously verify functional and non-functional property violations during the executions of the systems and their components. Method: This paper presents a set of guidelines for the Smart Monitoring Framework definition and its application process. Results and Conclusion: The paper provides the reference architecture of the Smart Monitoring Framework and its possible implementation to promptly detect suspicious behavior or property violations. The paper also illustrates how the provided implementation satisfies the defined guidelines by design.","PeriodicalId":51114,"journal":{"name":"Logic Journal of the IGPL","volume":"15 1","pages":""},"PeriodicalIF":1.0,"publicationDate":"2024-03-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140156892","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Digitization of every daily procedure requires trustworthy verification schemes. People tend to overlook the security of the passwords they use, i.e. they use the same password on different occasions, they neglect to change them periodically or they often forget them. This raises a major security issue, especially for elderly people who are not familiar with modern technology and its risks and challenges. To overcome these drawbacks, biometric factors were utilized, and nowadays, they have been widely adopted due to their convenience of use and ease of hardware installation. Many biometric-based authentication schemes were proposed, but despite the advantages that they offer, recent research has shown that biometrics by itself cannot be considered as an inviolable technique. Recently, we have proposed StegoPass, a novel method that obtains the 68 facial points of a user and utilizes them as a stego message to an image. This produced stego image was the password. Although the experiments conducted showed maximum security, it would be challenging to enhance the robustness of the proposed model for even more attacks. This paper examines the utilization of multimodal biometrics as the secret message embedded in the image. More specifically, besides the extraction of the facial points, we extract the unique minutiae moments and combine them in a feature vector. This feature vector is then embedded in the image. Two different datasets were used, and the security of the method was tested against state-of-the-art deep learning models, i.e. generative adversarial networks, to test whether the image could be digitally synthesized and fool the proposed verification scheme. The results proved that the new enhanced version of StegoPass offers an extremely secure method as its predecessor.
{"title":"Exploiting multimodal biometrics for enhancing password security","authors":"Konstantinos Karampidis","doi":"10.1093/jigpal/jzae009","DOIUrl":"https://doi.org/10.1093/jigpal/jzae009","url":null,"abstract":"Digitization of every daily procedure requires trustworthy verification schemes. People tend to overlook the security of the passwords they use, i.e. they use the same password on different occasions, they neglect to change them periodically or they often forget them. This raises a major security issue, especially for elderly people who are not familiar with modern technology and its risks and challenges. To overcome these drawbacks, biometric factors were utilized, and nowadays, they have been widely adopted due to their convenience of use and ease of hardware installation. Many biometric-based authentication schemes were proposed, but despite the advantages that they offer, recent research has shown that biometrics by itself cannot be considered as an inviolable technique. Recently, we have proposed StegoPass, a novel method that obtains the 68 facial points of a user and utilizes them as a stego message to an image. This produced stego image was the password. Although the experiments conducted showed maximum security, it would be challenging to enhance the robustness of the proposed model for even more attacks. This paper examines the utilization of multimodal biometrics as the secret message embedded in the image. More specifically, besides the extraction of the facial points, we extract the unique minutiae moments and combine them in a feature vector. This feature vector is then embedded in the image. Two different datasets were used, and the security of the method was tested against state-of-the-art deep learning models, i.e. generative adversarial networks, to test whether the image could be digitally synthesized and fool the proposed verification scheme. The results proved that the new enhanced version of StegoPass offers an extremely secure method as its predecessor.","PeriodicalId":51114,"journal":{"name":"Logic Journal of the IGPL","volume":"96 1","pages":""},"PeriodicalIF":1.0,"publicationDate":"2024-03-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140150176","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Rudolf Erdei, Daniela Delinschi, Oliviu Matei, Laura Andreica
In this paper we present a set of good practices in the design of a security-centric architecture for a Communication Channel that can be used to secure a Loosely-Coupled distributed platform, over unreliable communication mediums. The proposed practices are derived from designing a complete architecture that is modular and designed to support principles of Service Oriented Architecture (SOA) and the common functional requirements of a wide range of applications, including cybersecurity, smart power grids and industrial Internet of Things (IoT). The architecture was developed and implemented as part of the BIECO project, and is based around open standards such as Open Platform Communications United Architecture (OPC-UA). The key feature of the architecture is that it enables secure asynchronous near-real-time communication between a large number of nodes in a multimodal setup, without the need of any Service to know its place within the tool-chain. Based on our experience with building this system and based on the good results obtained, we are presenting a list of lessons learnt, recommendations for better communication channel modules within loosely coupled distributed systems.
{"title":"Good practices in designing a communication channel architecture for secure async flexible distributed collaboration","authors":"Rudolf Erdei, Daniela Delinschi, Oliviu Matei, Laura Andreica","doi":"10.1093/jigpal/jzae012","DOIUrl":"https://doi.org/10.1093/jigpal/jzae012","url":null,"abstract":"In this paper we present a set of good practices in the design of a security-centric architecture for a Communication Channel that can be used to secure a Loosely-Coupled distributed platform, over unreliable communication mediums. The proposed practices are derived from designing a complete architecture that is modular and designed to support principles of Service Oriented Architecture (SOA) and the common functional requirements of a wide range of applications, including cybersecurity, smart power grids and industrial Internet of Things (IoT). The architecture was developed and implemented as part of the BIECO project, and is based around open standards such as Open Platform Communications United Architecture (OPC-UA). The key feature of the architecture is that it enables secure asynchronous near-real-time communication between a large number of nodes in a multimodal setup, without the need of any Service to know its place within the tool-chain. Based on our experience with building this system and based on the good results obtained, we are presenting a list of lessons learnt, recommendations for better communication channel modules within loosely coupled distributed systems.","PeriodicalId":51114,"journal":{"name":"Logic Journal of the IGPL","volume":"1 1","pages":""},"PeriodicalIF":1.0,"publicationDate":"2024-03-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140150138","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Two new propositional non-classical logics, referred to as symmetric intuitionistic logic (SIL) and conflated intuitionistic logic (CIL), are introduced as indexed and non-indexed Gentzen-style sequent calculi. SIL is regarded as a natural hybrid logic combining intuitionistic and dual-intuitionistic logics, whereas CIL is regarded as a variant of intuitionistic paraconsistent logic with conflation and without paraconsistent negation. The cut-elimination theorems for SIL and CIL are proved. CIL is shown to be conservative over SIL.
本文介绍了两种新的命题非经典逻辑，分别称为对称直觉逻辑（SIL）和混同直觉逻辑（CIL），作为有索引和无索引的根岑式序列计算。SIL 被视为结合了直观逻辑和双直观逻辑的自然混合逻辑，而 CIL 则被视为直观准一致逻辑的一种变体，具有混淆性，但没有准一致的否定。证明了 SIL 和 CIL 的割除定理。证明了 CIL 比 SIL 保守。
{"title":"Symmetric and conflated intuitionistic logics","authors":"Norihiro Kamide","doi":"10.1093/jigpal/jzae001","DOIUrl":"https://doi.org/10.1093/jigpal/jzae001","url":null,"abstract":"Two new propositional non-classical logics, referred to as symmetric intuitionistic logic (SIL) and conflated intuitionistic logic (CIL), are introduced as indexed and non-indexed Gentzen-style sequent calculi. SIL is regarded as a natural hybrid logic combining intuitionistic and dual-intuitionistic logics, whereas CIL is regarded as a variant of intuitionistic paraconsistent logic with conflation and without paraconsistent negation. The cut-elimination theorems for SIL and CIL are proved. CIL is shown to be conservative over SIL.","PeriodicalId":51114,"journal":{"name":"Logic Journal of the IGPL","volume":"39 1","pages":""},"PeriodicalIF":1.0,"publicationDate":"2024-03-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140037889","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
In proof-theoretic semantics, meaning is based on inference. It may seen as the mathematical expression of the inferentialist interpretation of logic. Much recent work has focused on base-extension semantics, in which the validity of formulas is given by an inductive definition generated by provability in a ‘base’ of atomic rules. Base-extension semantics for classical and intuitionistic propositional logic have been explored by several authors. In this paper, we develop base-extension semantics for the classical propositional modal systems $K$, $KT$, $K4$ and $S4$, with $square $ as the primary modal operator. We establish appropriate soundness and completeness theorems and establish the duality between $square $ and a natural presentation of $lozenge $. We also show that our semantics is in its current form not complete with respect to euclidean modal logics. Our formulation makes essential use of relational structures on bases.
{"title":"Base-extension semantics for modal logic","authors":"Timo Eckhardt, David J Pym","doi":"10.1093/jigpal/jzae004","DOIUrl":"https://doi.org/10.1093/jigpal/jzae004","url":null,"abstract":"In proof-theoretic semantics, meaning is based on inference. It may seen as the mathematical expression of the inferentialist interpretation of logic. Much recent work has focused on base-extension semantics, in which the validity of formulas is given by an inductive definition generated by provability in a ‘base’ of atomic rules. Base-extension semantics for classical and intuitionistic propositional logic have been explored by several authors. In this paper, we develop base-extension semantics for the classical propositional modal systems $K$, $KT$, $K4$ and $S4$, with $square $ as the primary modal operator. We establish appropriate soundness and completeness theorems and establish the duality between $square $ and a natural presentation of $lozenge $. We also show that our semantics is in its current form not complete with respect to euclidean modal logics. Our formulation makes essential use of relational structures on bases.","PeriodicalId":51114,"journal":{"name":"Logic Journal of the IGPL","volume":"15 1","pages":""},"PeriodicalIF":1.0,"publicationDate":"2024-03-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140017349","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：