PL
 |
EN
Preferencje help
Polish version English version Język
Widoczny [Schowaj] Abstrakt
Liczba wyników

Znaleziono wyników: 7

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 Optimization of logistic motor transport networks with application of propositional calculus laws
Czajkowski Andrzej A., Frąś Józef, Schlegel Mathias, Kanswohl Norbert
Research in Logistics & Production
|
2019
|
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.
2
Content available remote A Semantical Analysis of Focusing and Contraction in Intuitionistic Logic
Avellone A., Fiorentini C., Momigliano A.
Fundamenta Informaticae
|
2015
|
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.
3
Content available remote Some Propositional Calculus Oppositional with Respect to the Intuitionistic Propositional Calculus
Bryll G., Kaptur M.
Scientific Issues of Jan Długosz University in Częstochowa. Mathematics
|
2005
|
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.
4
Content available remote About Two Different Ways of Characterization of Łuksiewicz's Three-valued Modal Propositional Calculus
Bryll G., Kaptur M.
Scientific Issues of Jan Długosz University in Częstochowa. Mathematics
|
2005
|
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.
5
Content available remote The Proof of Certain Tarski's Theorem about the Existence of One-element Base for Axiomatizable Systems of Propositional Calculus
Kaptur M.
Scientific Issues of Jan Długosz University in Częstochowa. Mathematics
|
2003
|
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.
6
Content available remote Rachunek refutacyjny a rachunek dualny
Bryll G., Górnicka A.
Scientific Issues of Jan Długosz University in Częstochowa. Mathematics
|
1999
|
Vol. 7
23--29
7
Content available remote Fast Automatic Deduction
Stępień L.
Scientific Issues of Jan Długosz University in Częstochowa. Mathematics
|
2000/2001
|
Vol. 8
89--99
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ć.