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 32 Next

Displaying 621 – 640 of 1306

Showing per page

On generalizations of fuzzy metric spaces

Yi Shi, Wei Yao (2023)

Kybernetika

The aim of the paper is to present three-variable generalizations of fuzzy metric spaces in sense of George and Veeramani from functional and topological points of view, respectively. From the viewpoint of functional generalization, we introduce a notion of generalized fuzzy 2-metric spaces, study their topological properties, and point out that it is also a common generalization of both tripled fuzzy metric spaces proposed by Tian et al. and ℳ -fuzzy metric spaces proposed by Sedghi and Shobe. Since...

On global induction mechanisms in a μ -calculus with explicit approximations

Christoph Sprenger, Mads Dam (2003)

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications

We investigate a Gentzen-style proof system for the first-order μ -calculus based on cyclic proofs, produced by unfolding fixed point formulas and detecting repeated proof goals. Our system uses explicit ordinal variables and approximations to support a simple semantic induction discharge condition which ensures the well-foundedness of inductive reasoning. As the main result of this paper we propose a new syntactic discharge condition based on traces and establish its equivalence with the semantic...

On global induction mechanisms in a μ-calculus with explicit approximations

Christoph Sprenger, Mads Dam (2010)

RAIRO - Theoretical Informatics and Applications

We investigate a Gentzen-style proof system for the first-order μ-calculus based on cyclic proofs, produced by unfolding fixed point formulas and detecting repeated proof goals. Our system uses explicit ordinal variables and approximations to support a simple semantic induction discharge condition which ensures the well-foundedness of inductive reasoning. As the main result of this paper we propose a new syntactic discharge condition based on traces and establish its equivalence with the semantic...

On ideals in De Morgan residuated lattices

Liviu-Constantin Holdon (2018)

Kybernetika

In this paper, we introduce a new class of residuated lattices called De Morgan residuated lattices, we show that the variety of De Morgan residuated lattices includes important subvarieties of residuated lattices such as Boolean algebras, MV-algebras, BL-algebras, Stonean residuated lattices, MTL-algebras and involution residuated lattices. We investigate specific properties of ideals in De Morgan residuated lattices, we state the prime ideal theorem and the pseudo-complementedness of the ideal...

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...

Currently displaying 621 – 640 of 1306