Skip to search formSkip to main contentSkip to account menu

Gödel logic

Known as: Godel logic, Gödel logics 
In mathematical logic, a first-order Gödel logic is a member of a family of finite- or infinite-valued logics in which the sets of truth values V are… 
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
Short circuit evaluation techniques play important roles in hardware design, programming and other fields of computer science. In… 
Review
2010
Review
2010
The logics we present in this tutorial, Godel logics, can be characterized in a rough-and-ready way as follows: The language is… 
2008
2008
Efficient, automated elimination of cuts is a prerequisite for proof analysis. The method CERES, based on Skolemization and… 
2007
2007
Abstract We investigate the relation between intermediate predicate logics based on countable linear Kripke frames with constant… 
2003
2003
  • J. Plato
  • Stud Logica
  • 2003
  • Corpus ID: 1342949
Attention is drawn to the fact that what is alternatively known as Dummett logic, Godel logic, or Godel-Dummett logic, was… 
2002
2002
This paper presents an analysis of Godel logics with countable truth value sets with respect to the topological and order… 
2002
2002
We present a Sch?tte-Tait style cut-elimination proof for the hypersequent calculus HIF for first-order G?del logic. This proof… 
2001
2001
This paper introduces the reader to the Gödel logic and to several related calculi. 
2000
2000
It is shown that G↑qp, the quantified propositional Godel logic based on the truth-value set V↑ = {1--1/n: n ≥ 1} ∪ {1}, is… 
Highly Cited
1998
Highly Cited
1998
  • P. Hájek
  • Trends in Logic
  • 1998
  • Corpus ID: 61701554
Preface. 1. Preliminaries. 2. Many-Valued Propositional Calculi. 3. Lukasiewicz Propositional Logic. 4. Product Logic, Godel…