By Topic

On Urquhart's C logic

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Ciabattoni, A. ; Dipt. di Inf., Milan Univ., Italy

In this paper we investigate the basic many-valued logics introduced by Urquhart (1986), here referred to as C and Cnew, respectively. We define a cut-free hyper-sequent calculus for Cnew and show the following results: (1) C and C new are distinct versions of Godel logic without contraction. (2) Cnew is decidable. (3) In Cnew the family of axioms ((Ak→C)∧(Bk→C))→((AVB) k→C), with k⩾2, is in fact redundant

Published in:

Multiple-Valued Logic, 2000. (ISMVL 2000) Proceedings. 30th IEEE International Symposium on

Date of Conference:

2000