PL
 |
EN
Nowa wersja platformy, zawierająca wyłącznie zasoby pełnotekstowe, jest już dostępna.
Przejdź na https://bibliotekanauki.pl
Preferencje help
Polish version English version Język
Widoczny [Schowaj] Abstrakt
Liczba wyników

Znaleziono wyników: 9

Liczba wyników na stronie
first rewind previous Strona / 1 next fast forward last
Wyniki wyszukiwania
Wyszukiwano:
w słowach kluczowych:  propositional calculus
help Sortuj według:

help Ogranicz wyniki do:
first rewind previous Strona / 1 next fast forward last
1
Content available remote About Two Different Ways of Characterization of Łuksiewicz's Three-valued Modal Propositional Calculus
100%
Bryll G. , Kaptur M.
Scientific Issues of Jan Długosz University in Częstochowa. Mathematics
|
2005
|
tom Vol. 10
25-31
EN
In this article we consider two systems of Lukasiewicz's three- valued modal propositional calculus. One of them is the system based on such primary terms as the disjunction (A), negation (N) and necessity (L), whereas the second is based on such primary terms as the implication (C), negation (N) and definitively improved by modal necessity terms. The both systems are definitively equivalent.
2
Content available remote Some Propositional Calculus Oppositional with Respect to the Intuitionistic Propositional Calculus
100%
Bryll G. , Kaptur M.
Scientific Issues of Jan Długosz University in Częstochowa. Mathematics
|
2005
|
tom Vol. 10
17--23
EN
A fragmentary system of the classical propositional calculus, in which the law C N N αα is valid instead of the law CαN N α, is presented.
3
Content available Optimization of logistic motor transport networks with application of propositional calculus laws
100%
Czajkowski A. A. , Frąś J. , Schlegel M. , Kanswohl N.
|
2019
|
tom Vol. 9, No. 2
65--76
EN
Some proposition of mathematical logic application for optimization of logistic nets describing motor transport has been presented in this paper. Some algorithm for optimization steps has been proposed in the article. In presented example has been elaborated some optimization of logistic net for motor transport. The optimized logistics network for motor transport significantly improves reliability and contributes to the economical use of the vehicle.
4
Content available remote The Proof of Certain Tarski's Theorem about the Existence of One-element Base for Axiomatizable Systems of Propositional Calculus
100%
Kaptur M.
Scientific Issues of Jan Długosz University in Częstochowa. Mathematics
|
2003
|
tom Vol. 9
51--59
EN
In [1] the following theorem relating the existence of one-element base for spacious class of axiomatizable propositional calculus has been given: Theorem 1. System L, as well as each axiomatizable system propositional calculus, contains sentences "CpCqp" and „CpCqCCpCqrr" (or "CpCqCCpCqrCsr"), possesses the base consisting of only one sentence 1. In Postscript added to the English translation of publication [1] 2 the outline of proof of the above theorem, found by R. McKenzie, has been given. Author of the article advises to give the full proof of Theorem 1, because the outline contained in Postscript does not contain essential reasonings for the proof.
5
Content available remote A Semantical Analysis of Focusing and Contraction in Intuitionistic Logic
88%
Avellone A. , Fiorentini C. , Momigliano A.
Fundamenta Informaticae
|
2015
|
tom Vol. 140, nr 3/4
247--262
EN
Focusing is a proof-theoretic device to structure proof search in the sequent calculus: it provides a normal form to cut-free proofs in which the application of invertible and non-invertible inference rules is structured in two separate and disjoint phases. Although stemming from proofsearch considerations, focusing has not been thoroughly investigated in actual theorem proving, in particular w.r.t. termination. We present a contraction-free (and hence terminating) focused multisuccedent sequent calculus for propositional intuitionistic logic, which refines the G4ip calculus in the tradition of Vorob’ev, Hudelmeier and Dyckhoff. We prove completeness of the calculus semantically and argue that this offers a viable alternative to other more syntactical means.
6
Content available Applying propositional calculus of formal logic to formulate research hypotheses in management sciences
75%
Pabian A.
Wiadomości Statystyczne
|
2023
|
tom 68
|
nr 02
7
Content available remote Fast Automatic Deduction
75%
Stępień L.
Scientific Issues of Jan Długosz University in Częstochowa. Mathematics
|
2000/2001
|
tom Vol. 8
89--99
8
Content available remote Rachunek refutacyjny a rachunek dualny
63%
Bryll G. , Górnicka A.
Scientific Issues of Jan Długosz University in Częstochowa. Mathematics
|
1999
|
tom Vol. 7
23--29
9
Content available Applying propositional calculus of formal logic to formulate research hypotheses in management sciences
63%
Pabian A.
Wiadomości Statystyczne. The Polish Statistician
|
2023
|
tom 68
|
nr 2
39-55
PL
Tematem artykułu jest formułowanie hipotez badawczych w naukach o zarządzaniu. Na podstawie wyników badania przeprowadzonego przez autora można stwierdzić, że choć w literaturze przedmiotu wskazywane są cechy prawidłowo sformułowanej hipotezy, to podczas tworzenia hipotez badawczych często dochodzi do błędów, a w konsekwencji odpowiedzi na pytanie (pytania) wyrażające problem badawczy są skonstruowane niepoprawnie. Przykłady takich błędów, m.in. próby sprawdzenia w praktyce stwierdzeń nieweryfikowalnych, można znaleźć nawet w pracach magisterskich. W tworzeniu poprawnych hipotez pomocny może być rachunek zdań mający źródło w logice formalnej. Celem artykułu jest udowodnienie przydatności rachunku zdań logiki formalnej w formułowaniu hipotezy głównej i hipotez cząstkowych w pracach badawczych z zakresu nauk o zarządzaniu. Przed przyjęciem hipotezy należy rozłożyć ją na czynniki pierwsze i przeprowadzić analizę zdań. Zastosowanie takiej procedury powinno doprowadzić do nadania każdej z hipotez zrozumiałej i logicznej postaci oraz zapewnić ich zgodność z regułami językowymi.
EN
The article is devoted to the topic of formulating research hypotheses in management sciences. On the basis of the author’s research results, it may be concluded that although the related literature indicates the features of a properly formulated hypothesis, errors still tend to occur in the process of its construction and as a consequence, the answers to the question or questions determining the research problem are not correctly formulated. Examples of such errors include attempts to check statements which are unverifiable in practice, which could be observed even in Master’s theses. The propositional calculus, whose source is in formal logic, may prove a useful tool in creating proper hypotheses. The primary aim of the article is to prove the usefulness of the propositional calculus of formal logic in formulating the main hypothesis and partial hypotheses in research work relating to management sciences. Prior to adopting a hypothesis for further proceedings, it should be decomposed into prime factors, followed by an analysis of the propositions. Adopting such a calculus when formulating each hypothesis should result in their comprehensible and logical form, compliant with linguistic rules.
first rewind previous Strona / 1 next fast forward last
JavaScript jest wyłączony w Twojej przeglądarce internetowej. Włącz go, a następnie odśwież stronę, aby móc w pełni z niej korzystać.