Giles's game and the proof theory of Łukasiewicz logic
type: Item
instance of: scholarly article
title: Giles's game and the proof theory of Łukasiewicz logic
zbMATH Open document ID: 1185.03041
author: Christian G. Fermüller
author: George Metcalfe
published in: Studia Logica
publication date: 2009-11-16T00:00:00Z
review text: Starting in 1974, \textit{R. Giles} proposed in a series of papers [Stud. Log. 33(1974), 397--415 (1975; Zbl 0324.02017); Fuzzy Sets Syst. 2, 233--257 (1979; Zbl 0411.03018); Stud. Log. 38, 49--73 (1979; Zbl 0417.03008); Fuzzy Sets Syst. 25, No. 3, 297--323 (1988; Zbl 0652.90001)] a general treatment of reasoning with vague predicates by means of a formal system based upon a dialogue interpretation, dealing with subjective belief. The main idea is to let a sentence represent a belief by expressing it in the form of a bet. In this setting a sentence \(\psi\) is considered to follow from sentences \(\varphi_1,\dots,\varphi_n\) just when anyone who accepts the bets \(\varphi_1,\dots,\varphi_n\) can at the same time bet \(\psi\) without fear of loss. In this paper, it is shown that `disjunctive strategies' for Giles's game, combining ordinary strategies for all instances of the game played on the same formula, may be interpreted as derivations in a corresponding proof system. In particular, such strategies mirror derivations in a hypersequent calculus developed in recent work [see \textit{G. Metcalfe, N. Olivetti} and \textit{D. Gabbay}, Proof theory for fuzzy logics. Applied Logic Series 36. Dordrecht: Springer (2009; Zbl 1168.03002)] on the proof theory of Łukasiewicz logic.
reviewed by: Albert Hoogewijs
Mathematics Subject Classification ID: 03B50
Mathematics Subject Classification ID: 03B52
Mathematics Subject Classification ID: 03F03
zbMATH DE Number: 5633551
zbMATH Keywords: dialogue games
zbMATH Keywords: Łukasiewicz logic
zbMATH Keywords: many-valued logics
zbMATH Keywords: fuzzy logic
zbMATH Keywords: hypersequents
MaRDI profile type: Publication
full work available at URL: s11225-009-9185-2
OpenAlex ID: W2168945720
cites work: A game-based formal system for Ł\(_\infty\)
cites work: Finiteness in infinite-valued Łukasiewicz logic
cites work: A constructive analysis of RM
cites work: Herbrand's Theorem, Skolemization and Proof Systems for First-Order Lukasiewicz Logic
cites work: Algebraic Analysis of Many Valued Logics
cites work: Logic for Programming, Artificial Intelligence, and Reasoning
cites work: Automated Reasoning with Analytic Tableaux and Related Methods
cites work: Q3620026
cites work: Proving termination with multiset orderings
cites work: Hoops and Fuzzy Logic
cites work: Q3620029
cites work: Combining Supervaluation and Degree Based Reasoning Under Vagueness
cites work: Łukasiewicz logic and fuzzy set theory
cites work: Semantics for fuzzy reasoning
cites work: Q4289327
cites work: Metamathematics of fuzzy logic
cites work: Proof theory for fuzzy logics
cites work: Q4845316
cites work: Q3142018
cites work: Resolution and model building in the infinite-valued calculus of Łukasiewicz
cites work: Tableaux for Łukasiewicz infinite-valued logic
cites work: Bounded contraction and Gentzen-style formulation of Łukasiewicz logics
cites work: Q3663260
cites work: Fragments of Many-Valued Statement Calculi
cites work: Die nichtaxiomatisierbarkeit des unendlichwertigen Prädikatenkalküls von Łukasiewicz
DOI: 10.1007/S11225-009-9185-2
description: scientific article; zbMATH DE number 5633551