Results 51 to 60 of about 74,540 (198)
Trilattice-Based Access Control Models: How to Secure Current Computer Network
Designing security, from the hardware level, is essential to ensure the integrity of the intelligent cyber-physical infrastructure that is the Industrial Internet of Things (IIoT). If intelligent cyber-physical infrastructure fails to do the right things
Kucherov Mikhail M., Bogulskaya Nina A.
doaj +1 more source
Logic Column 18: Alternative Logics: A Book Review [PDF]
This article discusses two books on the topic of alternative logics in science: "Deviant Logic", by Susan Haack, and "Alternative Logics: Do Sciences Need Them?", edited by Paul Weingartner.
arxiv
A survey of paraconsistent logics [PDF]
A survey of paraconsistent logics that are prominent representatives of the different approaches that have been followed to develop paraconsistent logics is provided. The paraconsistent logics that will be discussed are an enrichment of Priest's logic LP, the logic RM3 from the school of relevance logic, da Costa's logics Cn, Jaskowski's logic D2, and ...
arxiv
Minimal Partial Ultraclones on a Two-Element Set
Set of functions from a finite set A to set of all subsets of A is a natural generalization of the set of many-valued functions on A (k-valued logic functions).
S.A. Badmaev, I.K. Sharankhaev
doaj
The groupoid-based logic for lattice effect algebras
The aim of the paper is to establish a certain logic corresponding to lattice effect algebras. First, we answer a natural question whether a lattice effect algebra can be represented by means of a groupoid-like structure.
Chajda, I., Länger, H., Paseka, J.
core +2 more sources
Non-deterministic algebraization of logics by swap structures1 [PDF]
Multialgebras have been much studied in mathematics and in computer science. In 2016 Carnielli and Coniglio introduced a class of multialgebras called swap structures, as a semantic framework for dealing with several Logics of Formal Inconsistency that ...
Coniglio, Marcelo E.+2 more
core
Propositional Mixed Logic: Its Syntax and Semantics [PDF]
In this paper, we present a propositional logic (called mixed logic) containing disjoint copies of minimal, intuitionistic and classical logics. We prove a completeness theorem for this logic with respect to a Kripke semantics. We establish some relations between mixed logic and minimal, intuitionistic and classical logics.
arxiv
An Under-Approximate Relational Logic: Heralding Logics of Insecurity, Incorrect Implementation & More [PDF]
Recently, authors have proposed under-approximate logics for reasoning about programs. So far, all such logics have been confined to reasoning about individual program behaviours. Yet there exist many over-approximate relational logics for reasoning about pairs of programs and relating their behaviours. We present the first under-approximate relational
arxiv
A Unified Framework For Three-Valued Semantical Treatments of Logic Programming [PDF]
Based on Fiting\u27s Φ operator a unified framework for three-valued semantics of logic programming is presented. The truth space used in the framework is the class of partial interpretations.
Yang, Feng
core +1 more source
Characterization of Strongly Equivalent Logic Programs in Intermediate Logics [PDF]
The non-classical, nonmonotonic inference relation associated with the answer set semantics for logic programs gives rise to a relationship of 'strong equivalence' between logical programs that can be verified in 3-valued Goedel logic, G3, the strongest non-classical intermediate propositional logic (Lifschitz, Pearce and Valverde, 2001). In this paper
arxiv