Gentzen-Type Refutation Systems for Three-Valued Logics with an Application to Disproving Strong Equivalence

1. Łukasiewicz, J.: Aristotle’s syllogistic from the standpoint of modern formal logic, 2nd edn. Clarendon Press, Oxford (1957)

   MATH  Google Scholar 

2. Kreisel, G., Putnam, H.: Eine Unableitbarkeitsbeweismethode für den Intuitionistischen Aussagenkalkül. Archiv für Mathematische Logik und Grundlagenforschung 3, 74–78 (1957)

   Article  MathSciNet  MATH  Google Scholar 

3. Wójcicki, R.: Dual counterparts of consequence operations. Bulletin of the Section of Logic 2, 54–57 (1973)

   MathSciNet  Google Scholar 

4. Tiomkin, M.: Proving unprovability. In: 3rd Annual Symposium on Logics in Computer Science, pp. 22–27. IEEE, Los Alamitos (1988)

   Google Scholar 

5. Bonatti, P.A.: A Gentzen system for non-theorems. Technical Report CD-TR 93/52, Christian Doppler Labor für Expertensysteme, Technische Universität Wien (1993)

   Google Scholar 

6. Goranko, V.: Refutation systems in modal logic. Studia Logica 53, 299–324 (1994)

   Article  MathSciNet  MATH  Google Scholar 

7. Skura, T.: Refutations and proofs in S4. In: Proof Theory of Modal Logic, pp. 45–51. Kluwer, Dordrecht (1996)

   Chapter  Google Scholar 

8. Skura, T.: A refutation theory. Logica Universalis 3, 293–302 (2009)

   Article  MathSciNet  MATH  Google Scholar 

9. Wybraniec-Skardowska, U.: On the notion and function of the rejection of propositions. Acta Universitatis Wratislaviensis Logika 23, 179–202 (2005)

   Google Scholar 

10. Caferra, R., Peltier, N.: Accepting/rejecting propositions from accepted/rejected propositions: A unifying overview. International Journal of Intelligent Systems 23, 999–1020 (2008)

    Article  MATH  Google Scholar 

11. Bonatti, P.A., Olivetti, N.: Sequent calculi for propositional nonmonotonic logics. ACM Transactions on Computational Logic 3, 226–278 (2002)

    Article  MathSciNet  MATH  Google Scholar 

12. Egly, U., Tompits, H.: Proof-complexity results for nonmonotonic reasoning. ACM Transactions on Computational Logic 2, 340–387 (2001)

    Article  MathSciNet  MATH  Google Scholar 

13. Avron, A.: Natural 3-valued logics - Characterization and proof theory. Journal of Symbolic Logic 56 (1), 276–294 (1991)

    Article  MathSciNet  MATH  Google Scholar 

14. Gödel, K.: Zum intuitionistischen Aussagenkalkül. Anzeiger Akademie der Wissenschaften Wien, mathematisch-naturwissenschaftliche Klasse 32, 65–66 (1932)

    MATH  Google Scholar 

15. Lifschitz, V., Pearce, D., Valverde, A.: Strongly equivalent logic programs. ACM Transactions on Computational Logic 2, 526–541 (2001)

    Article  MathSciNet  MATH  Google Scholar 

16. Bryll, G., Maduch, M.: Aksjomaty odrzucone dla wielowartościowych logik Łukasiewicza. In: Zeszyty Naukowe Wyższej Szkły Pedagogigicznej w Opolu, Matematyka VI, Logika i algebra, pp. 3–17 (1968)

    Google Scholar 

17. Avron, A.: Classical Gentzen-type methods in propositional many-valued logics. In: 31st IEEE International Symposium on Multiple-Valued Logic, pp. 287–298. IEEE, Los Alamitos (2001)

    Chapter  Google Scholar 

18. Gelfond, M., Lifschitz, V.: Classical negation in logic programs and disjunctive databases. New Generation Computing 9, 365–385 (1991)

    Article  MATH  Google Scholar 

Download references