The truth is never simple
From MaRDI portal
Publication:3772173
DOI10.2307/2274021zbMath0634.03002OpenAlexW2049533159MaRDI QIDQ3772173
Publication date: 1986
Published in: Journal of Symbolic Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/2274021
surveytruth predicateopen questionsanalytical hierarchyfixed-pointsinductive definitionstheories of truthcomplexities of truthcomplexity of the set of truths of arithmeticpartially self-referring languagesstabilization under revision
Philosophical and critical aspects of logic and foundations (03A05) First-order arithmetic and fragments (03F30)
Related Items
One hundred years of semantic paradox, A contextual-hierarchical approach to truth and the liar paradox, On revision operators, Supervaluation-style truth without supervaluations, Truth, dependence and supervaluation: living with the ghost, Truth, partial logic and infinitary proof systems, SOME OBSERVATIONS ON TRUTH HIERARCHIES, A theory of truth based on a medieval solution to the liar paradox, Conditionals in theories of truth, Rethinking revision, Discrete Transfinite Computation, Truth meets vagueness. Unifying the semantic and the soritical paradoxes, A UNIFIED THEORY OF TRUTH AND PARADOX, The limits of determinacy in second order arithmetic: consistency and complexity strength, The undecidability of propositional adaptive logic, REVISION REVISITED, A disquotational theory of truth as strong as \(Z_2^-\), Tarskian and Kripkean truth, Guest editors' introduction, Non-classical elegance for sequent calculus enthusiasts, Notes on the computational aspects of Kripke's theory of truth, Revision without revision sequences: self-referential truth, ULTIMATE TRUTHVIS-À-VISSTABLE TRUTH, SELF-REFERENCE IN ARITHMETIC II, A Kripkean approach to unknowability and truth, On Gupta-Belnap Revision Theories of Truth, Kripkean Fixed Points, and The Next Stable Set, Some notes on truths and comprehension, Characteristics of discrete transfinite time Turing machine models: Halting times, stabilization times, and normal form theorems, Possible-worlds semantics for modal notions conceived as predicates, Infinite time extensions of Kleene's \({\mathcal O}\), Cut elimination for systems of transparent truth with restricted initial sequents, Games for Truth, Characterisations of variant transfinite computational models: Infinite time Turing, ordinal time Turing, and Blum–Shub–Smale machines, A NOTE ON THEORIES FOR QUASI-INDUCTIVE DEFINITIONS, INFINITARY TABLEAU FOR SEMANTIC TRUTH, AXIOMATIZING SEMANTIC THEORIES OF TRUTH?, Cofinally invariant sequences and revision, What truth depends on, Comparing inductive and circular definitions: Parameters, complexity and games
Cites Work
