Related papers: Extended Nonstandard Neutrosophic Logic, Set, and …
This book is organized into seven chapters. Chapter one is introductory in content. The notion of neutrosophic set linear algebras and neutrosophic neutrosophic set linear algebras are introduced and their properties analysed in chapter…
In this article we describe mathematically relevant extensions to Normaliz that were added to it during the support by the DFG SPP "Algorithmische und Experimentelle Methoden in Algebra, Geometrie und Zahlentheorie": nonpointed cones,…
The well-known Lawvere category R of extended real positive numbers comes with a monoidal closed structure where the tensor product is the sum. But R has another such structure, given by multiplication, which is *-autonomous. Normed sets,…
Bilattice-based triangle provides an elegant algebraic structure for reasoning with vague and uncertain information. But the truth and knowledge ordering of intervals in bilattice-based triangle can not handle repetitive belief revisions…
We introduce the concept of braided left-symmetric bialgebras and construct cocycle bicrossproduct left-symmetric bialgebras. As an application, we solve the extending problem for left-symmetric bialgebras by using some non-abelian…
In this paper an approach to automated deduction under uncertainty,based on possibilistic logic, is proposed ; for that purpose we deal with clauses weighted by a degree which is a lower bound of a necessity or a possibility measure,…
The question of the conditions under which 1D systems support extended electronic eigenstates is addressed in a very general context. Using real space renormalisation group arguments we discuss the precise criteria for determining the…
The conventional duality analysis is employed to identify a location of a critical point on a uniform lattice without any disorder in its structure. In the present study, we deal with the random planar lattice, which consists of the…
In this paper, we consider the problem of lifted inference in the context of Prism-like probabilistic logic programming languages. Traditional inference in such languages involves the construction of an explanation graph for the query and…
We provide the first (non-labelled) sequent calculi for bimodal provability logics with "usual" provability predicates. In particular, we introduce calculi for the logics CS, CSM and ER. Additionally, we present non-wellfounded versions of…
We present a detailed analysis of the nature of electronic eigenfunctions in one-dimensional quasi-periodic chains based on a clustering idea recently introduced by us [Sil et al., Phys. Rev. {\bf B 48}, 4192 (1993) ], within the framework…
The goal of this present manuscript is to introduce the reader to the nonstandard method and to provide an overview of its most prominent applications in Ramsey theory and combinatorial number theory.
We establish the Lyndon interpolation property for basic lattice expansion logics (LE-logics) in arbitrary signatures using display calculi. Our approach is constructive, yielding interpolants algorithmically from derivations, and modular,…
In this note we collect several observations on state extensions. They may be instrumental to anyone who pursues the theory of quantum logics. In particular, we find out when extensions (resp. signed extensions) exist in the "concrete"…
In probabilistic logic entailments, even moderate size problems can yield linear constraint systems with so many variables that exact methods are impractical. This difficulty can be remedied in many cases of interest by introducing a three…
Lie's linearizability criteria for scalar second-order ordinary differential equations had been extended to systems of second-order ordinary differential equations by using geometric methods. These methods not only yield the linearizing…
One way of interpreting a left Kan extension is as taking a kind of "partial colimit", whereby one replaces parts of a diagram by their colimits. We make this intuition precise by means of the "partial evaluations" sitting in the so-called…
Belnap-Dunn logic, also knows as the logic of First-Degree Entailment, is a logic that can serve as the underlying logic of theories that are inconsistent or incomplete. For various reasons, different expansions of Belnap-Dunn logic with…
Nonmonotonic reasoning is a pattern of reasoning that allows an agent to make and retract (tentative) conclusions from inconclusive evidence. This paper gives a possible-worlds interpretation of the nonmonotonic reasoning problem based on…
We combine integer linear programming and recent advances in Monadic Second-Order model checking to obtain two new algorithmic meta-theorems for graphs of bounded vertex-cover. The first shows that cardMSO1, an extension of the well-known…