An Axiomatization of G'3
نویسندگان
چکیده
We present a Hilbert-style axiomatization of a paraconsistent logic, called G3, recently introduced. G ′ 3 is based on a 3-valued semantics. We prove a soundness and completeness theorem. The replacement theorem holds in G3. As it has already been shown in previous work, G ′ 3 can express some nonmonotonic semantics.
منابع مشابه
Simple axiomatization of reticulations on residuated lattices
We give a simple and independent axiomatization of reticulations on residuated lattices, which were axiomatized by five conditions in [C. Mureşan, The reticulation of a residuated lattice, Bull. Math. Soc. Sci. Math. Roumanie 51 (2008), no. 1, 47--65]. Moreover, we show that reticulations can be considered as lattice homomorphisms between residuated lattices and b...
متن کاملCharacterization and axiomatization of all semigroups whose square is group
In this paper we give a characterization for all semigroups whose square is a group. Moreover, we axiomatize such semigroups and study some relations between the class of these semigroups and Grouplikes,introduced by the author. Also, we observe that this paper characterizes and axiomatizes a class of Homogroups (semigroups containing an ideal subgroup). Finally, several equivalent conditions ...
متن کاملA Universal Axiomatization of Metropolis-rota Implication Algebras
We show that the class of Metropolis-Rota implication algebras can be given a universal axiomatization using an operation closely related to composition in oriented matroids. Lastly we describe the role of our new operation in the collapse of an MRalgebra.
متن کاملThe Axiomatization of Overriding and Update^
There are only very few natural ways in which arbitrary functions can be combined. One composition operator is override: for arbitrary functions f and g, f > g is the function with domain dom( f) U dom(g) that behaves like f on dom( f) and like g on dom(g) \ dom( f ) . Another operator is update: f[g] has the same domain as f, behaves like f on dom( f) \ dom(g), and like g on dom( f) n dom(g). ...
متن کاملComplete Axiomatization of an Algebraic Construction of Graphs
This paper presents a complete (infinite) axiomatization for an algebraic construction of graphs, in which a finite fragment denotes the class of graphs with bounded tree width.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006