Urszula Wybraniec-Skardowska

Prof. Urszula Wybraniec-Skardowska

n/a
orcid

Research Focus & Metrics

Academic Career Length

30Years (1997-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
15 June 2011 in Logica Universalis
Verified
Journal Article
Open access
PDF file
UWUrszula Wybraniec-Skardowska
Urszula Wybraniec-Skardowska
JWJacek Waldmajer
Jacek Waldmajer
In the paper, the authors discuss two kinds of consequence operations characterized axiomatically. The first one are consequence operations of the type Cn + that, in the intuitive sense, are infallible operations, always leading from accepted (true) sentences of a deductive system to accepted (true) sentences of the deductive system (see Tarski in Monatshefte für Mathematik und Physik 37:361–404, 1930, Comptes Rendus des Séances De la Société des Sciences et des Lettres de Varsovie 23:22–29, 1930; Pogorzelski and Słupecki in Stud Logic 9:163–176, 1960, Stud Logic 10:77–95, 1960). The second kind are dual consequence operations of the type Cn − that can be regarded as anti-infallible operations leading from non-accepted (rejected, false) sentences of a deductive system to non-accepted (rejected, false) sentences of the system (see Słupecki in Funkcja Łukasiewicza, 33–40, 1959; Wybraniec-Skardowska in Teoria zdań odrzuconych, 5–131, Zeszyty Naukowe Wyższej Szkoły Inżynierskiej w Opolu, Seria Matematyka 4(81):35–61, 1983, Ann Pure Appl Logic 127:243–266, 2004, in On the notion and function of rejected propositions, 179–202, 2005). The operations of the types Cn + and Cn − can be ordinary finitistic consequence operations or unit consequence operations. A deductive system can be characterized in two ways by the following triple: $$\begin{array}{ll}{\rm by\,the\,triple}:\hspace{1.4cm} (+ , -)\hspace{0,6cm} \\ {\rm or\,by\,the\,triple}:\hspace{1.0cm} (-, +)\hspace{0,6cm} .\end{array}$$ We compare axiom systems for operations of the types Cn + and Cn −, give some methodological properties of deductive systems defined by means of these operations (e.g. consistency, completeness, decidability in Łukasiewicz’s sense), as well as formulate different metatheorems concerning them.

1 January 2008
Verified
Book Chapter
Closed access
PDF file
ZBZbigniew Bonikowski
Zbigniew Bonikowski
UWUrszula Wybraniec-Skardowska
Urszula Wybraniec-Skardowska


1 January 1997
Verified
Book Chapter
Closed access
PDF file
EBEdward Bryniarski
Edward Bryniarski
UWUrszula Wybraniec-Skardowska
Urszula Wybraniec-Skardowska

30 April 2016 in Logica Universalis
Verified
Journal Article
Open access
PDF file
UWUrszula Wybraniec-Skardowska
Urszula Wybraniec-Skardowska
In this paper, with reference to relationships of the traditional square of opposition, we establish all the relations of the square of opposition between complex sentences built from the 16 binary and four unary propositional connectives of the classical propositional calculus (CPC). We illustrate them by means of many squares of opposition and, corresponding to them—octagons, hexagons or other geometrical objects.

4 September 2019 in Axioms
Verified
Journal Article
Open access
PDF file
UWUrszula Wybraniec-Skardowska
Urszula Wybraniec-Skardowska
The systems of arithmetic discussed in this work are non-elementary theories. In this paper, natural numbers are characterized axiomatically in two different ways. We begin by recalling the classical set P of axioms of Peano’s arithmetic of natural numbers proposed in 1889 (including such primitive notions as: set of natural numbers, zero, successor of natural number) and compare it with the set W of axioms of this arithmetic (including the primitive notions like: set of natural numbers and relation of inequality) proposed by Witold Wilkosz, a Polish logician, philosopher and mathematician, in 1932. The axioms W are those of ordered sets without largest element, in which every non-empty set has a least element, and every set bounded from above has a greatest element. We show that P and W are equivalent and also that the systems of arithmetic based on W or on P, are categorical and consistent. There follows a set of intuitive axioms PI of integers arithmetic, modelled on P and proposed by B. Iwanuś, as well as a set of axioms WI of this arithmetic, modelled on the W axioms, PI and WI being also equivalent, categorical and consistent. We also discuss the problem of independence of sets of axioms, which were dealt with earlier.