Citations of:
Add citations
You must login to add citations.
|
|
|
|
|
|
For decades Ryszard Wójcicki has been a highly influential scholar in the community of logicians and philosophers. Our aim is to outline and comment on some essential issues on logic, methodology of science and semantics as seen from the perspective of distinguished contributions of Wójcicki to these areas of philosophical investigations. |
|
|
Professor Ryszard Wójcicki once asked whether the degree of maximality of the consequence operationC determined by the theorems of the intuitionistic propositional logic and the detachment rule for the implication connective is equal to ? The aim of the present paper is to give the affirmative answer to the question. More exactly, it is proved here that the degree of maximality ofC — the — fragment ofC, is equal to , for every such that. |
|
|
In this contribution we shall characterize matrix consequence operation determined by a direct product and an ultraproduct of a family of logical matrices. As an application we shall describe finite consequence operations with the help of ultrapowers. |
|
|
The aim of the article is to outline the historical background and the present state of the methodology of deductive systems invented by Alfred Tarski in the thirties. Key notions of Tarski's methodology are presented and discussed through, the recent development of the original concepts and ideas. |
|
|
|
|
|
Ł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 (by using Dunn semantics) 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 (...) |
|
|
Using ideas from Murskii [3], Tokarz [4] and Wroski [7] we construct some strongly finite consequence operation having 2%0 standard strengthenings. In this way we give the affirmative answer to the following question, stated in Tokarz [4]: are there strongly finite logics with the degree of maximality greater than 0? |
|
|
|
|
|
|
|
|
First, we prove that the lattice of all structural strengthenings of a given strongly finite consequence operation is both atomic and coatomic, it has finitely many atoms and coatoms, each coatom is strongly finite but atoms are not of this kind — we settle this by constructing a suitable counterexample. Second, we deal with the notions of hereditary: algebraicness, strong finitisticity and finite approximability of a strongly finite consequence operation. Third, we formulate some conditions which tell us when the lattice (...) |
|
|
The aim of this paper is to show that the operations of forming direct products and submatrices suffice to construct exhaustive semantics for all structural strengthenings of the consequence determined by a given class of logical matrices. |
|
|
No categories |
|
|
|
|
|
|
|
|
|
|
|
The paper is concerned with the problem of characterization of strengthenings of the so-called Łukasiewicz-like sentential calculi. The calculi under consideration are determined by n-valued Łukasiewicz matrices with superdesignated logical values. In general, Łukasiewicz-like sentential calculi are not implicative in the sense of [7]. Despite of this fact, in our considerations we use matrices analogous to S-algebras of Rasiowa. The main result of the paper says that the degree of maximality of any n-valued Łukasiewicz-like sentential calculus is finite and equal (...) |
