• polski
    • English
  • polski 
    • polski
    • English
  • Zaloguj
Szukaj 
  •   Repozytorium UŁ
  • Czasopisma naukowe | Scientific Journals
  • Bulletin of the Section of Logic
  • Szukaj
  •   Repozytorium UŁ
  • Czasopisma naukowe | Scientific Journals
  • Bulletin of the Section of Logic
  • Szukaj
JavaScript is disabled for your browser. Some features of this site may not work without it.

Przeglądaj

Całe RepozytoriumZbiory i kolekcje Daty wydaniaAutorzyTytułyTematyTen zbiórDaty wydaniaAutorzyTytułyTematy

Moje konto

ZalogujZarejestruj

Odkryj

AutorBorzooei, Rajab Ali (12)Jun, Young Bae (12)Pietruszczak, Andrzej (5)Indrzejczak, Andrzej (4)Jarmużek, Tomasz (4)Klonowski, Mateusz (4)Kostrzycka, Zofia (4)Rezaei, Gholam Reza (4)Sayed Ahmed, Tarek (4)Song, Seok-Zun (4)... zobacz więcejTematsequent calculus (12)modal logic (10)cut elimination (8)natural deduction (8)03G25 (7)intuitionistic logic (7)06F35 (5)bilateralism (5)proof theory (5)first-order logic (4)... zobacz więcejData wydania2023 (27)2020 (26)2021 (25)2022 (20)2018 (19)2019 (19)2016 (18)2017 (17)2024 (17)2015 (13)Has File(s)Yes (201)

Szukaj

Show Advanced FiltersHide Advanced Filters

Filtry

Użyj filtrów by uściślić zapytanie.

Wyświetlanie pozycji 21-30 z 237

  • Opcje sortowania:
  • Znaczenie
  • Tytuł (rosnąco)
  • Tytuł (malejąco)
  • Data wydania (rosnąco)
  • Data wydania (malejąco)
  • Wyników na stronę:
  • 5
  • 10
  • 20
  • 40
  • 60
  • 80
  • 100
Thumbnail

Axiomatization of a Basic Logic of Logical Bilattices 

Takano, Mitio (Wydawnictwo Uniwersytetu Łódzkiego, 2016)
A sequential axiomatization is given for the 16-valued logic that has been proposed by Shramko-Wansing (J Philos Logic 34:121–153, 2005) as a candidate for the basic logic of logical bilattices.
Thumbnail

A New Arithmetically Incomplete First- Order Extension of Gl All Theorems of Which Have Cut Free Proofs 

Tourlakis, George (Wydawnictwo Uniwersytetu Łódzkiego, 2016)
Reference [12] introduced a novel formula to formula translation tool (“formulators”) that enables syntactic metatheoretical investigations of first-order modal logics, bypassing a need to convert them first into Gentzen ...
Thumbnail

Erratum to: Congruences and Ideals in a Distributive Lattice with Respect to a Derivation 

Barzegar, Hasan (Wydawnictwo Uniwersytetu Łódzkiego, 2019)
The present note is an Erratum for the two theorems of the paper "Congruences and ideals in a distributive lattice with respect to a derivation" by M. Sambasiva Rao.
Thumbnail

Positive Implicative Soju Ideals in BCK-Algebras 

Xin, Xiao Long; Borzooei, Rajab Ali; Jun, Young Bae (Wydawnictwo Uniwersytetu Łódzkiego, 2019)
The notion of positive implicative soju ideal in BCK-algebra is introduced, and several properties are investigated. Relations between soju ideal and positive implicative soju ideal are considered, and characterizations ...
Thumbnail

Two Infinite Sequences of Pre-Maximal Extensions of the Relevant Logic E 

Typańska-Czajka, Lidia (Wydawnictwo Uniwersytetu Łódzkiego, 2019)
The only maximal extension of the logic of relevant entailment E is the classical logic CL. A logic L ⊆ [E,CL] called pre-maximal if and only if L is a coatom in the interval [E,CL]. We present two denumerable infinite ...
Thumbnail

A Modified Subformula Property for the Modal Logic S4.2 

Takano, Mitio (Wydawnictwo Uniwersytetu Łódzkiego, 2019)
The modal logic S4.2 is S4 with the additional axiom ◊□A ⊃ □◊A. In this article, the sequent calculus GS4.2 for this logic is presented, and by imposing an appropriate restriction on the application of the cut-rule, it is ...
Thumbnail

Semi-Heyting Algebras and Identities of Associative Type 

Cornejo, Juan M.; Sankappanavar, Hanamantagouda P. (Wydawnictwo Uniwersytetu Łódzkiego, 2019)
An algebra A = ⟨A, ∨, ∧, →, 0, 1⟩ is a semi-Heyting algebra if ⟨A, ∨, ∧, 0, 1⟩ is a bounded lattice, and it satisfies the identities: x ∧ (x → y) ≈ x ∧ y, x ∧ (y → z) ≈ x ∧ [(x ∧ y) → (x ∧ z)], and x → x ≈ 1. SH denotes ...
Thumbnail

Functional Completeness in CPL via Correspondence Analysis 

Leszczyńska-Jasion, Dorota; Petrukhin, Yaroslav; Shangin, Vasilyi; Jukiewicz, Marcin (Wydawnictwo Uniwersytetu Łódzkiego, 2019)
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 ...
Thumbnail

The Method of Socratic Proofs Meets Correspondence Analysis 

Leszczyńska-Jasion, Dorota; Petrukhin, Yaroslav; Shangin, Vasilyi (Wydawnictwo Uniwersytetu Łódzkiego, 2019)
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 ...
Thumbnail

Full Cut Elimination and Interpolation for Intuitionistic Logic with Existence Predicate 

Maffezioli, Paolo; Orlandelli, Eugenio (Wydawnictwo Uniwersytetu Łódzkiego, 2019)
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 ...
  • 1
  • 2
  • 3
  • 4
  • 5
  • 6
  • . . .
  • 24

Repozytorium Uniwersytetu Łódzkiego

Kontakt z nami | Wyślij uwagi | Deklaracja dostępności
 

 


Repozytorium Uniwersytetu Łódzkiego

Kontakt z nami | Wyślij uwagi | Deklaracja dostępności