First-order EQ-logic
نویسندگان
چکیده
This paper represents the third step in the development of EQ-logics. Namely, after developing propositional and higher-order EQ-logics, we focus also on predicate one. First, we give a brief overview of the propositional EQ-logic and then develop syntax and semantics of predicate EQ-logic. Finally, we prove completeness by constructing a model of a consistent theory of EQ-logic from the syntactical material, as usual.
منابع مشابه
EQ-logics with delta connective
In this paper we continue development of formal theory of a special class offuzzy logics, called EQ-logics. Unlike fuzzy logics being extensions of theMTL-logic in which the basic connective is implication, the basic connective inEQ-logics is equivalence. Therefore, a new algebra of truth values calledEQ-algebra was developed. This is a lower semilattice with top element endowed with two binary...
متن کاملiProver-Eq: An Instantiation-Based Theorem Prover with Equality
iProver-Eq is an implementation of an instantiation-based calculus Inst-Gen-Eq which is complete for first-order logic with equality. iProver-Eq extends the iProver system with superposition-based equational reasoning and maintains the distinctive features of the Inst-Gen method. In particular, firstorder reasoning is combined with efficient ground satisfiability checking where the latter is de...
متن کاملEQ-logics: Non-commutative fuzzy logics based on fuzzy equality
In this paper, we develop a specific formal logic in which the basic connective is fuzzy equality and the implication is derived from the latter. Moreover, the fusion connective (strong conjunction) is noncommutative. We call this logic EQ-logic. First, we formulate the basic EQ-logic which is rich enough to enjoy the completeness property. Furthermore, we introduce two extensions which seem to...
متن کاملAndrás Simon COMPLEXITY OF EQUATIONAL THEORY OF RELATIONAL ALGEBRAS WITH PROJECTION ELEMENTS
In connection with a problem of L. Henkin and J.D. Monk we show that the variety generated by TPA’s – relation algebras (RA’s) expanded with concrete set theoretical projection functions – and the first–order theory of the class TPA are not axiomatizable by any decidable set of axioms. Indeed, we show that Eq(TPA) – all equations valid in TPA – is exactly on the Π1 level. The same applies if we...
متن کاملOn EQ-Fuzzy Logics with Delta Connective
In this paper, extension of the EQ-logic by the ∆connective is introduced. The former is a new kind of many-valued logic which based on EQ-algebra of truth values, i.e. the algebra in which fuzzy equality is the fundamental operation and implication is derived from it. First, we extend the EQ-algebra by the ∆ operation and then introduce axioms and inference rules of EQ∆-logic. We also prove th...
متن کامل