Pełnotekstowe zasoby PLDML oraz innych baz dziedzinowych są już dostępne w nowej Bibliotece Nauki.
Zapraszamy na https://bibliotekanauki.pl
Preferencje help
Polish version English version Język
Widoczny [Schowaj] Abstrakt
Liczba wyników

Znaleziono wyników: 6

Liczba wyników na stronie
first rewind previous Strona / 1 next fast forward last

Wyniki wyszukiwania

Wyszukiwano:
w słowach kluczowych:  intuitionistic logic
help Sortuj według:

help Ogranicz wyniki do:
first rewind previous Strona / 1 next fast forward last
1
Artykuł dostępny w postaci pełnego tekstu - kliknij by otworzyć plik
Content available

An Alternative Natural Deduction for the Intuitionistic Propositional Logic

100%
Ilić M.
Bulletin of the Section of Logic
|
2016
|
tom 45
|
nr 1
EN
A natural deduction system NI, for the full propositional intuitionistic logic, is proposed. The operational rules of NI are obtained by the translation from Gentzen’s calculus LJ and the normalization is proved, via translations from sequent calculus derivations to natural deduction derivations and back.
2
Artykuł dostępny w postaci pełnego tekstu - kliknij by otworzyć plik
Content available

From Intuitionism to Brouwer's Modal Logic

80%
Kostrzycka Z.
Bulletin of the Section of Logic
|
2020
|
tom 49
|
nr 4
343-358
EN
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.
3
Artykuł dostępny w postaci pełnego tekstu - kliknij by otworzyć plik
Content available

An Investigation into Intuitionistic Logic with Identity

70%
Chlebowski S., Leszczyńska-Jasion D.
Bulletin of the Section of Logic
|
2019
|
tom 48
|
nr 4
EN
We define Kripke semantics for propositional intuitionistic logic with Suszko’s identity (ISCI). We propose sequent calculus for ISCI along with cut-elimination theorem. We sketch a constructive interpretation of Suszko’s propositional identity connective.
4
Content available remote

Polyadic algebras over nonclassical logics

70%
Pigozzi D., Salibra A.
Banach Center Publications
|
1993
|
tom 28
|
nr 1
51-66
EN
The polyadic algebras that arise from the algebraization of the first-order extensions of a SIC are characterized and a representation theorem is proved. Standard implicational calculi (SIC)'s were considered by H. Rasiowa [19] and include classical and intuitionistic logic and their various weakenings and fragments, the many-valued logics of Post and Łukasiewicz, modal logics that admit the rule of necessitation, BCK logic, etc.
5
Artykuł dostępny w postaci pełnego tekstu - kliknij by otworzyć plik
Content available

Preserving Filtering Unification by Adding Compatible Operations to Some Heyting Algebras

70%
Dzik W., Radeleczki S.
Bulletin of the Section of Logic
|
2016
|
tom 45
|
nr 3/4
EN
We show that adding compatible operations to Heyting algebras and to commutative residuated lattices, both satisfying the Stone law ¬x ⋁ ¬¬x = 1, preserves filtering (or directed) unification, that is, the property that for every two unifiers there is a unifier more general then both of them. Contrary to that, often adding new operations to algebras results in changing the unification type. To prove the results we apply the theorems of [9] on direct products of l-algebras and filtering unification. We consider examples of frontal Heyting algebras, in particular Heyting algebras with the successor, γ and G operations as well as expansions of some commutative integral residuated lattices with successor operations.
6
Artykuł dostępny w postaci pełnego tekstu - kliknij by otworzyć plik
Content available

Full Cut Elimination and Interpolation for Intuitionistic Logic with Existence Predicate

61%
Maffezioli P., Orlandelli E.
Bulletin of the Section of Logic
|
2019
|
tom 48
|
nr 2
137-158
EN
In previous work by Baaz and Iemhoff, a Gentzen calculus for intuitionistic logic with existence predicate is presented that satisfies partial cut elimination and Craig's interpolation property; it is also conjectured that interpolation fails for the implication-free fragment. In this paper an equivalent calculus is introduced that satisfies full cut elimination and allows a direct proof of interpolation via Maehara's lemma. In this way, it is possible to obtain much simpler interpolants and to better understand and (partly) overcome the failure of interpolation for the implication-free fragment.
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ć.