Related papers: A Canonical Fuzzy Logic
In this paper, we propose the theory of fuzzy limit of fuzzy function depending on the Altai principle and using the representation theorem (resolution principle) to run the fuzzy arithmetic
In the context of fuzzy logic, ordinal sums provide a method for constructing new functions from existing functions, which can be triangular norms, triangular conorms, fuzzy negations, copulas, overlaps, uninorms, fuzzy implications, among…
The Boolean logic of subsets, usually presented as `propositional logic,' is considered as being "classical" while intuitionistic logic and the many sublogics and off-shoots are "non-classical." But there is another mathematical logic, the…
We consider a proper propositional quantum logic and show that it has multiple disjoint lattice models, only one of which is an orthomodular lattice (algebra) underlying Hilbert (quantum) space. We give an equivalent proof for the classical…
One classical theory, as determined by an equation of motion or set of classical trajectories, can correspond to many unitarily {\em in}equivalent quantum theories upon canonical quantization. This arises from a remarkable ambiguity, not…
Computability logic is a formal theory of computability. The earlier article "Introduction to cirquent calculus and abstract resource semantics" by Japaridze proved soundness and completeness for the basic fragment CL5 of computability…
Presented, in this monograph, are the results of the U. S. Naval Academy Mathematical Logic Course Project. The propositional and predicate calculus is presented in a unique manner. All aspects are rigorously established using the the…
The propositional logic is generalized on the real numbers field. The logical analog of the Bernoulli independent tests scheme is constructed. The variant of the nonstandard analysis is adopted for the definition of the logical function,…
Based on the ideas of quantum theory of open systems (QTOS) we propose the consistent approach to study probabilistic many-valued propositional logic of intelligent devices that are composed from separate but interconnected logical units.…
In this paper we will see deductive systems for classical propositional and predicate logic in the calculus of structures. Like sequent systems, they have a cut rule which is admissible. In addition, they enjoy a top-down symmetry and some…
Fuzzy answer set programming (FASP) combines two declarative frameworks, answer set programming and fuzzy logic, in order to model reasoning by default over imprecise information. Several connectives are available to combine different…
We propose a categorial grammar based on classical multiplicative linear logic. This can be seen as an extension of abstract categorial grammars (ACG) and is at least as expressive. However, constituents of {\it linear logic grammars (LLG)}…
Logical gates studied in quantum computation suggest a natural logical abstraction that gives rise to a new form of unsharp quantum logic. We study the logical connectives corresponding to the following gates: the Toffoli gate, the NOT and…
In this work, we first define intuitionistic fuzzy parametrized soft sets (intuitionistic FP-soft sets) and study some of their properties. We then introduce an adjustable approaches to intuitionistic FP-soft sets based decision making. We…
The process of canonical quantization is redefined so that the classical and quantum theories coexist when \hbar>0, just as they do in the real world. This analysis not only supports conventional procedures, it also reveals new quantization…
Continuous logic extends the multi-valued Lukasiewicz logic by adding a halving operator on propositions. This extension is designed to give a more satisfactory model theory for continuous structures. The semantics of these logics can be…
This paper presents a simple decidable logic of functional dependence LFD, based on an extension of classical propositional logic with dependence atoms plus dependence quantifiers treated as modalities, within the setting of generalized…
This paper presents a soundness and completeness proof for propositional intuitionistic calculus with respect to the semantics of computability logic. The latter interprets formulas as interactive computational problems, formalized as games…
Probability theory as extended logic is completed such that essentially any probability may be determined. This is done by considering propositional logic (as opposed to predicate logic) as syntactically suffcient and imposing a symmetry…
This paper introduces Logical Credal Networks, an expressive probabilistic logic that generalizes many prior models that combine logic and probability. Given imprecise information represented by probability bounds and conditional…