In the present article we attempt to show that Aristotie's syllogistic is an underlying logie which includes a natural deductive system and that it is not an axiomatic theoryas had previously been thought. We construct a mathematical model which reflects certain structural aspects of Aristotle's logic and we examine both the mathematical properties of the model and the relation of the model to ...

We propose the use of variable declarations in natural deduction. A variable declaration is a line in a derivation that introduces a new variable into the derivation. Semantically, it can be regarded as declaring that the variable denotes an element of the universe of discourse. Undeclared variables, in contrast, do not denote anything, and may not occur free in any formula in the derivation. A...

Deduction modulo is an extension of first-order predicate logic where axioms are replaced by rewrite rules. For instance, the axiom P ⇔ (Q ⇒ R) is replaced by the rule P −→ (Q ⇒ R). These rules define an equivalence relation and, in a proof, a proposition can be replaced by an equivalent one at any time. A presentation of Simple Type Theory in Deduction modulo, calledHOL, has been given in [3]....

The normalization theorem for the system of extended natural deduction will be proved as a consequence of the cut-elimination theorem, by using the connections between the system of extended natural deduction and a standard system of sequents.

a neuro-fuzzy modeling tool (anfis) has been used to dynamically model cross flow ultrafiltration of milk. it aims to predict permeate flux and total hydraulic resistance as a function of transmembrane pressure, ph, temperature, fat, molecular weight cut off, and processing time. dynamic modeling of ultrafiltration performance of colloidal systems (such as milk) is very important for designing ...

We formulate a unified display calculus proof theory for the four principal varieties of bunched logic by combining display calculi for their component logics. Our calculi satisfy cut-elimination, and are sound and complete with respect to their standard presentations. We show how to constrain applications of display-equivalence in our calculi in such a way that an exhaustive proof search need ...

In a system of sequents for intuitionistic predicate logic a theorem, which corresponds to Prawitz’s Normal Form Theorem for natural deduction, are proved. In sequent derivations a special kind of cuts, maximum cuts, are defined. Maximum cuts from sequent derivations are connected with maximum segments from natural deduction derivations, i.e., sequent derivations without maximum cuts correspond...

in this paper, we establish the theory of fuzzy ideal convergence on completely distributive lattices and give characterizations of some topological notions. we also study fuzzy limit structures and discuss the relationship between fuzzy co-topologies and fuzzy limit structures.

In this paper we prove the strong standard completeness of interval-valued monoidal t-norm based logic (IVMTL) and some of its extensions. For other extensions we show that they are not strong standard complete. We also give a local deduction theorem for IVMTL and other extensions of interval-valued monoidal logic. Similar results are obtained for interval-valued fuzzy logics expanded with Baaz...

A semantics is given to possibilistic logic, a logic that handles weighted classical logic formulae, and where weights are interpreted as lower bounds on degrees of certainty or possibility, in the sense of Zadeh's possibility theory. The proposed semantics is based on fuzzy sets of interpretations. It is tolerant to partial inconsistency. Satisfiability is extended from interpretations to fuzz...