Search

Your search keyword '"contraction-free"' showing total 3 results
Start Over Descriptor "contraction-free" Publisher springer netherlands
3 results on '"contraction-free"'

3. The Method of Tree-Hypersequents for Modal Propositional Logic

Author

Francesca Poggiolesi, Institut d'Histoire et de Philosophie des Sciences et des Techniques (IHPST), Université Paris 1 Panthéon-Sorbonne (UP1)-Département d'Etudes Cognitives - ENS Paris (DEC), École normale supérieure - Paris (ENS Paris), Université Paris sciences et lettres (PSL)-Université Paris sciences et lettres (PSL)-École normale supérieure - Paris (ENS Paris), Université Paris sciences et lettres (PSL)-Université Paris sciences et lettres (PSL)-Centre National de la Recherche Scientifique (CNRS), David Makinson, Jacek Malinowski, and Heinrich Wansing

Subjects
Hypersequents, Contraction-free, Discrete mathematics, Propositional variable, Natural deduction, Cut-elimination theorem, Normal modal logic, Modal logic, 010102 general mathematics, Modal μ-calculus, Sequent calculus, 0102 computer and information sciences, 16. Peace & justice, 01 natural sciences, [SHS.HISPHILSO]Humanities and Social Sciences/History, Philosophy and Sociology of Sciences, Sequent Calculus, 010201 computation theory & mathematics, Cut-free, Calculus, Sequent, 0101 mathematics, Tree-hypersequents, Mathematics
Abstract

Paper from the Studia Logica conference Trends in Logic IV; In this paper we present a method, that we call the tree-hypersequent method, for generating contraction-free and cut-free sequent calculi for modal propositional logics. We show how this method works for the systems K, KD, K4 and KD4, by giving a sequent calculus for these systems which are normally presented in the Hilbert style, and by proving all the main results in a purely syntactical way.

Published
2008

Catalog

Books, media, physical & digital resources
See catalog results