The truth is never simple
From MaRDI portal
Recommendations
Cites work
Cited in
(49)- Characteristics of discrete transfinite time Turing machine models: Halting times, stabilization times, and normal form theorems
- Infinite time extensions of Kleene's \({\mathcal O}\)
- Supervaluation-style truth without supervaluations
- Truth, partial logic and infinitary proof systems
- The opacity of truth
- Possible-worlds semantics for modal notions conceived as predicates
- A contextual-hierarchical approach to truth and the liar paradox
- Revision without revision sequences: self-referential truth
- Cut elimination for systems of transparent truth with restricted initial sequents
- Cofinally invariant sequences and revision
- Truth, dependence and supervaluation: living with the ghost
- Conditionals in theories of truth
- Rethinking revision
- The undecidability of propositional adaptive logic
- One hundred years of semantic paradox
- On Gupta-Belnap revision theories of truth, Kripkean fixed points and the next stable set
- Some observations on truth hierarchies
- (In Some Fictions) Everything is True
- On revision operators
- Ultimate truth vis-à-vis stable truth
- Games for truth
- scientific article; zbMATH DE number 48555 (Why is no real title available?)
- A theory of truth based on a medieval solution to the liar paradox
- The limits of determinacy in second order arithmetic: consistency and complexity strength
- Revision revisited
- A disquotational theory of truth as strong as \(Z_2^-\)
- Characterisations of variant transfinite computational models: Infinite time Turing, ordinal time Turing, and Blum–Shub–Smale machines
- Self-reference in arithmetic. II
- Non-classical elegance for sequent calculus enthusiasts
- Infinitary tableau for semantic truth
- Axiomatizing semantic theories of truth?
- Notes on the computational aspects of Kripke's theory of truth
- A UNIFIED THEORY OF TRUTH AND PARADOX
- What mathematical theories of truth should be (and can be)
- A NOTE ON THEORIES FOR QUASI-INDUCTIVE DEFINITIONS
- Guest editors' introduction
- A Kripkean approach to unknowability and truth
- Set-theoretic absoluteness and the revision theory of truth
- Truth in applicative theories
- Truth meets vagueness. Unifying the semantic and the soritical paradoxes
- Procedural semantics and its relevance to paradox
- Which `intensional paradoxes' are paradoxes?
- Tarskian and Kripkean truth
- Some notes on truths and comprehension
- On logical and scientific strength
- Modal definability in Kripke's theory of truth
- Kripke's fixed points and Leitgeb's semantic dependence
- What truth depends on
- Comparing inductive and circular definitions: Parameters, complexity and games
This page was built for publication: The truth is never simple
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3772173)
