Notes on the computational aspects of Kripke's theory of truth

DOI10.1007/s11225-016-9694-8zbMath1417.03244OpenAlexW2548144016MaRDI QIDQ526739

Stanislav O. Speranski

Publication date: 15 May 2017

Published in: Studia Logica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11225-016-9694-8

zbMATH Keywords

complexitytruthdependencegroundednessinductive definitions

Mathematics Subject Classification ID

Second- and higher-order arithmetic and fragments (03F35) Gödel numberings and issues of incompleteness (03F40) Higher-type and set recursion theory (03D65) Inductive definability (03D70)

Related Items (3)

Notes on Leitgeb's Ruitenburg ⋮ Some notes on truths and comprehension ⋮ THE MODAL LOGICS OF KRIPKE–FEFERMAN TRUTH

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A note on definability in fragments of arithmetic with free unary predicates
• What truth depends on
• Elementary induction on abstract structures
• A theory of truth that prefers falsehood
• Truth, dependence and supervaluation: living with the ghost
• The complexity of the dependence operator
• Some new results in monadic second-order arithmetic
• AXIOMS FOR DETERMINATENESS AND TRUTH
• The truth is never simple
• On the weak Kleene scheme in Kripke's theory of truth
• Presburger arithmetic with unary predicates is Π₁¹ complete
• Outline of a Theory of Truth
• INFINITARY TABLEAU FOR SEMANTIC TRUTH
• AXIOMATIZING SEMANTIC THEORIES OF TRUTH?

This page was built for publication: Notes on the computational aspects of Kripke's theory of truth