Relative expressiveness of the edge/adjacency language for graph theory
Relative sets and rough sets
In this paper, by defining a pair of classical sets as a relative set, an extension of the classical set algebra which is a counterpart of Belnap's four-valued logic is achieved. Every relative set partitions all objects into four distinct regions corresponding to four truth-values of Belnap's logic. Like truth-values of Belnap's logic, relative sets have two orderings; one is an order of inclusion and the other is an order of knowledge or information. By defining a rough set as a pair of definable...
Relevant Categories and Partial Functions
Remark on intuitionistic fuzzy logic and intuitionistic logic.
It is shown that the axioms of the intuitionistic logic can be proved as theorems in the frames of the intuitionistic fuzzy logic.
Remarks In Da Costa's Paraconsistent Set Theories.
Remarks on intuitionistic modal logics.
Remarks on the definitions of main concepts of logic of action
The article presents the definitions of action and of its omission, formulated in some logical theories of action. The concern of the analysis is to point at manifold possibilities of precising the intuitive sense of discussed concepts depending on the theory. The utility of a particular definition may be evaluated when the domain of applicability of the theory is taken into account ; application often becomes justification for the choice of a given definition.
Remarks on the elementary theories of formal and convergent power series
Representación grafica del teorema de Church y Rosser
Representation of logic formulas by normal forms
In this paper, we deal with the disjunctive and conjunctive normal forms in the frame of predicate BL-logic and prove theirs conditional equivalence to appropriate formulas. Our aim is to show approximation ability of special normal forms defined by means of reflexive binary predicate.
Representation of metamorphosis grammar in logic grammar: Proof trees and their lengths.
Representation of observables in quantum mechanical models
Representation of uni-nullnorms and null-uninorms on bounded lattices
In this paper, we present the representation for uni-nullnorms with disjunctive underlying uninorms on bounded lattices. It is shown that our method can cover the representation of nullnorms on bounded lattices and some of existing construction methods for uni-nullnorms on bounded lattices. Illustrative examples are presented simultaneously. In addition, the representation of null-uninorms with conjunctive underlying uninorms on bounded lattices is obtained dually.
Representation theorem for finite quasi-boolean algebras
Representations of Reals in Reverse Mathematics
Working in the framework of reverse mathematics, we consider representations of reals as rapidly converging Cauchy sequences, decimal expansions, and two sorts of Dedekind cuts. Converting single reals from one representation to another can always be carried out in RCA₀. However, the conversion process is not always uniform. Converting infinite sequences of reals in some representations to other representations requires the use of WKL₀ or ACA₀.
Representing Upper Probability Measures over Rational Lukasiewicz Logic.
Residual implications and co-implications from idempotent uninorms
This paper is devoted to the study of implication (and co-implication) functions defined from idempotent uninorms. The expression of these implications, a list of their properties, as well as some particular cases are studied. It is also characterized when these implications satisfy some additional properties specially interesting in the framework of implication functions, like contrapositive symmetry and the exchange principle.
Residuation in twist products and pseudo-Kleene posets
M. Busaniche, R. Cignoli (2014), C. Tsinakis and A. M. Wille (2006) showed that every residuated lattice induces a residuation on its full twist product. For their construction they used also lattice operations. We generalize this problem to left-residuated groupoids which need not be lattice-ordered. Hence, we cannot use the same construction for the full twist product. We present another appropriate construction which, however, does not preserve commutativity and associativity of multiplication....
Resolution Methods in Proving the Program Correctness
Restricted ideals and the groupability property. Tools for temporal reasoning
In the field of automatic proving, the study of the sets of prime implicants or implicates of a formula has proven to be very important. If we focus on non-classical logics and, in particular, on temporal logics, such study is useful even if it is restricted to the set of unitary implicants/implicates [P. Cordero, M. Enciso, and I. de Guzmán: Structure theorems for closed sets of implicates/implicants in temporal logic. (Lecture Notes in Artificial Intelligence 1695.) Springer–Verlag, Berlin 1999]....