The Heyting doctrines
The internal and external aspect of logic and set theory in elementary topoi
The interpreted type-free modal calculus
The interpreted type-free modal calculus
The interpreted type-free modal calculus . II
The irrelevant information principle for collective probabilistic reasoning
Within the framework of discrete probabilistic uncertain reasoning a large literature exists justifying the maximum entropy inference process, , as being optimal in the context of a single agent whose subjective probabilistic knowledge base is consistent. In particular Paris and Vencovská completely characterised the inference process by means of an attractive set of axioms which an inference process should satisfy. More recently the second author extended the Paris-Vencovská axiomatic approach...
The join of equational theories
The -theory of profinite abelian groups
The lattice of bi-numerations of arithmetic. I.
The lattice of bi-numerations of arithmetic. II.
The lattice of linear classes in prime-valued logics
The lattices of numerations of theories containing Peano's arithmetic
The Lebesgue Monotone Convergence Theorem
In this article we prove the Monotone Convergence Theorem [16].MML identifier: MESFUNC9, version: 7.8.10 4.100.1011
The Linearity of Riemann Integral on Functions from ℝ into Real Banach Space
In this article, we described basic properties of Riemann integral on functions from R into Real Banach Space. We proved mainly the linearity of integral operator about the integral of continuous functions on closed interval of the set of real numbers. These theorems were based on the article [10] and we referred to the former articles about Riemann integral. We applied definitions and theorems introduced in the article [9] and the article [11] to the proof. Using the definition of the article [10],...
The logic of neural networks.
This paper establishes the equivalence between multilayer feedforward networks and linear combinations of Lukasiewicz propositions. In this sense, multilayer forward networks have a logic interpretation, which should permit to apply logical techniques in the neural networks framework.
The maximality of the typed lambda calculus and of cartesian closed categories
The Measurability of Complex-Valued Functional Sequences
In this article, we formalized the measurability of complex-valued functional sequences. First, we proved the measurability of the limits of real-valued functional sequences. Next, we defined complex-valued functional sequences dividing real part into imaginary part. Then using the former theorems, we proved the measurability of each part. Lastly, we proved the measurability of the limits of complex-valued functional sequences. We also showed several properties of complex-valued measurable functions....
The monadic second-order logic of graphs III : tree-decompositions, minors and complexity issues
The -propositional calculus
T. Almada and J. Vaz de Carvalho (2001) stated the problem to investigate if these Łukasiewicz algebras are algebras of some logic system. In this article an affirmative answer is given and the -propositional calculus, denoted by , is introduced in terms of the binary connectives (implication), (standard implication), (conjunction), (disjunction) and the unary ones (negation) and , (generalized Moisil operators). It is proved that belongs to the class of standard systems of implicative...
The Neg.-propositional Calculus