Page 1

Displaying 1 – 6 of 6

Showing per page

First Order Languages: Further Syntax and Semantics

Marco Caminati (2011)

Formalized Mathematics

Third of a series of articles laying down the bases for classical first order model theory. Interpretation of a language in a universe set. Evaluation of a term in a universe. Truth evaluation of an atomic formula. Reassigning the value of a symbol in a given interpretation. Syntax and semantics of a non atomic formula are then defined concurrently (this point is explained in [16], 4.2.1). As a consequence, the evaluation of any w.f.f. string and the relation of logical implication are introduced....

Formalization of Generalized Almost Distributive Lattices

Adam Grabowski (2014)

Formalized Mathematics

Almost Distributive Lattices (ADL) are structures defined by Swamy and Rao [14] as a common abstraction of some generalizations of the Boolean algebra. In our paper, we deal with a certain further generalization of ADLs, namely the Generalized Almost Distributive Lattices (GADL). Our main aim was to give the formal counterpart of this structure and we succeeded formalizing all items from the Section 3 of Rao et al.’s paper [13]. Essentially among GADLs we can find structures which are neither V-commutative...

Free Interpretation, Quotient Interpretation and Substitution of a Letter with a Term for First Order Languages

Marco Caminati (2011)

Formalized Mathematics

Fourth of a series of articles laying down the bases for classical first order model theory. This paper supplies a toolkit of constructions to work with languages and interpretations, and results relating them. The free interpretation of a language, having as a universe the set of terms of the language itself, is defined.The quotient of an interpreteation with respect to an equivalence relation is built, and shown to remain an interpretation when the relation respects it. Both the concepts of quotient...

Fuzzy grammatical inference using neural network.

Armando Blanco, A. Delgado, M. Carmen Pegalajar (1998)

Mathware and Soft Computing

We have shown a model of fuzzy neural network that is able to infer the relations associated to the transitions of a fuzzy automaton from a fuzzy examples set. Neural network is trained by a backpropagation of error based in a smooth derivative [1]. Once network has been trained the fuzzy relations associated to the transitions of the automaton are found encoded in the weights.

Fuzzy inference using a least square model.

Humberto Bustince, M. Calderón, Victoria Mohedano (1998)

Mathware and Soft Computing

In this paper, the method of least squares is applied to the fuzzy inference rules. We begin studying the conditions in which from a fuzzy set we can build another through the method of least squares. Then we apply this technique in order to evaluate the conclusions of the generalized modus ponens. We present different theorems and examples that demonstrate the fundamental advantages of the method studied.

Currently displaying 1 – 6 of 6

Page 1