Informacja

Drogi użytkowniku, aplikacja do prawidłowego działania wymaga obsługi JavaScript. Proszę włącz obsługę JavaScript w Twojej przeglądarce.

Wyszukujesz frazę "classical propositional calculus" wg kryterium: Temat


Wyświetlanie 1-5 z 5
Tytuł:
Uwagi o systemie logiki formalnej skonstruowanym dla logików nieformalnych
Remarks on the System of Formal Logic Construed for Informal Logicians
Autorzy:
Kiczuk, Stanisław
Powiązania:
https://bibliotekanauki.pl/articles/2012940.pdf
Data publikacji:
2010
Wydawca:
Katolicki Uniwersytet Lubelski Jana Pawła II. Towarzystwo Naukowe KUL
Tematy:
funktor prawdziwościowy
logika nieformalna
logika nieklasyczna
klasyczny rachunek zdań
truth-functional operator
informal logic
non-classical logic
classical propositional calculus
Opis:
D. Sherry’s main theses included in his essay entitled “Formal Logic for Informal Logicians” are presented in the article. In a discussion with his theses it is shown that he prefers this kind of logic that has a lot of elements that are the same as in Aristotle’s logic understood as the art of thinking and the technique of discussion taken from Topics, and not the logic that was started in his Prior Analytics. It is also shown that not only patterns of inferring, but also the theses of logic, as well as theses to which no patterns correspond, that are guarantee reliability of inference patterns, may be intuitively obvious. In the article also attention is drawn to the fact that the PL- system of logic presented by Sherry was characterized by him by means of a rather poor logical terminology. In the American author’s argument there are no clear distinctions between the thesis of logic, the logical inference pattern and the rule of the procedure of proving. However, it can be established that the PL- system is constituted by argumentation patterns that are reliable owing to such theses of propositional logic as modus potens, modus tollens, disjunctive syllogism, conjunctive syllogism, complex destructive dilemma, and the two rules concerning creating proofs, i.e. the rule of conditional proof and the rule of reduction to the absurd. In the PL- system there are fewer theses than in the classical propositional calculus, but this has nothing in common with the so-called multivalent logics to which some theses of classical logic supposedly do not apply. Everything suggests that some systems of non-classical logic systems may be built on the PL- system; namely, the ones in which theses are given that govern the correct use of non-extensional operators connected with key terms appearing in many sciences, like e.g. “time”, “change”, “causality”. Sherry’s essay reveals that he is a supporter of the thesis that knowledge of formal logic is necessary for using informal logic efficiently, which is necessary for teaching logic properly.
Źródło:
Roczniki Filozoficzne; 2010, 58, 1; 95-108
0035-7685
Pojawia się w:
Roczniki Filozoficzne
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
O NIEKTÓRYCH PRAWACH LOGIKI I ZASADACH OGÓLNEJ TEORII BYTU
Autorzy:
Kiczuk, Stanisław
Powiązania:
https://bibliotekanauki.pl/articles/488533.pdf
Data publikacji:
2012
Wydawca:
Katolicki Uniwersytet Lubelski Jana Pawła II. Towarzystwo Naukowe KUL
Tematy:
logika współczesna
funktor prawdziwościowy
klasyczny rachunek zdań
zasada racji dostatecznej
modern logic
truth-functional operator
classical propositional calculus
principle of sufficient reason
Opis:
Some principles of general theory of being have their equivalents in laws of classical logic. For a long time this was not distinctly noticed, as logic was treated rather as technology of discussion, and not as a system of propositions stated in the objective language and concerning connections between facts. It may be generally said that some primary principles of being and some laws of logic state the same most fundamental connections between facts, between states of things. There are also principles of philosophy that do not have such equivalents in laws of logic. These include the principle of sufficient reason. The concept of intuitive truth of propositions that reappeared in modern logic first of all in connection with K. Gödel’s theorem of 1931 formed an intellectual climate that made it possible for classical logicians to accept also those principles of general theory of being that do not have equivalents in laws of standard logic. It may be said that these philosophical principles may be included in the outward basis of modern logic.
Źródło:
Roczniki Filozoficzne; 2012, 60, 2; 171-179
0035-7685
Pojawia się w:
Roczniki Filozoficzne
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
The Method of Socratic Proofs Meets Correspondence Analysis
Autorzy:
Leszczyńska-Jasion, Dorota
Petrukhin, Yaroslav
Shangin, Vasilyi
Powiązania:
https://bibliotekanauki.pl/articles/749950.pdf
Data publikacji:
2019
Wydawca:
Uniwersytet Łódzki. Wydawnictwo Uniwersytetu Łódzkiego
Tematy:
Socratic proofs
correspondence analysis
invertible rule
inferential erotetic logic
classical propositional logic
sequent calculus
Opis:
The goal of this paper is to propose correspondence analysis as a technique for generating the so-called erotetic (i.e. pertaining to the logic of questions) calculi which constitute the method of Socratic proofs by Andrzej Wiśniewski. As we explain in the paper, in order to successfully design an erotetic calculus one needs invertible sequent-calculus-style rules. For this reason, the proposed correspondence analysis resulting in invertible rules can constitute a new foundation for the method of Socratic proofs. Correspondence analysis is Kooi and Tamminga's technique for designing proof systems. In this paper it is used to consider sequent calculi with non-branching (the only exception being the rule of cut), invertible rules for the negation fragment of classical propositional logic and its extensions by binary Boolean functions.
Źródło:
Bulletin of the Section of Logic; 2019, 48, 2; 99-116
0138-0680
2449-836X
Pojawia się w:
Bulletin of the Section of Logic
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Functional Completeness in CPL via Correspondence Analysis
Autorzy:
Leszczyńska-Jasion, Dorota
Petrukhin, Yaroslav
Shangin, Vasilyi
Jukiewicz, Marcin
Powiązania:
https://bibliotekanauki.pl/articles/749866.pdf
Data publikacji:
2019
Wydawca:
Uniwersytet Łódzki. Wydawnictwo Uniwersytetu Łódzkiego
Tematy:
correspondence analysis
invertible rules
classical propositional logic
functional completeness
sequent calculus
automated deduction
automated rules generation
Opis:
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.
Źródło:
Bulletin of the Section of Logic; 2019, 48, 1
0138-0680
2449-836X
Pojawia się w:
Bulletin of the Section of Logic
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Logika formalna czy logiki formalne?
Formal Logic or Formal Logics?
Autorzy:
Kiczuk, Stanisław
Powiązania:
https://bibliotekanauki.pl/articles/2013349.pdf
Data publikacji:
2007
Wydawca:
Katolicki Uniwersytet Lubelski Jana Pawła II. Towarzystwo Naukowe KUL
Tematy:
logika
funktor prawdziwościowy
logika standardowa
logika nieklasyczna
wielowartościowy rachunek zdań
logika klasyczna
logic
truth-functional operator
standard logic
non-classical logic
many-valued propositional calculus
classical logic
Opis:
Apart from putting the theses contained in E. Agazzi’s work Why Is It Logical to Admit Several Logics? in an order and making them more distinct, an attempt is made to draw conclusions from the explicit wordings used by that author. Some theses presented in the text are shown against the views of other authors who discussed analogous problems. In this way, as it seems, modification, completing and elaborating has been possible of wordings that approve of the thesis about the existence of many logics that are contained in the analyzed text. Among others, the article emphasizes that Agazzi’s pronouncements about relations existing between standard logic and intuitionist logic cannot be accepted. Also, several remarks are made about the so-called many-valued logics. Agazzi’s theses that well constructed non-classical logics representing proper contents are necessary for representatives of various branches of knowledge is acceptable.
Źródło:
Roczniki Filozoficzne; 2007, 55, 1; 129-157
0035-7685
Pojawia się w:
Roczniki Filozoficzne
Dostawca treści:
Biblioteka Nauki
Artykuł
    Wyświetlanie 1-5 z 5

    Ta witryna wykorzystuje pliki cookies do przechowywania informacji na Twoim komputerze. Pliki cookies stosujemy w celu świadczenia usług na najwyższym poziomie, w tym w sposób dostosowany do indywidualnych potrzeb. Korzystanie z witryny bez zmiany ustawień dotyczących cookies oznacza, że będą one zamieszczane w Twoim komputerze. W każdym momencie możesz dokonać zmiany ustawień dotyczących cookies