Results 21 to 30 of about 73,209 (264)
This development research aims to determine the feasibility of using Mathematical Logic Pipe teaching aid (Pilogmath) on mathematical logic material at SMA Negeri 1 Tanah Luas in terms of validity, practicality, and attractiveness.
Khairun Nisa, Eri Saputra, M Mursalin
doaj +1 more source
Bodily Complexity: Integrated Multicellular Organizations for Contraction-Based Motility
Compared to other forms of multicellularity, the animal case is unique. Animals—barring some exceptions—consist of collections of cells that are connected and integrated to such an extent that these collectives act as unitary, large free-moving entities ...
Argyris Arnellos +2 more
doaj +1 more source
Products of ‘transitive” modal logics
AbstractWe solve a major open problem concerning algorithmic properties of products of ‘transitive’ modal logics by showing that products and commutators of such standard logics asK4,S4,S4.1,K4.3,GL, orGrzare undecidable and do not have the finite model property. More generally, we prove that no Kripke complete extension of the commutator [K4, K4] with
David Gabelaia +3 more
openaire +4 more sources
A Note on Drastic Product Logic [PDF]
The drastic product $*_D$ is known to be the smallest $t$-norm, since $x *_D y = 0$ whenever $x, y < 1$. This $t$-norm is not left-continuous, and hence it does not admit a residuum. So, there are no drastic product $t$-norm based many-valued logics, in the sense of [EG01].
S. Aguzzoli, M. Bianchi, D. Valota
openaire +2 more sources
In this paper, we introduce and study a corresponding logic to equality-algebras and obtain some basic properties of this logic. We prove the soundness and completeness of this logic based on equality-algebras and local deduction theorem.
Shokoofeh Ghorbani
doaj +1 more source
A Productivity Checker for Logic Programming [PDF]
Automated analysis of recursive derivations in logic programming is known to be a hard problem. Both termination and non-termination are undecidable problems in Turing-complete languages. However, some declarative languages offer a practical work-around for this problem, by making a clear distinction between whether a program is meant to be understood ...
Ekaterina Komendantskaya +2 more
openaire +2 more sources
Provability in predicate product logic [PDF]
The paper extends the theory of BL-logics introduced by \textit{P. Hájek} in 1998, exploiting the connection of the cancellative conjunctions on BL-algebras with ordered abelian groups. Then a sentence is provable if and only if it is a tautology (completeness). Moreover, closed models and the lexicographic sums are discussed and the completeness of BL-
Michael C. Laskowski, Shirin Malekpour
openaire +2 more sources
A Novel Logic Detection Algorithm for Logic Circuits
Synthesizing logic circuits with different logic will result in different circuit structure, and then obtain different circuit performance. However, few studies have focused on logic detection technology that detects which logic is appropriate for the ...
Zhenxue He +4 more
doaj +1 more source
Stability analysis of time-delay differential systems with impulsive effect suffered by logic choice
In the field of artificial intelligence, nonlinear systems with logic function are everywhere. This paper investigates a time-delay differential system with impulsive effects suffered by logic choice.
Rong Li, Zhenhua He
doaj +1 more source
A Proof Calculus for Automated Deduction in Propositional Product Logic
Propositional product logic belongs to the basic fuzzy logics with continuous t-norms using the product t-norm (defined as the ordinary product of real numbers) on the unit interval [0,1].
Dušan Guller
doaj +1 more source

