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

Page 1

Displaying 1 – 9 of 9

Showing per page

Wajsberg algebras.

Josep M. Font, Antonio J. Rodríguez, Antoni Torrens (1984)

Stochastica

We present the basic theory of the most natural algebraic counterpart of the ℵ0-valued Lukasiewicz calculus, strictly logically formulated. After showing its lattice structure and its relation to C. C. Chang's MV-algebras we study the implicative filters and prove its equivalence to congruence relations. We present some properties of the variety of all Wajsberg algebras, among which there is a representation theorem. Finally we give some characterizations of linear, simple and semisimple algebras....

Weak Completeness Theorem for Propositional Linear Time Temporal Logic

Mariusz Giero (2012)

Formalized Mathematics

We prove weak (finite set of premises) completeness theorem for extended propositional linear time temporal logic with irreflexive version of until-operator. We base it on the proof of completeness for basic propositional linear time temporal logic given in [20] which roughly follows the idea of the Henkin-Hasenjaeger method for classical logic. We show that a temporal model exists for every formula which negation is not derivable (Satisfiability Theorem). The contrapositive of that theorem leads...

Weak Convergence and Weak Convergence

Keiko Narita, Yasunari Shidama, Noboru Endou (2015)

Formalized Mathematics

In this article, we deal with weak convergence on sequences in real normed spaces, and weak* convergence on sequences in dual spaces of real normed spaces. In the first section, we proved some topological properties of dual spaces of real normed spaces. We used these theorems for proofs of Section 3. In Section 2, we defined weak convergence and weak* convergence, and proved some properties. By RNS_Real Mizar functor, real normed spaces as real number spaces already defined in the article [18],...

Weakly maximal decidable structures

Alexis Bès, Patrick Cégielski (2008)

RAIRO - Theoretical Informatics and Applications

We prove that there exists a structure M whose monadic second order theory is decidable, and such that the first-order theory of every expansion of M by a constant is undecidable. 


Wide sets, deep many-valuedness and sorites arguments.

Carlos Pelta (2004)

Mathware and Soft Computing

In this article I show how to obtain a powerful and truthful explanation of the failure of sorites arguments combining an adaptation of the Wide Set Theory formulated by Formato and Gerla and the concept of deep many valuedness established by Marraud. It is shown that if the premises of a sorites argument are conceived as a succession of indexed consequence operators (where indices express the accuracy of the inferences) prefixing sentences, the argument fails because the transitive property for...

Currently displaying 1 – 9 of 9

Page 1