In this paper we deal with generic expansions of first-order predicate logics of some left-continuous t-norms with a countable set of truth-constants. Besides already known results for the case of Lukasiewicz logic, we obtain new conservativeness and completenesss results for some other expansions. Namely, we prove that the expansions of predicate Product, Gödel and Nilpotent Minimum logics wit...

A flexible semantics has been proposed by Lukasiewicz for probabilistic logic programs where we have a normal logic program augmented with a set of independent probabilistic facts. That semantics, which we call credal semantics, is the set of all probability measures (over stable models) that are consistent with a total choice of probabilistic facts. When each total choice produces a definite p...

Pocrims and suitable specialisations thereof are structures that provide the natural algebraic semantics for a minimal affine logic and its extensions. Hoops comprise a special class of pocrims that provide algebraic semantics for what we view as an intuitionistic analogue of the classical multi-valued Lukasiewicz logic. We present some contributions to the theory of these algebraic structures....

Within the mathematical logic field, much effort has been devoted to prove completeness of different axiomatizations with respect to classes of algebras defined on the real unit interval [0, 1] (see for instance [1] and [2]), but in general, what has been mainly achieved are axiomatizations and results concerning fini-tary completeness, that is, for deductions from a finite number of premises. ...

In this paper, we introduce a foundation for computable model theory of rational Pavelka logic (an extension of Lukasiewicz logic) and continuous logic, and prove effective versions of some related theorems in model theory. We show how to reduce continuous logic to rational Pavelka logic. We also define notions of computability and decidability of a model for logics with computable, but uncount...

The aim of this work is to study a class of non-archimedean valued measures on MV-algebras. We call them hyperreal states and their definition naturally arise from (the uniform version of) Di Nola representation theorem for MV-algebras (cf [5, 6]): for any MV-algebra A = (A,⊕,¬,>,⊥) there exists a ultrafilter U on the cardinality of A such that A embeds into (∗[0, 1]U) Spec(A) (where as usual S...

Universal decomposition, performance and categorical properties will be presented for quantum automata in the form of three new theorems for the category of quantum automata [1][1], quantum computers [2] , Qa,c, and their related quantum logics based on an extension of n-Lukasiewicz algebra [3] as well as their applications [4]. The category of quantum automata and quantum computers is first de...

Probability theory and fuzzy logic have been presented as quite distinct theoretical foundations for reasoning and decision making in situations of uncertainty. This paper establishes a common basis for both forms of logic of uncertainty in which a basic uncertainty logic is defined in terms of a valuation on a lattice of propositions. The (non-truth-functional) connectives for conjunction, dis...

It is well established now that excitable media are capable of implementing of a wide range of computational operations, from image processing to logical computation to navigation of robots. The findings published so far in the field of logical computation were concerned solely with realization of boolean logic. This imposed somewhat artificial limitations on a suitability of excitable media fo...

Following the guidelines proposed by Hájek in [1], some proposals of research on Fuzzy Description Logics (FDLs) were given in [2]. One of them consists in the definition and development of a family of description languages, each one having as underlying fuzzy logic the expansion with an involutive negation and truth constants of the logic defined by a divisible finite t-norm. A general framewo...