All a b c d e f g h i j k l m n o p q r s t u v w x y z Other

Previous Page 33 Next

Displaying 641 – 660 of 1313

Showing per page

On knowledge games.

J. M. Lasry, J. M. Morel, S. Solimini (1989)

Revista Matemática de la Universidad Complutense de Madrid

We give a formalization of the ?knowledge games? which allows to study their decidability and convergence as a problem of mathematics. Our approach is based on a metalemma analogous to those of Von Neumann and Morgenstern at the beginning of Game Theory. We are led to definitions which characterize the knowledge games as objects is standard set theory. We then study rigorously the most classical knowledge games and, although we also prove that the ?common knowledge? in these games may be incomputable,...

On logical fiberings and automated deduction in many-valued logics using Gröbner bases.

Jochen Pfalzgraf (2004)

RACSAM

The concept of logical fiberings is briefly summarized. Based on experiences with concrete examples an algorithmic approach is developed which leads to a represention of a many-valued logic as a logical fibering. The Stone isomorphism for expressing classical logical operations by corresponding polynomials can be extended to m-valued logics. On the basis of this, a classical deduction problem can be treated symbolically as a corresponding ideal membership problem using computer algebra support with...

On MPT-implication functions for fuzzy logic.

Enric Trillas, Claudi Alsina, Ana Pradera (2004)

RACSAM

This paper deals with numerical functions J : [0,1] x [0,1] → [0,1] able to functionally express operators →: [0,1]X x [0,1]Y → [0,1]XxY defined as (μ → σ)(x,y) = J(μ(x),σ(y)), and verifying either Modus Ponens or Modus Tollens, or both. The concrete goal of the paper is to search for continuous t-norms T and strong-negation functions N for which it is either T(a, J(a,b)) ≤ b (Modus Ponens) or T(N(b), J(a,b)) ≤ N(a) (Modus Tollens), or both, for all a,b in [0,1] and a given J. Functions J are taken...

On Multiset Ordering

Grzegorz Bancerek (2016)

Formalized Mathematics

Formalization of a part of [11]. Unfortunately, not all is possible to be formalized. Namely, in the paper there is a mistake in the proof of Lemma 3. It states that there exists x ∈ M1 such that M1(x) > N1(x) and (∀y ∈ N1)x ⊀ y. It should be M1(x) ⩾ N1(x). Nevertheless we do not know whether x ∈ N1 or not and cannot prove the contradiction. In the article we referred to [8], [9] and [10].

On permutographs

Thomas, Gerhard G. (1982)

Proceedings of the 10th Winter School on Abstract Analysis

On pseudo BE-algebras

Rajab Ali Borzooei, Arsham Borumand Saeid, Akbar Rezaei, Akefe Radfar, Reza Ameri (2013)

Discussiones Mathematicae - General Algebra and Applications

In this paper, we introduce the notion of pseudo BE-algebra which is a generalization of BE-algebra. We define the concepts of pseudo subalgebras and pseudo filters and prove that, under some conditions, pseudo subalgebra can be a pseudo filter. We prove that every homomorphic image and pre-image of a pseudo filter is also a pseudo filter. Furthermore, the notion of pseudo upper sets in pseudo BE-algebras introduced and is proved that every pseudo filter is an union of pseudo upper sets.

Currently displaying 641 – 660 of 1313