Functional Completeness in CPL via Correspondence Analysis

• Autorzy: Dorota Leszczyńska-Jasion , Yaroslav Petrukhin , Vasilyi Shangin , Marcin Jukiewicz
• Języki publikacji: EN

Abstrakty

EN

Kooi and Tamminga's correspondence analysis is a technique for designing proof systems, mostly, natural deduction and sequent systems. In this paper it is used to generate sequent calculi with invertible rules, whose only branching rule is the rule of cut. The calculi pertain to classical propositional logic and any of its fragments that may be obtained from adding a set (sets) of rules characterizing a two-argument Boolean function(s) to the negation fragment of classical propositional logic. The properties of soundness and completeness of the calculi are demonstrated. The proof of completeness is conducted by Kalmár's method. Most of the presented sequent-calculus rules have been obtained automatically, by a rule-generating algorithm implemented in Python. Correctness of the algorithm is demonstrated. This automated approach allowed us to analyse thousands of possible rules' schemes, hundreds of rules corresponding to Boolean functions, and to nd dozens of those invertible. Interestingly, the analysis revealed that the presented proof-theoretic framework provides a syntactic characteristics of such an important semantic property as functional completeness.

Słowa kluczowe

EN

correspondence analysis; invertible rules; classical propositional logic; functional completeness; sequent calculus; automated deduction; automated rules generation

• Wydawca: Wydawnictwo Uniwersytetu Łódzkiego
• Czasopismo: Bulletin of the Section of Logic
• Rocznik: 2019
• Tom: 48
• Numer: 1

Daty

wydano

2019-03-30

Twórcy

autor

Dorota Leszczyńska-Jasion

autor

Yaroslav Petrukhin

autor

Vasilyi Shangin

autor

Marcin Jukiewicz

Identyfikatory

DOI

10.18778/0138-0680.48.1.04