Łukasiewicz three-valued logic Ł3 is often understood as the set of all 3-valued valid formulas according to Łukasiewicz’s 3-valued matrices. Following Wojcicki, in addition, we shall consider two alternative interpretations of Ł3: “well-determined” Ł3a and “truth-preserving” Ł3b defined by two different consequence relations on the 3-valued matrices. The aim of this paper is to provide dual equivalent two-valued under-determined and over-determined interpretations for Ł3, Ł3a and Ł3b. The logic Ł3 is axiomatized as an extension of Routley and Meyer’s basic positive (...) logic following Brady’s strategy for axiomatizing many-valued logics by employing two-valued under-determined or over-determined interpretations. Finally, it is proved that “well determined” Łukasiewicz logics are paraconsistent. (shrink)

The solution of the problem of the future random events truth is considered in Vasil’ev’s logic. N. A. Vasil’ev graded the logic according to two levels—the level of facts, i.e. time fixed events, and the level of notions or rules, governing these facts. The mathematical construction previously suggested for imaginary Vasil’ev’s logic, extends to the early variant of his logic—a logic of notions. In the paper, we investigate the meaning of problematic and uncertain assertions introduced by Vasil’ev. As a result, (...) we developed a model of Vasil’ev’s logic of facts that resolves also the truth problem of future random events. The imaginary logic has also been extended to the level of notions, and the law of the excluded eighth is gotten in it. The correspondence between Vasil’ev’s terms “some” and “all” and modern quantifiers is discussed. (shrink)

ABSTRACTIn this paper, we present a generalisation of proof simulation procedures for Frege systems by Bonet and Buss to some logics for which the deduction theorem does not hold. In particular, we study the case of finite-valued Łukasiewicz logics. To this end, we provide proof systems and which augment Avron's Frege system HŁuk with nested and general versions of the disjunction elimination rule, respectively. For these systems, we provide upper bounds on speed-ups w.r.t. both the number of steps in proofs (...) and the length of proofs. We also consider Tamminga's natural deduction and Avron's hypersequent calculus GŁuk for 3-valued Łukasiewicz logic and generalise our results considering the disjunction elimination rule to all finite-valued Łukasiewicz logics. (shrink)