A two-valued logic for reasoning about different types of consequence in Kleene's three-valued logic
David Bourget (Western Ontario)
David Chalmers (ANU, NYU)
Rafael De Clercq
Jack Alan Reynolds
Learn more about PhilPapers
Studia Logica 49 (4):541 - 555 (1990)
A formal language of two-valued logic is developed, whose terms are formulas of the language of Kleene's three-valued logic. The atomic formulas of the former language are pairs of formulas of the latter language joined by consequence operators. These operators correspond to the three sensible types of consequence (strong-strong, strong-weak and weak-weak) in Kleene's logic in analogous way as the implication connective in the classical logic corresponds to the classical consequence relation. The composed formulas of the considered language are built from the atomic ones by means of the classical connectives and quantifiers.A deduction system for the developed language is given, consisting of a set of decomposition rules for sequences of formulas. It is shown that the deduction system is sound and complete.
|Keywords||No keywords specified (fix it)|
|Categories||categorize this paper)|
|Through your library||Configure|
Similar books and articles
A. Avron & B. Konikowska (2008). Rough Sets and 3-Valued Logics. Studia Logica 90 (1):69 - 92.
Roberto Cignoli (1991). Complete and Atomic Algebras of the Infinite Valued Łukasiewicz Logic. Studia Logica 50 (3-4):375 - 384.
Stefano Aguzzoli & Agata Ciabattoni (2000). Finiteness in Infinite-Valued Łukasiewicz Logic. Journal of Logic, Language and Information 9 (1):5-29.
Arnon Avron & Beata Konikowska (2009). Proof Systems for Reasoning About Computation Errors. Studia Logica 91 (2):273 - 293.
Walter Sinnott-Armstrong & Amit Malhotra (2002). How to Avoid Deviance (in Logic). History and Philosophy of Logic 23 (3):215--36.
Added to index2009-01-28
Total downloads6 ( #160,383 of 1,012,393 )
Recent downloads (6 months)1 ( #64,700 of 1,012,393 )
How can I increase my downloads?