10 research outputs found
A temporal semantics for Nilpotent Minimum logic
In [Ban97] a connection among rough sets (in particular, pre-rough algebras)
and three-valued {\L}ukasiewicz logic {\L}3 is pointed out. In this paper we
present a temporal like semantics for Nilpotent Minimum logic NM ([Fod95,
EG01]), in which the logic of every instant is given by {\L}3: a completeness
theorem will be shown. This is the prosecution of the work initiated in [AGM08]
and [ABM09], in which the authors construct a temporal semantics for the
many-valued logics of G\"odel ([G\"od32], [Dum59]) and Basic Logic ([H\'aj98]).Comment: 19 pages, 2 table
First-order Nilpotent Minimum Logics: first steps
Following the lines of the analysis done in [BPZ07, BCF07] for first-order
G\"odel logics, we present an analogous investigation for Nilpotent Minimum
logic NM. We study decidability and reciprocal inclusion of various sets of
first-order tautologies of some subalgebras of the standard Nilpotent Minimum
algebra. We establish a connection between the validity in an NM-chain of
certain first-order formulas and its order type. Furthermore, we analyze
axiomatizability, undecidability and the monadic fragments.Comment: In this version of the paper the presentation has been improved. The
introduction section has been rewritten, and many modifications have been
done to improve the readability; moreover, numerous references have been
added. Concerning the technical side, some proofs has been shortened or made
more clear, but the mathematical content is substantially the same of the
previous versio
On completeness results for predicate lukasiewicz, product, gödel and nilpotent minimum logics expanded with truth-constants
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 completeness results for some other expansions. Namely, we prove that the expansions of predicate Product, Gödel and Nilpotent Minimum logics with truth-constants are conservative, which already implies the failure of standard completeness for the case of Product logic. In contrast, the expansions of predicate Gödel and Nilpotent Minimum logics are proved to be strong standard complete but, when the semantics is restricted to the canonical algebra, they are proved to be complete only for tautologies. Moreover, when the language is restricted to evaluated formulae we prove canonical completeness for deductions from finite sets of premises.Peer Reviewe
On rational weak Nilpotent Minimum logics
In this paper we investigate extensions of Gödel and Nilpotent Minimum logics by adding rational truth-values as truth constants in the language and by adding corresponding book-keeping axioms for the truth-constants. We also investigate the rational extensions of some parametric families of Weak Nilpotent Minimum logics, weaker than both Gödel and Nilpotent Minimum logics. Weak and strong standard completeness of these logics are studied in general and in particular when we restrict ourselves to formulas of the kind r̄ → φ, where r is a rational in [0, 1] and φ is a formula without rational truth-constants. © 2006 Old City Publishing, Inc.Authors are indebted to Petr Hájek for pointing out and solving some technical problems in the original proof of standard completeness of RG. Authors acknowledge partial support of the Spanish project MULOG
TIN2004-07933-C03-01Peer Reviewe
On Rational Weak Nilpotent Minimum Logics
In this paper we investigate some extensions of Weak Nilpotent Minimum logic, a weaker logic than both Godel and Nilpotent Minimum logics, by adding rational truth-values as truth constants in the language and by adding corresponding book-keeping axioms for the truth-constants. Weak and strong standard completeness of these logics are studied in general and when we restrict ourselves to formulas of the kind r → ϕ, where r is a rational in [0, 1] and ϕ is a formula without rational truth-constants
On rational weak Nilpotent Minimum logics
In this paper we investigate extensions of Gödel and Nilpotent Minimum logics by adding rational truth-values as truth constants in the language and by adding corresponding book-keeping axioms for the truth-constants. We also investigate the rational extensions of some parametric families of Weak Nilpotent Minimum logics, weaker than both Gödel and Nilpotent Minimum logics. Weak and strong standard completeness of these logics are studied in general and in particular when we restrict ourselves to formulas of the kind r̄ → φ, where r is a rational in [0, 1] and φ is a formula without rational truth-constants. © 2006 Old City Publishing, Inc