Szukaj
Wyświetlanie pozycji 1-4 z 4
A New Arithmetically Incomplete First- Order Extension of Gl All Theorems of Which Have Cut Free Proofs
(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 ...
A Short and Readable Proof of Cut Elimination for Two First-Order Modal Logics
(Wydawnictwo Uniwersytetu Łódzkiego, 2015)
A well established technique toward developing the proof theory of a Hilbert-style modal logic is to introduce a Gentzen-style equivalent (a Gentzenisation), then develop the proof theory of the latter, and finally transfer ...
Rule-Generation Theorem and its Applications
(Wydawnictwo Uniwersytetu Łódzkiego, 2018)
In several applications of sequent calculi going beyond pure logic, an introduction of suitably defined rules seems to be more profitable than addition of extra axiomatic sequents. A program of formalization of mathematical ...
Cut Elimination for Extended Sequent Calculi
(Wydawnictwo Uniwersytetu Łódzkiego, 2023-09-25)
We present a syntactical cut-elimination proof for an extended sequent calculus covering the classical modal logics in the \(\mathsf{K}\), \(\mathsf{D}\), \(\mathsf{T}\), \(\mathsf{K4}\), \(\mathsf{D4}\) and \(\mathsf{S4}\) ...