Zofia Kostrzycka
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Research Interests
Zofia Kostrzycka has a total of 3 co-authors. Here are the top co-authors by number of shared publications:
- Marek Zaionc
Jagiellonian University
1 shared publication - Marek Zaionc
Jagiellonian University, Theoretical Computer Science, Kraków, Poland
1 shared publication - Yutaka Miyazaki
Osaka University of Economics and Law, Osaka, Japan
1 shared publication
Latest Publications
- 1 January 2021
- Published by Oxford University Press (OUP) in Journal of Logic and Computation
- Vol. 32 (5) , 996-1013
Projective unification in weakly transitive and weakly symmetric modal logics
We prove that |$\textbf {K4}^{\textbf {n+}}\textbf {B}^{\textbf {k+}}$| has projective unification, for any |$k,n\geq 1$|. It means, in particular, that any weakly transitive and weakly symmetric modal logic is unitary. Some consequences of projective unification concerning structural completeness and passive rules are provided.
- 1 January 2021
- Published by Oxford University Press (OUP) in Journal of Logic and Computation
- Vol. 32 (5) , 996-1013
Projective unification in weakly transitive and weakly symmetric modal logics
We prove that |$\textbf {K4}^{\textbf {n+}}\textbf {B}^{\textbf {k+}}$| has projective unification, for any |$k,n\geq 1$|. It means, in particular, that any weakly transitive and weakly symmetric modal logic is unitary. Some consequences of projective unification concerning structural completeness and passive rules are provided.
- Open Access
- 30 December 2020
- Published by Uniwersytet Lodzki (University of Lodz) in Bulletin of the Section of Logic
- Vol. 49 (4) , 343-358
From Intuitionism to Brouwer's Modal Logic
We try to translate the intuitionistic propositional logic INT into Brouwer's modal logic KTB. Our translation is motivated by intuitions behind Brouwer's axiom p →☐◊p The main idea is to interpret intuitionistic implication as modal strict implication, whereas variables and other positive sentences remain as they are. The proposed translation preserves fragments of the Rieger-Nishimura lattice which is the Lindenbaum algebra of monadic formulas in INT. Unfortunately, INT is not embedded by this mapping into KTB.
- 30 December 2020
- Published by Uniwersytet Lodzki (University of Lodz) in Bulletin of the Section of Logic
- Vol. 49 (4) , 343-358
Open AccessFrom Intuitionism to Brouwer's Modal Logic
We try to translate the intuitionistic propositional logic INT into Brouwer's modal logic KTB. Our translation is motivated by intuitions behind Brouwer's axiom p →☐◊p The main idea is to interpret intuitionistic implication as modal strict implication, whereas variables and other positive sentences remain as they are. The proposed translation preserves fragments of the Rieger-Nishimura lattice which is the Lindenbaum algebra of monadic formulas in INT. Unfortunately, INT is not embedded by this mapping into KTB.
- 1 July 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-8
Quantitative Study of Fuzzy Logics
In this paper, we focus on two main 3-valued logics used by the fuzzy logic community. The Gödel-Dummett logic and the Łukasiewicz one. Both are based on the same language of implication and negation. In both, we consider fragments consisting of formulas formed with one variable. We investigate the proportion of the number of true (or satisfiable) formulas of a certain length n to the number of all formulas of such length. We are especially interested in the asymptotic behavior of this fraction when length n tends to infinity. If the limit exists it is represented by a real number between 0 and 1 which is called the density of truth or the density of SAT. Using the powerful theory of analytic combinatorics, we state several results comparing the density of truth and the density of satisfiable formulas for both Gödel-Dummett and Łukasiewicz logics.
- 1 July 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-8
Quantitative Study of Fuzzy Logics
In this paper, we focus on two main 3-valued logics used by the fuzzy logic community. The Gödel-Dummett logic and the Łukasiewicz one. Both are based on the same language of implication and negation. In both, we consider fragments consisting of formulas formed with one variable. We investigate the proportion of the number of true (or satisfiable) formulas of a certain length n to the number of all formulas of such length. We are especially interested in the asymptotic behavior of this fraction when length n tends to infinity. If the limit exists it is represented by a real number between 0 and 1 which is called the density of truth or the density of SAT. Using the powerful theory of analytic combinatorics, we state several results comparing the density of truth and the density of satisfiable formulas for both Gödel-Dummett and Łukasiewicz logics.
- Open Access
- 30 December 2016
- Published by Uniwersytet Lodzki (University of Lodz) in Bulletin of the Section of Logic
- Vol. 45 (3/4)
Interpolation in Normal Extensions of the Brouwer Logic
The Craig interpolation property and interpolation property for deducibility are considered for special kind of normal extensions of the Brouwer logic.
- 30 December 2016
- Published by Uniwersytet Lodzki (University of Lodz) in Bulletin of the Section of Logic
- Vol. 45 (3/4)
Open AccessInterpolation in Normal Extensions of the Brouwer Logic
The Craig interpolation property and interpolation property for deducibility are considered for special kind of normal extensions of the Brouwer logic.
- Open Access
- 23 July 2016
- Published by Springer Nature in Studia Logica
- Vol. 105 (1) , 1-11
Normal Modal Logics Determined by Aligned Clusters
- 23 July 2016
- Published by Springer Nature in Studia Logica
- Vol. 105 (1) , 1-11
Open AccessNormal Modal Logics Determined by Aligned Clusters
- Open Access
- 1 January 2015
- Published by Uniwersytet Lodzki (University of Lodz) in Bulletin of the Section of Logic
- Vol. 44 (3/4)
On Halldén Completeness of Modal Logics Determined by Homogeneous Kripke Frames
Halldén complete modal logics are defined semantically. They have a nice characterization as they are determined by homogeneous Kripke frames.
- 1 January 2015
- Published by Uniwersytet Lodzki (University of Lodz) in Bulletin of the Section of Logic
- Vol. 44 (3/4)
Open AccessOn Halldén Completeness of Modal Logics Determined by Homogeneous Kripke Frames
Halldén complete modal logics are defined semantically. They have a nice characterization as they are determined by homogeneous Kripke frames.
- 28 July 2014
- Published by Wiley in Mathematical Logic Quarterly
- Vol. 60 (4-5) , 304-313
On linear Brouwerian logics
- 28 July 2014
- Published by Wiley in Mathematical Logic Quarterly
- Vol. 60 (4-5) , 304-313
On linear Brouwerian logics
- 26 June 2009
- Published by Oxford University Press (OUP) in Journal of Logic and Computation
- Vol. 19 (6) , 1113-1125
On the Density of Truth of Locally Finite Logics
We prove that the density of truth exists for a large class of locally finite (locally tabular) propositional logics. We are primarily interested in classical and intuitionistic logic and show that their implicational fragments have the same density. There are also given some locally finite logics without the density of truth.
- 26 June 2009
- Published by Oxford University Press (OUP) in Journal of Logic and Computation
- Vol. 19 (6) , 1113-1125
On the Density of Truth of Locally Finite Logics
We prove that the density of truth exists for a large class of locally finite (locally tabular) propositional logics. We are primarily interested in classical and intuitionistic logic and show that their implicational fragments have the same density. There are also given some locally finite logics without the density of truth.
- 10 March 2009
- Published by Oxford University Press (OUP) in Journal of Logic and Computation
- Vol. 19 (6) , 1199-1205
On a Finitely Axiomatizable Kripke Incomplete Logic Containing KTB
We construct a finite extension of T2 = KTB⊕□2p→□3p which is Kripke incomplete.
- 10 March 2009
- Published by Oxford University Press (OUP) in Journal of Logic and Computation
- Vol. 19 (6) , 1199-1205
On a Finitely Axiomatizable Kripke Incomplete Logic Containing KTB
We construct a finite extension of T2 = KTB⊕□2p→□3p which is Kripke incomplete.
- 4 November 2008
- Published by Wiley in Mathematical Logic Quarterly
- Vol. 54 (6) , 617-624
On non-compact logics in NEXT(KTB)
- 4 November 2008
- Published by Wiley in Mathematical Logic Quarterly
- Vol. 54 (6) , 617-624
On non-compact logics in NEXT(KTB)