From Truth Degree Comparison Games to Sequents-of-Relations Calculi for Gödel Logic

, &
Logica Universalis 16 (1):221-235 (2022)
  Copy   BIBTEX

Abstract

We introduce a game for Gödel logic where the players’ interaction stepwise reduces claims about the relative order of truth degrees of complex formulas to atomic truth comparison claims. Using the concept of disjunctive game states this semantic game is lifted to a provability game, where winning strategies correspond to proofs in a sequents-of-relations calculus.

Categories

Keywords

Reprint years

DOI

10.1007/s11787-022-00300-0

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,438

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

From Semantic Games to Provability: The Case of Gödel Logic.Alexandra Pavlova, Robert Freiman & Timo Lang - 2021 - Studia Logica 110 (2):429-456.
On Gentzen Relations Associated with Finite-valued Logics Preserving Degrees of Truth.Angel J. Gil - 2013 - Studia Logica 101 (4):749-781.
Display calculi and other modal calculi: a comparison.Francesca Poggiolesi - 2010 - Synthese 173 (3):259-279.
Replacement of Induction by Similarity Saturation in a First Order Linear Temporal Logic.Regimantas Pliuskevicius - 1998 - Journal of Applied Non-Classical Logics 8 (1-2):141-169.
Dual Systems of Sequents and Tableaux for Many-Valued Logics.Matthias Baaz, Christian G. Fermüller & Richard Zach - 1993 - Bulletin of the EATCS 51:192-197.
The Basics of Display Calculi.Tim Lyon, Christian Ittner, Timo Eckhardt & Norbert Gratzl - 2017 - Kriterion - Journal of Philosophy 31 (2):55-100.
Dialogue Games for Many-Valued Logics — an Overview.C. G. Fermüller - 2008 - Studia Logica 90 (1):43-68.
Dialogue Games for Minimal Logic.Alexandra Pavlova - forthcoming - Logic and Logical Philosophy:1.
Gödel’s Natural Deduction.Kosta Došen & Miloš Adžić - 2018 - Studia Logica 106 (2):397-415.
On Deriving Nested Calculi for Intuitionistic Logics from Semantic Systems.Tim Lyon - 2020 - In Sergei Artemov & Anil Nerode (eds.), Logical Foundations of Computer Science. Cham: pp. 177-194.
Rule-Generation Theorem and its Applications.Andrzej Indrzejczak - 2018 - Bulletin of the Section of Logic 47 (4):265-281.
Cut-elimination and proof-search for bi-intuitionistic logic using nested sequents.Rajeev Goré, Linda Postniece & Alwen Tiu - 1998 - In Marcus Kracht, Maarten de Rijke, Heinrich Wansing & Michael Zakharyaschev (eds.), Advances in Modal Logic. CSLI Publications. pp. 43-66.
An analysis of exponentials based on extended sequents.S. Guerrini, S. Martini & A. Masini - 1998 - Logic Journal of the IGPL 6 (5):735-754.
Comparing modal sequent systems.Greg Restall - unknown
Compact propositional Gödel logics.Matthias Baaz & Richard Zach - 1998 - In Baaz Matthias (ed.), 28th IEEE International Symposium on Multiple-Valued Logic, 1998. Proceedings. IEEE Press. pp. 108-113.

Analytics

Added to PP
2022-03-08

Downloads
16 (#892,354)

6 months
8 (#347,703)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

Basic proof theory.A. S. Troelstra - 1996 - New York: Cambridge University Press. Edited by Helmut Schwichtenberg.
A propositional calculus with denumerable matrix.Michael Dummett - 1959 - Journal of Symbolic Logic 24 (2):97-106.
Logic, language-games and information, kantian themes in the philosophy of logic.Jaakko Hintikka - 1973 - Revue Philosophique de la France Et de l'Etranger 163:477-478.
A non-classical logic for physics.Robin Giles - 1974 - Studia Logica 33 (4):397 - 415.
The complexity of propositional proofs.Nathan Segerlind - 2007 - Bulletin of Symbolic Logic 13 (4):417-481.

View all 7 references / Add more references